CSES - Datatähti 2018 loppu - Results
Submission details
Task:Metsämetro
Sender:Olli
Submission time:2018-01-18 15:15:59 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#20.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#50.05 s1details
#60.05 s1details
#70.05 s1details
#80.04 s1details
#90.04 s1details
#100.04 s1details
#110.05 s2details
#12ACCEPTED0.05 s2details
#13ACCEPTED0.05 s2details
#140.04 s2details
#15ACCEPTED0.04 s2details
#160.05 s2details
#170.05 s2details
#180.04 s2details
#19ACCEPTED0.05 s2details
#200.05 s2details
#21ACCEPTED0.11 s3details
#220.12 s3details
#230.13 s3details
#240.11 s3details
#25ACCEPTED0.12 s3details
#26ACCEPTED0.09 s3details
#270.09 s3details
#280.11 s3details
#290.12 s3details
#300.10 s3details

Code

#include <iostream>

using namespace std;

typedef long long ll;

const int N = 1e5 + 5;

int table[N];
ll sum[N];

int n;

ll exp(int b, int e) {
	if(e == 0) return 1;
	if(e%2 == 0) {
		ll ans = exp(b, e/2);
		return ans*ans;
	}
	ll ans = exp(b, e-1);
	return ans*b;
}

bool isPath(int index, ll sum) {
	ll curSum = 0;
	for(int i = index; i <= n; ++i) {
		curSum += table[i];
	}
	if(curSum < sum) return false;
	if((curSum - sum)%2 == 0) return true;
	return false;
}


bool canDo(ll x) {
	ll curSum = 0;
	int index = 0;
	int parity = 0;
	for(int i = 1; i <= n; ++i) {
		curSum += table[i];
		index = i;
		if(curSum >= x) break;
	}
	parity = curSum%2;
	++index;
	if(isPath(index, x + parity)) {
		return true;
	}
	return false;
}



int main() {
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> table[i];
		sum[i] = table[i] + sum[i-1];
	}
	cout << max(table[1], table[n]) << " ";

	ll ans = 0;
	for(int b = 60; b >= 0; --b) {
		ll cur = exp(2, b) + ans;
		//cout << b << " " << cur << "\n";
		if(canDo(cur)) {
			ans = cur;
			//cout << ans << "\n";
		}
	}

	//cout << canDo(8) << "\n";

	cout << ans << "\n";
	
	

}

Test details

Test 1

Group: 1

Verdict:

input
10
9 4 9 7 6 10 4 6 2 9

correct output
9 31

user output
9 30

Test 2

Group: 1

Verdict:

input
10
5 6 3 5 6 3 4 7 1 10

correct output
10 25

user output
10 24

Test 3

Group: 1

Verdict: ACCEPTED

input
10
10 2 4 1 4 9 6 3 5 10

correct output
10 24

user output
10 24

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 5 1 3 8 4 5 4 6 3

correct output
7 22

user output
7 22

Test 5

Group: 1

Verdict:

input
10
10 7 8 4 10 6 8 6 2 3

correct output
10 29

user output
10 28

Test 6

Group: 1

Verdict:

input
10
1 2 8 2 3 1 3 1 4 9

correct output
9 17

user output
9 16

Test 7

Group: 1

Verdict:

input
10
2 8 2 5 8 8 5 10 9 7

correct output
7 31

user output
7 30

Test 8

Group: 1

Verdict:

input
10
2 10 4 8 10 10 9 3 9 7

correct output
8 34

user output
7 34

Test 9

Group: 1

Verdict:

input
10
10 7 9 1 7 8 4 4 1 5

correct output
10 27

user output
10 26

Test 10

Group: 1

Verdict:

input
10
1 4 7 7 3 1 10 6 4 3

correct output
5 23

user output
3 22

Test 11

Group: 2

Verdict:

input
100
5 3 4 7 5 1 7 1 6 10 2 9 6 5 9...

correct output
6 281

user output
5 280

Test 12

Group: 2

Verdict: ACCEPTED

input
100
3 9 7 3 6 6 4 3 1 8 2 4 2 6 2 ...

correct output
7 252

user output
7 252

Test 13

Group: 2

Verdict: ACCEPTED

input
100
8 2 3 4 8 3 2 7 10 10 3 2 3 4 ...

correct output
8 252

user output
8 252

Test 14

Group: 2

Verdict:

input
100
4 4 9 8 5 6 2 3 7 10 10 2 7 5 ...

correct output
9 261

user output
9 260

Test 15

Group: 2

Verdict: ACCEPTED

input
100
7 3 3 5 10 6 6 8 10 5 5 8 3 5 ...

correct output
10 300

user output
10 300

Test 16

Group: 2

Verdict:

input
100
9 5 2 1 9 8 6 4 1 6 3 5 3 1 4 ...

correct output
9 289

user output
9 288

Test 17

Group: 2

Verdict:

input
100
9 7 5 5 4 1 9 2 3 5 10 2 10 5 ...

correct output
9 287

user output
9 286

Test 18

Group: 2

Verdict:

input
100
3 8 5 10 8 10 9 2 8 3 1 2 9 7 ...

correct output
6 282

user output
3 282

Test 19

Group: 2

Verdict: ACCEPTED

input
100
6 3 9 2 8 7 8 4 6 4 4 10 2 10 ...

correct output
8 260

user output
8 260

Test 20

Group: 2

Verdict:

input
100
10 8 7 8 10 3 1 2 1 1 7 4 5 5 ...

correct output
10 279

user output
10 278

Test 21

Group: 3

Verdict: ACCEPTED

input
100000
917855934 394938644 81692499 4...

correct output
917855934 23490295363738

user output
917855934 23490295363738

Test 22

Group: 3

Verdict:

input
100000
898177957 193852227 11785863 3...

correct output
898177957 23488890808371

user output
898177957 23488890808370

Test 23

Group: 3

Verdict:

input
100000
560743028 996665755 25721760 4...

correct output
576170439 23599624330076

user output
560743028 23599624330076

Test 24

Group: 3

Verdict:

input
100000
836491959 800539061 666447484 ...

correct output
836491959 23450143338851

user output
836491959 23450143338850

Test 25

Group: 3

Verdict: ACCEPTED

input
100000
156445358 170997055 927078622 ...

correct output
930838017 23503313036290

user output
930838017 23503313036290

Test 26

Group: 3

Verdict: ACCEPTED

input
100000
869942654 614144284 154904581 ...

correct output
869942654 23544105883410

user output
869942654 23544105883410

Test 27

Group: 3

Verdict:

input
100000
471025024 244072220 419574192 ...

correct output
657776925 23597080152723

user output
471025024 23597080152722

Test 28

Group: 3

Verdict:

input
100000
561299091 285120535 109702008 ...

correct output
862325964 23517085653307

user output
561299091 23517085653306

Test 29

Group: 3

Verdict:

input
100000
356879006 3017698 603259365 18...

correct output
499995467 23540251578008

user output
356879006 23540251578008

Test 30

Group: 3

Verdict:

input
100000
190109479 83895435 595795373 8...

correct output
598676555 23565408317817

user output
598676555 23565408317816