답안 #52056 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
52056	2018-06-23T11:44:48 Z	tincamatei	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	3 ms	636 KB

molecules

#include<bits/stdc++.h>
#ifdef EVAL
#include "molecules.h"
#endif
 
using namespace std;
 
const int MAX_N = 200000;
long long _sp[1+MAX_N], *sp = _sp + 1;
 
vector<int> find_subset(int l, int u, vector<int> w) {
    int n, lx, rx;
    vector<pair<int, int> > w2;
    vector<int> result;
    n = w.size();
    lx = 2, rx = 1;
    
    for(int i = 0; i < n; ++i)
        w2.push_back(make_pair(w[i], i));
    
    //sort(w2.begin(), w2.end());
    
    for(int i = 0; i < n; ++i)
        w[i] = w2[i].first;
    
    for(int i = 0; i < n; ++i) {
        int st = -1, dr = i;
        sp[i] = sp[i - 1] + w[i];
        while(dr - st > 1) {
        	int mid = (st + dr) / 2;
            if(sp[i] - sp[mid] >= l)
                st = mid;
            else
                dr = mid;
        }
        if(l <= sp[i] - sp[st] && sp[i] - sp[st] <= u)
            lx = st, rx = i;
    }
    
    for(lx = lx + 1; lx <= rx; ++lx)
        result.push_back(w2[lx].second);
    return result;
}
 
#ifndef EVAL
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
#endif

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	356 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	432 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	540 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
13	Correct	3 ms	588 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	636 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	636 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	636 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	636 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
33	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
34	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	636 KB	OK (n = 28, answer = YES)
38	Correct	3 ms	636 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	636 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	636 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
44	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
45	Incorrect	2 ms	636 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	356 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	432 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	540 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
13	Correct	3 ms	588 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	636 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	636 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	636 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	636 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
33	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
34	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	636 KB	OK (n = 28, answer = YES)
38	Correct	3 ms	636 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	636 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	636 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
44	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
45	Incorrect	2 ms	636 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	356 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	432 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	540 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
13	Correct	3 ms	588 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	636 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	636 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	636 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	636 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
33	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
34	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	636 KB	OK (n = 28, answer = YES)
38	Correct	3 ms	636 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	636 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	636 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
44	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
45	Incorrect	2 ms	636 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	356 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	432 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	448 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	480 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	540 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	588 KB	OK (n = 3, answer = YES)
13	Correct	3 ms	588 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	592 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	636 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	636 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	636 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	636 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	636 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	636 KB	OK (n = 12, answer = YES)
30	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
32	Correct	3 ms	636 KB	OK (n = 100, answer = NO)
33	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
34	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	636 KB	OK (n = 28, answer = YES)
38	Correct	3 ms	636 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	636 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	636 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	636 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
44	Correct	2 ms	636 KB	OK (n = 100, answer = YES)
45	Incorrect	2 ms	636 KB	Contestant can not find answer, jury can
46	Halted	0 ms	0 KB	-

답안 #52056

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