답안 #54069 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
54069	2018-07-02T09:38:12 Z	MoNsTeR_CuBe	Detecting Molecules (IOI16_molecules)	C++17	19 / 100	3 ms	672 KB

molecules

//#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

int Segtree[4*109];

int Q(int l, int r, int pos, int ql, int qr){
    if(ql > r || qr < l){
        return 0;
    }
    if(l >= ql && r <= qr){
        return Segtree[pos];
    }
    int mid = (l+r)/2;
    return Q(l,mid, pos*2, ql, qr) + Q(mid+1, r, pos*2+1, ql, qr);
}

void B(vector<int> w, int l, int r, int pos){
    if(l == r){
        Segtree[pos] = w[l-1];
        return;
    }
    int mid = (l+r)/2;
    B(w, l, mid, pos*2);
    B(w, mid+1, r, pos*2+1);
    Segtree[pos] = Segtree[pos*2+1]+Segtree[pos*2];
}

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    B(w, 1, n, 1);
    //for(int i = 1; i < 8; i++) cout << Segtree[i] << ' ';
    //cout << endl;
    for(int i = 0; i < n; i++){
        for(int j = i; j < n; j++){
            int a = Q(1,n, 1, i+1,j+1);
            if(a <= u && a>=l){
                //cout << a << endl;
                vector<int> v(0);
                for(int k = i; k <= j; k++){
                    v.push_back(k);
                }
                return v;
            }
        }
    }
    vector<int> v(0);
    return v;
}

/*int main(){
    int a, b, c;
    cin >> a >> b >> c;
    vector<int> v(0);
    for(int i = 0; i < a; i++){
        int d;
        cin >> d;
        v.push_back(d);
    }
    v = find_subset(a,b,c,v);
    cout << v.size() << endl;
    for(int i = 0; i < v.size(); i++){
        cout << v[i] << ' ';
    }
    cout << endl;
}*/

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	1 ms	508 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	508 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	672 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	672 KB	OK (n = 3, answer = YES)
16	Correct	3 ms	672 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	672 KB	OK (n = 3, answer = NO)
18	Correct	3 ms	672 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	672 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

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

답안 #54069

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