답안 #439474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439474	2021-06-30T05:37:36 Z	Idkwhoami	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	240 KB

molecules

#include<bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w){
    int n = w.size();
    
    vector<pair<int, int>> v(n);
    vector<int> pf(n);

    for(int i = 0;i<n;i++){
        v[i].first = w[i];
        v[i].second = i;
    }
    pf[0] = v[0].first;
    
    sort(v.begin(), v.end());
    for(int i = 1;i<n;i++)pf[i] = pf[i-1] + v[i].first;

    map<int, int> pos;
    for(int i = 0;i<n;i++){
        pos[pf[i]] = i;
    }

    for(int i = 0;i<n;i++){

        if(pf[i] < l)continue;
        if(pf[i] >= l && pf[i] <= u){
            vector<int> a(i+1);
            for(int j = 0;j<=i;j++)a[j] = v[j].second;

            return a;
        }

        int req = pf[i] - u;
        auto itr = lower_bound(pf.begin(), pf.end(), req);
        if(pf[i] - *itr >= l && pf[i] - *itr <= u){
            vector<int> a(i - pos[*itr]);
            for(int j = pos[*itr] + 1, k = 0; j <= i;j++,k++)a[k] = v[j].second;
            return a;
        }                
    }
    return vector<int>{};
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	204 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	204 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	224 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	204 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	204 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	240 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	204 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	204 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	204 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	204 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	204 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	204 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
51	Incorrect	1 ms	204 KB	sum of weights should be in [990..1000] but it is 986
52	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	204 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	204 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	224 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	204 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	204 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	240 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	204 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	204 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	204 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	204 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	204 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	204 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
51	Incorrect	1 ms	204 KB	sum of weights should be in [990..1000] but it is 986
52	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	204 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	204 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	224 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	204 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	204 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	240 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	204 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	204 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	204 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	204 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	204 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	204 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
51	Incorrect	1 ms	204 KB	sum of weights should be in [990..1000] but it is 986
52	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	204 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	204 KB	OK (n = 1, answer = YES)
4	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
5	Correct	1 ms	204 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
7	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
10	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
11	Correct	0 ms	204 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
13	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
15	Correct	1 ms	204 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
17	Correct	1 ms	204 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
19	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
20	Correct	1 ms	224 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	204 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	204 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	240 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
25	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
26	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	204 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	204 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	204 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	204 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	204 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	204 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	204 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	204 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	204 KB	OK (n = 100, answer = YES)
51	Incorrect	1 ms	204 KB	sum of weights should be in [990..1000] but it is 986
52	Halted	0 ms	0 KB	-

답안 #439474

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 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
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0