답안 #218951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
218951	2020-04-03T09:02:35 Z	yayups	Detecting Molecules (IOI16_molecules)	C++11	19 / 100	5 ms	384 KB

molecules

// created 01 FEB 2018
// updated JUNE 2018
// updated JULY 2018
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <bitset>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <list>
#include <stdexcept>

#define N 200000

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
	int n=w.size();
	vector<int> v(n);
	vector<int> result;
	v[0]=w[0];
	//cout << v[0] << endl;
	for(int i=1;i<n;i++) {
		v[i] = v[i-1]+w[i];
		//cout <<  v[i]<< endl;
	}
	
	vector<int>::iterator low,up;
	
	int a,b=0;
	int t;
	
	//it's going to be v[b]-v[a]
	for(a=-1;a<n;a++) {
		if(a==-1) {
			t=0;
		}
		else {
			t=v[a];
		}
		low=lower_bound(v.begin(),v.end(),l+t);
		up =upper_bound(v.begin(),v.end(),u+t);
		//cout << "for a = " << a << " we have low = "<<low-v.begin()<<" and up= "<<up-v.begin() << endl;
		if(low-v.begin()<=up-v.begin()) {
			b=low-v.begin();
			if(v[b]-t>=l and v[b]-t<=u) break;
			//cout  << a;
		}
	}
	//cout  << a<<endl<<b<<endl;
	result.clear();
	if(a==n) {
		return result;
	}
	
	for(int i=0;i<b-a;i++) {
		result.push_back(a+1+i);
	}
	
	//cout << a << endl;
	
	return result;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 12.0

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

답안 #218951

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