Submission #991925


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int n;
vector<int> res;

bool ok(int x){
	return x*(x+1)/2>=n;
}

int main(){
	cin.sync_with_stdio(false);
	cin>>n;
	int lb=1,ub=n;
	while(ub-lb>1){
		int mid=(lb+ub)/2;
		if(ok(mid))ub=mid;
		else lb=mid;
	}
	res.pb(ub);
	n-=ub;
	for(int i=ub-1;i>=1;i--){
		if(n>=i){
			n-=i;
			res.pb(i);
		}
	}
	reverse(all(res));
	rep(i,res.size())cout<<res[i]<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - Exactly N points
User yamad
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1151 Byte
Status WA
Exec Time 18 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 3
AC × 13
AC × 13
WA × 8
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 AC 3 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 3 ms 256 KB
01-07.txt AC 3 ms 256 KB
01-08.txt AC 3 ms 256 KB
01-09.txt AC 3 ms 256 KB
01-10.txt AC 3 ms 256 KB
02-01.txt WA 5 ms 256 KB
02-02.txt WA 5 ms 256 KB
02-03.txt WA 5 ms 256 KB
02-04.txt WA 5 ms 256 KB
02-05.txt WA 18 ms 256 KB
02-06.txt WA 7 ms 256 KB
02-07.txt WA 3 ms 256 KB
02-08.txt WA 17 ms 256 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 3 ms 256 KB
sample-03.txt AC 3 ms 256 KB