Submission #991667


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n;
  cin >> n;
  if(n==1||n==2) pr(n);
  else if(n==4) {
    pr(1);
    pr(3);
  } else if(n%2) {
    pr(n/2);
    pr(n/2+n%2);
  } else {
    pr(n/2);
    pr(1);
    pr(n/2-1);
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}

Submission Info

Submission Time
Task B - Exactly N points
User kzyKT
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1341 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 6
WA × 7
AC × 6
WA × 15
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 256 KB
01-02.txt AC 2 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt WA 2 ms 256 KB
01-05.txt WA 2 ms 256 KB
01-06.txt WA 2 ms 256 KB
01-07.txt WA 2 ms 256 KB
01-08.txt WA 2 ms 256 KB
01-09.txt WA 2 ms 256 KB
01-10.txt WA 2 ms 256 KB
02-01.txt WA 2 ms 256 KB
02-02.txt WA 2 ms 256 KB
02-03.txt WA 2 ms 256 KB
02-04.txt WA 2 ms 256 KB
02-05.txt WA 2 ms 256 KB
02-06.txt WA 2 ms 256 KB
02-07.txt WA 2 ms 256 KB
02-08.txt WA 2 ms 256 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB
sample-03.txt AC 2 ms 256 KB