CSES - Datatähti 2015 loppu - Results
Submission details
Task:Omenat
Sender:SampoH
Submission time:2015-01-29 12:33:18
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED17
#2ACCEPTED30
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.08 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.06 s2details
#9ACCEPTED0.07 s2details
#10ACCEPTED0.06 s2details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.09 s3details
#14ACCEPTED0.11 s3details
#15ACCEPTED0.09 s3details
#16ACCEPTED0.10 s3details
#17ACCEPTED0.10 s3details
#18ACCEPTED0.10 s3details

Code

#include <iostream>

using namespace std;

#define ll long long

int main(int argc, char ** argv) {
	cin.sync_with_stdio(false);

	ll lkm;
	ll * painot = new ll[lkm];
	cin >> lkm;
	ll tulos = 0;
	ll h = 0;
	ll * mod = new ll[lkm];
	ll a = 0;
	ll b = 0;
	for (ll i = 0; i < lkm; i++) {
		cin >> painot[i];
		mod[i] = painot[i] % 3;
		if (mod[i] == 1) a++;
		if (mod[i] == 2) b++;
		h = (h + mod[i]) % 3;
	}
	tulos = lkm;
	while (h > 0) {
		if (h == 1) {
			if (a>0) {
				h = 0;
				tulos--;
			} else if (b>0) {
				h = 2;
				tulos--;
				b--;
			} else {
				tulos = 0;
				h = 0;
			}
		} else if (h == 2) {
			if (b>0) {
				h = 0;
				tulos--;
			} else if (a>0) {
				h = 1;
				tulos--;
				a--;
			} else {
				tulos = 0;
				h = 0;
			}
		}
	}
	
	cout << tulos << "\n";
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
20
34 98 42 72 75 91 76 30 98 7 1...

correct output
20

user output
20

Test 2

Group: 1

Verdict: ACCEPTED

input
20
20 97 85 24 47 57 69 92 21 72 ...

correct output
19

user output
19

Test 3

Group: 1

Verdict: ACCEPTED

input
20
36 35 3 15 84 14 24 33 39 27 7...

correct output
18

user output
18

Test 4

Group: 1

Verdict: ACCEPTED

input
20
75 87 27 66 14 48 34 1 52 47 7...

correct output
20

user output
20

Test 5

Group: 1

Verdict: ACCEPTED

input
20
83 7 54 38 21 51 61 61 14 32 3...

correct output
19

user output
19

Test 6

Group: 1

Verdict: ACCEPTED

input
20
76 24 28 45 36 87 81 21 48 43 ...

correct output
18

user output
18

Test 7

Group: 2

Verdict: ACCEPTED

input
100
9 48 27 13 12 23 23 35 14 58 2...

correct output
100

user output
100

Test 8

Group: 2

Verdict: ACCEPTED

input
100
22 87 66 23 77 17 41 66 31 40 ...

correct output
99

user output
99

Test 9

Group: 2

Verdict: ACCEPTED

input
100
90 50 48 47 20 93 36 48 69 2 6...

correct output
98

user output
98

Test 10

Group: 2

Verdict: ACCEPTED

input
100
88 39 9 21 51 92 94 75 71 19 8...

correct output
100

user output
100

Test 11

Group: 2

Verdict: ACCEPTED

input
100
76 37 49 50 59 68 6 100 48 18 ...

correct output
99

user output
99

Test 12

Group: 2

Verdict: ACCEPTED

input
100
78 45 100 25 90 85 33 90 45 54...

correct output
98

user output
98

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
460655049 593289072 315159623 ...

correct output
100000

user output
100000

Test 14

Group: 3

Verdict: ACCEPTED

input
100000
935436362 204516709 337519402 ...

correct output
99999

user output
99999

Test 15

Group: 3

Verdict: ACCEPTED

input
100000
68654915 40061376 215300034 43...

correct output
99998

user output
99998

Test 16

Group: 3

Verdict: ACCEPTED

input
100000
435410962 22254303 500625758 6...

correct output
100000

user output
100000

Test 17

Group: 3

Verdict: ACCEPTED

input
100000
230562634 84329865 874955526 8...

correct output
99999

user output
99999

Test 18

Group: 3

Verdict: ACCEPTED

input
100000
29734968 168066517 710394372 3...

correct output
99998

user output
99998