답안 #134061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134061	2019-07-22T03:43:51 Z	junodeveloper	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	3 ms	380 KB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int i;
	set<pair<long long,int> > st;
	long long sum=0;
	st.insert({0,-1});
	for(i=0;i<w.size();i++) {
		sum+=w[i];
		auto it=st.lower_bound({sum-u,-1});
		if(it!=st.end()) {
			if(it->first<=sum-l) {
				vector<int> ans;
				for(int j=it->second+1;j<=i;j++) ans.push_back(j);
				return ans;
			}
		}
		st.insert({sum,i});
	}
	return vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<w.size();i++) {
          ~^~~~~~~~~

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

Subtask #2
10.0 / 10.0

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

답안 #134061

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