답안 #73136 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73136	2018-08-28T00:23:36 Z	Kmcode	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	3 ms	644 KB

molecules

#include<bits/stdc++.h>
using namespace std;

//#include "molecules.h"

vector<pair<long long int,int> > im;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	sort(w.begin(),w.end());
	im.push_back(make_pair(0,-1));
	for(int i=0;i<w.size();i++){
		im.push_back(make_pair(im.back().first+w[i],i) );
		/*if(l<=im.back()&&im.back()<=u){
			vector<int> ans;
			for(int j=1;j<im.size();j++){
				ans.push_back(im[j].second);
			}
			return ans;
		}*/
		long long int id=lower_bound(im.begin(),im.end(),make_pair(im.back().first-u,-1))-im.begin();
		if(l<=im.back().first-im[id].first&&im.back().first-im[id].first<=u){
			vector<int> ans;
			for(int j=id+1;j<im.size();j++){
				ans.push_back(im[j].second);
			}
			return ans;
		}
	}
    return std::vector<int>(0);
}

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 10.0

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

답안 #73136

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