Code Submission Evaluation System Login

Datatähti 2019 alku

Start:2018-10-01 00:00:00
End:2018-10-15 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2019 alku - Results
History
2018-10-01 00:50:17100
Task:Kolikot
Sender:Yytsi
Submission time:2018-10-01 00:50:17
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED23
#2ACCEPTED25
#3ACCEPTED52

Test results

testverdicttime (s)group
#1ACCEPTED0.03 / 1.001details
#2ACCEPTED0.01 / 1.001details
#3ACCEPTED0.02 / 1.001details
#4ACCEPTED0.02 / 1.001details
#5ACCEPTED0.03 / 1.001details
#6ACCEPTED0.01 / 1.001details
#7ACCEPTED0.03 / 1.001details
#8ACCEPTED0.01 / 1.001details
#9ACCEPTED0.02 / 1.001details
#10ACCEPTED0.01 / 1.001details
#11ACCEPTED0.03 / 1.002details
#12ACCEPTED0.02 / 1.002details
#13ACCEPTED0.02 / 1.002details
#14ACCEPTED0.01 / 1.002details
#15ACCEPTED0.02 / 1.002details
#16ACCEPTED0.03 / 1.002details
#17ACCEPTED0.02 / 1.002details
#18ACCEPTED0.02 / 1.002details
#19ACCEPTED0.03 / 1.002details
#20ACCEPTED0.01 / 1.002details
#21ACCEPTED0.02 / 1.003details
#22ACCEPTED0.02 / 1.003details
#23ACCEPTED0.03 / 1.003details
#24ACCEPTED0.01 / 1.003details
#25ACCEPTED0.02 / 1.003details
#26ACCEPTED0.02 / 1.003details
#27ACCEPTED0.02 / 1.003details
#28ACCEPTED0.02 / 1.003details
#29ACCEPTED0.03 / 1.003details
#30ACCEPTED0.03 / 1.003details

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define ff first
#define ss second
#define pb push_back
#define INF 2147483647
#define LINF (1LL<<61LL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

multiset<ll> S;
ll n;

#define N 201010
ll qaq[N];

bool under(ll k) {
	return qaq[k] < n;
}

void checkTriv() {
	FOR(i,1,N) {
		if (n == qaq[i]) {
			cout<<i<<"\n";
			FOR(j,1,i+1) cout<<j<<" ";
			exit(0);
		}
	}
}

int main() {
	IO; cin>>n;
	if (n==2) {
		cout<<"1\n2";
		return 0;
	}
	ll add = 1;
	ll c = 0;
	
	int rip = 0;
	while (c+add <= (ll)1e10) {
		c+=add;
		add++;
		qaq[++rip] = c;
	}
	
	FOR(i,1,N) if(qaq[i]==0)qaq[i]=LINF;
	checkTriv();
	
	ll k = 0;
	for (ll z = N/2; z >= 1; z /= 2) {
		while (k+z<N && under(k+z)) k+=z;
	}
	
	
	ll req = n-qaq[k-1];
	cout<<k<<"\n";
	FOR(j,1,k-1+1)cout<<j<<" ";
	cout<<req;
}














Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1
view   save

correct output
1
1
view   save

user output
1
1
view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
2
view   save

correct output
1
2
view   save

user output
1
2
view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
3
view   save

correct output
2
1 2
view   save

user output
2
1 2
view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
4
view   save

correct output
2
1 3
view   save

user output
2
1 3
view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
5
view   save

correct output
2
1 4
view   save

user output
2
1 4
view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
6
view   save

correct output
3
1 2 3
view   save

user output
3
1 2 3
view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
7
view   save

correct output
3
1 2 4
view   save

user output
3
1 2 4
view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
8
view   save

correct output
3
1 2 5
view   save

user output
3
1 2 5
view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
9
view   save

correct output
3
1 2 6
view   save

user output
3
1 2 6
view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
10
view   save

correct output
4
1 2 3 4
view   save

user output
4
1 2 3 4
view   save

Test 11

Group: 2

Verdict: ACCEPTED

input
11
view   save

correct output
4
1 2 3 5
view   save

user output
4
1 2 3 5
view   save

Test 12

Group: 2

Verdict: ACCEPTED

input
54
view   save

correct output
9
1 2 3 4 5 6 7 8 18
view   save

user output
9
1 2 3 4 5 6 7 8 18
view   save

Test 13

Group: 2

Verdict: ACCEPTED

input
55
view   save

correct output
10
1 2 3 4 5 6 7 8 9 10
view   save

user output
10
1 2 3 4 5 6 7 8 9 10
view   save

Test 14

Group: 2

Verdict: ACCEPTED

input
56
view   save

correct output
10
1 2 3 4 5 6 7 8 9 11
view   save

user output
10
1 2 3 4 5 6 7 8 9 11
view   save

Test 15

Group: 2

Verdict: ACCEPTED

input
123
view   save

correct output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 16

Group: 2

Verdict: ACCEPTED

input
819
view   save

correct output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 17

Group: 2

Verdict: ACCEPTED

input
820
view   save

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 18

Group: 2

Verdict: ACCEPTED

input
821
view   save

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 19

Group: 2

Verdict: ACCEPTED

input
999
view   save

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 20

Group: 2

Verdict: ACCEPTED

input
1000
view   save

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 21

Group: 3

Verdict: ACCEPTED

input
1274
view   save

correct output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 22

Group: 3

Verdict: ACCEPTED

input
1275
view   save

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 23

Group: 3

Verdict: ACCEPTED

input
1276
view   save

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 24

Group: 3

Verdict: ACCEPTED

input
12345
view   save

correct output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 25

Group: 3

Verdict: ACCEPTED

input
123456
view   save

correct output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 26

Group: 3

Verdict: ACCEPTED

input
10000000
view   save

correct output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 27

Group: 3

Verdict: ACCEPTED

input
100000000
view   save

correct output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 28

Group: 3

Verdict: ACCEPTED

input
500000000
view   save

correct output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 29

Group: 3

Verdict: ACCEPTED

input
999999999
view   save

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

Test 30

Group: 3

Verdict: ACCEPTED

input
1000000000
view   save

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save

user output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view   save