Code Submission Evaluation System Login

Datatähti 2015 loppu

Start:2015-01-29 12:15:00
End:2015-01-29 17:15:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2015 loppu - Results
History
2015-01-29 22:18:52100
2015-01-29 22:15:130
2015-01-29 15:44:0117
2015-01-29 14:08:1017
Task:Omenat
Sender:attelaut
Submission time:2015-01-29 15:44:01
Language:C++
Status:READY
Score:17

Feedback

groupverdictscore
#1ACCEPTED17
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 2.001details
#2ACCEPTED0.06 / 2.001details
#3ACCEPTED0.06 / 2.001details
#4ACCEPTED0.07 / 2.001details
#5ACCEPTED0.07 / 2.001details
#6ACCEPTED0.06 / 2.001details
#7TIME LIMIT EXCEEDED-- / 2.002details
#8TIME LIMIT EXCEEDED-- / 2.002details
#9TIME LIMIT EXCEEDED-- / 2.002details
#10TIME LIMIT EXCEEDED-- / 2.002details
#11TIME LIMIT EXCEEDED-- / 2.002details
#12TIME LIMIT EXCEEDED-- / 2.002details
#13TIME LIMIT EXCEEDED-- / 2.003details
#14TIME LIMIT EXCEEDED-- / 2.003details
#15TIME LIMIT EXCEEDED-- / 2.003details
#16TIME LIMIT EXCEEDED-- / 2.003details
#17TIME LIMIT EXCEEDED-- / 2.003details
#18TIME LIMIT EXCEEDED-- / 2.003details

Code

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

struct Omenat {
    long m;
    long n;
};

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

    long n;
    cin >> n;
    vector<Omenat> p;
    long k = 0;
    long summa = 0;

    for (long i = 0; i < n; i++) {
        long o;
        cin >> o;

        if (o % 3 == 0) {
            k++;
        } else {
            Omenat om;
            om.m = o;
            om.n = 1;

            summa += o;
            long koko = p.size();
            for (long i = 0; i < koko; i++) {
                Omenat uusi = p[i];
                uusi.m += o;
                uusi.n += 1;
                p.push_back(uusi);
            }

            p.push_back(om);
        }
    }

    if (summa % 3 == 0) {
        cout << n << "\n";
    } else {
        long min_n = n - k;
        for (auto om : p) {
            if ((summa - om.m) % 3 == 0) {
                min_n = min(min_n, om.n);
            }
        }

        cout << n - min_n << "\n";
    }

    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
20

view   save

user output
20

view   save

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
19

view   save

user output
19

view   save

Test 3

Group: 1

Verdict: ACCEPTED

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

correct output
18

view   save

user output
18

view   save

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
20

view   save

user output
20

view   save

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
19

view   save

user output
19

view   save

Test 6

Group: 1

Verdict: ACCEPTED

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

correct output
18

view   save

user output
18

view   save

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
100

view   save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
99

view   save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
98

view   save

user output
(empty)

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
100

view   save

user output
(empty)

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
99

view   save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
98

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
460655049 593289072 315159623 ...
view   save

correct output
100000

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
935436362 204516709 337519402 ...
view   save

correct output
99999

view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
68654915 40061376 215300034 43...
view   save

correct output
99998

view   save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
435410962 22254303 500625758 6...
view   save

correct output
100000

view   save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
230562634 84329865 874955526 8...
view   save

correct output
99999

view   save

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000
29734968 168066517 710394372 3...
view   save

correct output
99998

view   save

user output
(empty)