답안 #75762 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
75762	2018-09-11T04:52:46 Z	Sherazin	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	2 ms	632 KB

molecules

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

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

vector<pii> V;
vector<int> ans;

vector<int> find_subset(int l, int u, vector<int> w) {
	for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
	sort(w.begin(), w.end());
	int L = 0, R = 0;
	long long sum = 0;
	while(L < w.size()) {
		while(R < w.size() && sum < l) sum += (long long)w[R++];
		if(l <= sum && sum <= u) {
			for(int i = L; i < R; i++) ans.emplace_back(V[i].y);
			return ans;
		}
		sum -= (long long)w[L++];
	}
	return {};
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:14:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i);
                 ~~^~~~~~~~~~
molecules.cpp:18:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(L < w.size()) {
        ~~^~~~~~~~~~
molecules.cpp:19:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(R < w.size() && sum < l) sum += (long long)w[R++];
         ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
2	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
3	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
4	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
5	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
6	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
7	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
8	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
9	Correct	2 ms	632 KB	OK (n = 6, answer = YES)
10	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
11	Correct	2 ms	632 KB	OK (n = 100, answer = NO)
12	Incorrect	2 ms	632 KB	sum of weights should be in [50..51] but it is 73
13	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	OK (n = 1, answer = NO)
2	Correct	2 ms	500 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	548 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	548 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	624 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	624 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	624 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	632 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	632 KB	OK (n = 100, answer = NO)
31	Incorrect	2 ms	632 KB	sum of weights should be in [50..51] but it is 73
32	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	500 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	548 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	548 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	624 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	624 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	624 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	632 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	632 KB	OK (n = 100, answer = NO)
31	Incorrect	2 ms	632 KB	sum of weights should be in [50..51] but it is 73
32	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	500 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	548 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	548 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	624 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	624 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	624 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	632 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	632 KB	OK (n = 100, answer = NO)
31	Incorrect	2 ms	632 KB	sum of weights should be in [50..51] but it is 73
32	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	500 KB	OK (n = 1, answer = NO)
3	Correct	2 ms	548 KB	OK (n = 1, answer = YES)
4	Correct	2 ms	548 KB	OK (n = 2, answer = YES)
5	Correct	2 ms	624 KB	OK (n = 2, answer = YES)
6	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
7	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
8	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
9	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
10	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
11	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
12	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
13	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
14	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
15	Correct	2 ms	624 KB	OK (n = 3, answer = YES)
16	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
17	Correct	2 ms	624 KB	OK (n = 3, answer = NO)
18	Correct	2 ms	624 KB	OK (n = 100, answer = NO)
19	Correct	2 ms	624 KB	OK (n = 100, answer = YES)
20	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
21	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
22	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
23	Correct	2 ms	624 KB	OK (n = 12, answer = NO)
24	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
25	Correct	2 ms	624 KB	OK (n = 12, answer = YES)
26	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
27	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
28	Correct	2 ms	632 KB	OK (n = 6, answer = YES)
29	Correct	2 ms	632 KB	OK (n = 12, answer = YES)
30	Correct	2 ms	632 KB	OK (n = 100, answer = NO)
31	Incorrect	2 ms	632 KB	sum of weights should be in [50..51] but it is 73
32	Halted	0 ms	0 KB	-

답안 #75762

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 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
0 / 10.0

Subtask #3
0 / 12.0

Subtask #4
0 / 15.0

Subtask #5
0 / 23.0

Subtask #6
0 / 31.0