답안 #73042 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73042	2018-08-27T14:25:47 Z	dmfr	Detecting Molecules (IOI16_molecules)	C++11	31 / 100	1000 ms	29888 KB

molecules

#include "molecules.h"

#include <map>
#include <deque>
#include <vector>

#include <algorithm>

#include <iostream>

using namespace std;

typedef pair<int,int> pii;

/*
4 15 17
6 8 8 7
=>2
=>2 3

4 14 15
5 5 6 6
=>0

4 10 20
15 17 16 18
=>1
=>3

4 0 0
0 0 0 0
=>1
=>3

*/

vector<int> find_subset(int l, int u, vector<int> w) {
    const int& N = w.size();

    vector<pii> wVtr(N);
    for(int i = 0; i < N; ++i)
        wVtr[i] = pii(w[i], i);

    sort(wVtr.begin(), wVtr.end());
    while(!wVtr.empty() && wVtr.front().first > u) wVtr.pop_back();
    if(wVtr.empty())                      return vector<int>(0);
    if(l <= wVtr.back().first && wVtr.back().first <= u) return vector<int>(1,wVtr.back().second);
    reverse(wVtr.begin(),wVtr.end());

//    cout << "w:";
//    for(const auto& i:w) cout << i << " ";
//    cout << endl;

    int UpperBound = u;
    vector<int> LowerBound(N);
    LowerBound[N-1] = l-wVtr[N-1].first;
    for(int i = N-2; i >= 0; --i)
        LowerBound[i] = max(LowerBound[i+1] - wVtr[i].first, 0);

//    cout << "LowerBound[]:";
//    for(const auto& i:LowerBound) cout << i << " ";
//    cout << endl;

    vector<pair<bool,deque<int>>> PossibleNumbers(UpperBound+1);
//    map<int,deque<int>> PossibleNumbers;
    PossibleNumbers[0] = pair<bool,deque<int>>(true, deque<int>());
//    PossibleNumbers[0] = deque<int>();
    deque<pair<int,deque<int>>> ToInsert;
    for(int i = 0; i < N; ++i){
        const pii& w_i = wVtr[i];
        for(int j = LowerBound[i]; j <= UpperBound; ++j){
            const auto& n = PossibleNumbers[j];
            if(n.first && j+w_i.first <= UpperBound){
                ToInsert.push_back(pair<int,deque<int>>(j+w_i.first, n.second));
                ToInsert.back().second.push_back(w_i.second);
            }
        }
        while(!ToInsert.empty()){
            PossibleNumbers[ToInsert.back().first] = pair<bool,deque<int>>(true,ToInsert.back().second);
            ToInsert.pop_back();
        }

//        cout << "PossibleNumbers (before purge):" << endl;
//        for(const auto& n:PossibleNumbers){
//            cout << n.first << ": ";
//            for(const auto& m:n.second) cout << m << " ";
//            cout << endl;
//        }

//        while(!PossibleNumbers.empty() && PossibleNumbers.begin()->first < LowerBound_i)
//            PossibleNumbers.erase(PossibleNumbers.begin());

//        cout << "PossibleNumbers:" << endl;
//        for(int k = 0; k < PossibleNumbers.size(); ++k){
//            cout << k << ": " << (PossibleNumbers[k].first? "TRUE" : "FALSE") << " ";
//            for(const auto& m:PossibleNumbers[k].second) cout << m << " ";
//            cout << endl;
//        }cout << endl;

    }

    for(int i = l; i <= u; ++i){
        if(PossibleNumbers[i].first)
            return vector<int>(PossibleNumbers[i].second.begin(), PossibleNumbers[i].second.end());
    }


    return vector<int>(0);
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	3 ms	472 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	644 KB	OK (n = 1, answer = YES)
4	Correct	3 ms	644 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	644 KB	OK (n = 2, answer = YES)
6	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
9	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
10	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
11	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
12	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	680 KB	OK (n = 3, answer = NO)
14	Correct	3 ms	680 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	680 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
17	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	1224 KB	OK (n = 100, answer = NO)
19	Correct	4 ms	1224 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
2	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
3	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
4	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
5	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
6	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
7	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
8	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
9	Correct	2 ms	1224 KB	OK (n = 6, answer = YES)
10	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
11	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
12	Correct	3 ms	1224 KB	OK (n = 100, answer = YES)
13	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
14	Correct	4 ms	1280 KB	OK (n = 100, answer = YES)
15	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
16	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
17	Correct	11 ms	1408 KB	OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	3 ms	472 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	644 KB	OK (n = 1, answer = YES)
4	Correct	3 ms	644 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	644 KB	OK (n = 2, answer = YES)
6	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
9	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
10	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
11	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
12	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	680 KB	OK (n = 3, answer = NO)
14	Correct	3 ms	680 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	680 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
17	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	1224 KB	OK (n = 100, answer = NO)
19	Correct	4 ms	1224 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
21	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
24	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
25	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
26	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	1224 KB	OK (n = 6, answer = YES)
29	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
31	Correct	3 ms	1224 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
33	Correct	4 ms	1280 KB	OK (n = 100, answer = YES)
34	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
35	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
36	Correct	11 ms	1408 KB	OK (n = 100, answer = YES)
37	Correct	4 ms	1408 KB	OK (n = 28, answer = YES)
38	Correct	5 ms	1408 KB	OK (n = 27, answer = YES)
39	Correct	13 ms	1408 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
41	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	1408 KB	OK (n = 10, answer = YES)
43	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
44	Correct	10 ms	1536 KB	OK (n = 100, answer = YES)
45	Correct	6 ms	1536 KB	OK (n = 100, answer = YES)
46	Correct	7 ms	1536 KB	OK (n = 100, answer = YES)
47	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
48	Correct	2 ms	1536 KB	OK (n = 100, answer = NO)
49	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
50	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
51	Correct	19 ms	1792 KB	OK (n = 100, answer = YES)
52	Correct	25 ms	1792 KB	OK (n = 100, answer = YES)
53	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
54	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	3 ms	472 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	644 KB	OK (n = 1, answer = YES)
4	Correct	3 ms	644 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	644 KB	OK (n = 2, answer = YES)
6	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
9	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
10	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
11	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
12	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	680 KB	OK (n = 3, answer = NO)
14	Correct	3 ms	680 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	680 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
17	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	1224 KB	OK (n = 100, answer = NO)
19	Correct	4 ms	1224 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
21	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
24	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
25	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
26	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	1224 KB	OK (n = 6, answer = YES)
29	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
31	Correct	3 ms	1224 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
33	Correct	4 ms	1280 KB	OK (n = 100, answer = YES)
34	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
35	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
36	Correct	11 ms	1408 KB	OK (n = 100, answer = YES)
37	Correct	4 ms	1408 KB	OK (n = 28, answer = YES)
38	Correct	5 ms	1408 KB	OK (n = 27, answer = YES)
39	Correct	13 ms	1408 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
41	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	1408 KB	OK (n = 10, answer = YES)
43	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
44	Correct	10 ms	1536 KB	OK (n = 100, answer = YES)
45	Correct	6 ms	1536 KB	OK (n = 100, answer = YES)
46	Correct	7 ms	1536 KB	OK (n = 100, answer = YES)
47	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
48	Correct	2 ms	1536 KB	OK (n = 100, answer = NO)
49	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
50	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
51	Correct	19 ms	1792 KB	OK (n = 100, answer = YES)
52	Correct	25 ms	1792 KB	OK (n = 100, answer = YES)
53	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
54	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
55	Execution timed out	1076 ms	29888 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	3 ms	472 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	644 KB	OK (n = 1, answer = YES)
4	Correct	3 ms	644 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	644 KB	OK (n = 2, answer = YES)
6	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
9	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
10	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
11	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
12	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	680 KB	OK (n = 3, answer = NO)
14	Correct	3 ms	680 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	680 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
17	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	1224 KB	OK (n = 100, answer = NO)
19	Correct	4 ms	1224 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
21	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
24	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
25	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
26	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	1224 KB	OK (n = 6, answer = YES)
29	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
31	Correct	3 ms	1224 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
33	Correct	4 ms	1280 KB	OK (n = 100, answer = YES)
34	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
35	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
36	Correct	11 ms	1408 KB	OK (n = 100, answer = YES)
37	Correct	4 ms	1408 KB	OK (n = 28, answer = YES)
38	Correct	5 ms	1408 KB	OK (n = 27, answer = YES)
39	Correct	13 ms	1408 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
41	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	1408 KB	OK (n = 10, answer = YES)
43	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
44	Correct	10 ms	1536 KB	OK (n = 100, answer = YES)
45	Correct	6 ms	1536 KB	OK (n = 100, answer = YES)
46	Correct	7 ms	1536 KB	OK (n = 100, answer = YES)
47	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
48	Correct	2 ms	1536 KB	OK (n = 100, answer = NO)
49	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
50	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
51	Correct	19 ms	1792 KB	OK (n = 100, answer = YES)
52	Correct	25 ms	1792 KB	OK (n = 100, answer = YES)
53	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
54	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
55	Execution timed out	1076 ms	29888 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	OK (n = 1, answer = NO)
2	Correct	3 ms	472 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	644 KB	OK (n = 1, answer = YES)
4	Correct	3 ms	644 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	644 KB	OK (n = 2, answer = YES)
6	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	644 KB	OK (n = 3, answer = YES)
9	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
10	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
11	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
12	Correct	3 ms	644 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	680 KB	OK (n = 3, answer = NO)
14	Correct	3 ms	680 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	680 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
17	Correct	3 ms	680 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	1224 KB	OK (n = 100, answer = NO)
19	Correct	4 ms	1224 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
21	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	1224 KB	OK (n = 12, answer = NO)
24	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
25	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
26	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	1224 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	1224 KB	OK (n = 6, answer = YES)
29	Correct	3 ms	1224 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
31	Correct	3 ms	1224 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	1224 KB	OK (n = 100, answer = NO)
33	Correct	4 ms	1280 KB	OK (n = 100, answer = YES)
34	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
35	Correct	9 ms	1408 KB	OK (n = 100, answer = YES)
36	Correct	11 ms	1408 KB	OK (n = 100, answer = YES)
37	Correct	4 ms	1408 KB	OK (n = 28, answer = YES)
38	Correct	5 ms	1408 KB	OK (n = 27, answer = YES)
39	Correct	13 ms	1408 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
41	Correct	3 ms	1408 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	1408 KB	OK (n = 10, answer = YES)
43	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
44	Correct	10 ms	1536 KB	OK (n = 100, answer = YES)
45	Correct	6 ms	1536 KB	OK (n = 100, answer = YES)
46	Correct	7 ms	1536 KB	OK (n = 100, answer = YES)
47	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
48	Correct	2 ms	1536 KB	OK (n = 100, answer = NO)
49	Correct	4 ms	1536 KB	OK (n = 100, answer = NO)
50	Correct	17 ms	1536 KB	OK (n = 100, answer = YES)
51	Correct	19 ms	1792 KB	OK (n = 100, answer = YES)
52	Correct	25 ms	1792 KB	OK (n = 100, answer = YES)
53	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
54	Correct	3 ms	1792 KB	OK (n = 100, answer = YES)
55	Execution timed out	1076 ms	29888 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #73042

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 15.0

Subtask #5 0 / 23.0

Subtask #6 0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0