CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:comp
Submission time:2016-10-08 00:54:49 +0300
Language:C++
Status:READY
Result:57
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED35
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.05 s2details
#8ACCEPTED0.05 s2details
#9ACCEPTED0.05 s2details
#10ACCEPTED0.20 s2details
#11--3details
#12ACCEPTED0.06 s3details
#13ACCEPTED0.08 s3details
#14--3details
#15--3details
#16--3details

Code

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

int min_sum;

bool hasnt_skipped(std::set<int> &sums) {
    int previous = *(sums.begin());
    int highest = *(sums.rbegin());
    while (previous < highest) {
        if (sums.find(previous + 1) != sums.end()) {
            previous += 1;
            continue;
        } else {
            min_sum = previous + 1;
            return false;
        }
    }
    min_sum = highest + 1;
    return true;
}

int main() {
    int n;
    std::cin >> n;
    std::vector<int> coins;
    
    int x;
    for(int i = 0; i < n; ++i) {
        std::cin >> x;
        coins.push_back(x);
    }
    
    std::sort(coins.begin(), coins.end());
    
    std::set<int> sofar;
    std::vector<int> news;
    
    sofar.insert(0);
    
    for(auto c: coins) {
        for(auto s: sofar) {
            news.push_back(c + s);
        }
        for(auto nw: news) {
            sofar.insert(nw);
        }
        news.clear();
        
        bool skip_test;
        skip_test = hasnt_skipped(sofar);
        if (skip_test == true) {
            continue;
        } else {
            break;
        }
    }
    
    std::cout << min_sum;
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
30

Test 2

Group: 1

Verdict: ACCEPTED

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
1

Test 3

Group: 1

Verdict: ACCEPTED

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

correct output
62

user output
62

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
1

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
51

user output
51

Test 6

Group: 2

Verdict: ACCEPTED

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
269

Test 7

Group: 2

Verdict: ACCEPTED

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
1

Test 9

Group: 2

Verdict: ACCEPTED

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
30

Test 10

Group: 2

Verdict: ACCEPTED

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
41765

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
1

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)