답안 #1102195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102195	2024-10-17T16:07:15 Z	akzytr	Detecting Molecules (IOI16_molecules)	C++17	19 / 100	1 ms	504 KB

molecules

// #include "molecules.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	ll p = 0;
	vector<int> result;

	set<ll> pss;
	map<ll, int> psjn;

	psjn[0] = -1;
	pss.insert(0);
	for(int i = 0; i < w.size(); i++) {
		p += w[i];
		auto lb = pss.lower_bound(p - u);
		if(lb == pss.end()) {
			lb--;
		}

		if(lb != pss.end() && p - *lb >= l && p - *lb <= u) {
			for(int j = psjn[*lb] + 1; j <= i; j++) {
				result.push_back(j);
			}
			break;
		}

		pss.insert(p);
		psjn[p] = i;
	}

	return result;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i = 0; i < w.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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

답안 #1102195

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