답안 #114840

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114840	2019-06-03T13:16:02 Z	oolimry	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1000 ms	384 KB

molecules

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

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> v;

    int n = w.size();
    typedef pair<long long, long long> ii;

    ii arr[n];

    for(int i = 0;i < n;i++){
        arr[i] = ii(w[i],i);
    }

    sort(arr,arr+n);

    long long low = 0;
    long long high = 0;
    vector<int> ll;
    vector<int> hh;
    for(int c = 0;c < n;c++){
        low += arr[c].first;
        high += arr[n-c-1].first;
        ll.push_back(arr[c].second);
        hh.push_back(arr[n-c-1].second);
        if(l <= low && low <= u){
            return ll;
        }
        else if(l <= high && high <= u){
            return hh;
        }
        else if(low < l && high > u){
            for(int i = 0;i <= c;i++){
                long long x = ll[i];
                long long y = hh[i];
                low -= arr[x].first;
                low += arr[y].first;
                hh[i] = x;
                ll[i] = y;
                if(l <= low && low <= u){
                    return ll;
                }
            }
            while(true){

            }
        }
    }


    return v;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	356 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
44	Execution timed out	1076 ms	384 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	356 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
44	Execution timed out	1076 ms	384 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

Subtask #5
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	356 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
44	Execution timed out	1076 ms	384 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

Subtask #6
0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	256 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	384 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	384 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	384 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	256 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	384 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	384 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	384 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
31	Correct	2 ms	256 KB	OK (n = 100, answer = YES)
32	Correct	2 ms	384 KB	OK (n = 100, answer = NO)
33	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
34	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
35	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
37	Correct	2 ms	384 KB	OK (n = 28, answer = YES)
38	Correct	2 ms	384 KB	OK (n = 27, answer = YES)
39	Correct	2 ms	256 KB	OK (n = 90, answer = YES)
40	Correct	3 ms	256 KB	OK (n = 100, answer = YES)
41	Correct	2 ms	356 KB	OK (n = 100, answer = YES)
42	Correct	2 ms	384 KB	OK (n = 10, answer = YES)
43	Correct	2 ms	384 KB	OK (n = 100, answer = YES)
44	Execution timed out	1076 ms	384 KB	Time limit exceeded
45	Halted	0 ms	0 KB	-

답안 #114840

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