답안 #199267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199267	2020-01-30T20:18:09 Z	monus1042	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	6 ms	380 KB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<int> ans;
	int ss=w.size();
	
	int same=w[0], cnt1=0, cnt2=0, secel;
	unordered_set<int> posfir, possec;
	bool oksame=true;
	for (int i=1; i<ss; i++){
		if (w[i]!=same) {oksame=false; cnt2++; secel=w[i]; possec.insert(i);}
		else {cnt1++; posfir.insert(i);}
	}
	if (!oksame){
		if (secel>=l and secel<=u) ans.push_back(*possec.begin());
		else if (same>=l and same<=u) ans.push_back(*posfir.begin());
		else{
			bool done=false;
			for (int i=1; i<=cnt1; i++){
				for (int j=1; j<=cnt2; j++){
					if (secel*j + same*i>=l and secel*j + same*i<=u){
						auto fi=posfir.begin(), se=possec.begin();
						for (int k=0; k<i; k++, fi++) ans.push_back(*fi);
						for (int k=0; k<j; k++, se++) ans.push_back(*se);
						done=true;
						break;
					}
				}
				if (done) break;
			}
		}
	}else{
		for (int i=1; i<=ss; i++){
			if (same*i>=l and same*i<=u){
				for (int j=0; j<i; j++) ans.push_back(j);
				break;
			}
		}
	}
    return ans;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
2	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
3	Correct	5 ms	376 KB	OK (n = 12, answer = NO)
4	Correct	5 ms	256 KB	OK (n = 12, answer = NO)
5	Incorrect	5 ms	376 KB	Contestant can not find answer, jury can
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	5 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	5 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	5 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	5 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	380 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	6 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	5 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	256 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	376 KB	Contestant can not find answer, jury can
25	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	5 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	5 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	5 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	5 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	380 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	6 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	5 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	256 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	376 KB	Contestant can not find answer, jury can
25	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	5 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	5 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	5 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	5 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	380 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	6 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	5 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	256 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	376 KB	Contestant can not find answer, jury can
25	Halted	0 ms	0 KB	-

Subtask #6

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	248 KB	OK (n = 1, answer = NO)
2	Correct	5 ms	376 KB	OK (n = 1, answer = NO)
3	Correct	5 ms	376 KB	OK (n = 1, answer = YES)
4	Correct	5 ms	376 KB	OK (n = 2, answer = YES)
5	Correct	5 ms	256 KB	OK (n = 2, answer = YES)
6	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
7	Correct	5 ms	380 KB	OK (n = 3, answer = YES)
8	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
9	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
10	Correct	6 ms	256 KB	OK (n = 3, answer = YES)
11	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
12	Correct	5 ms	376 KB	OK (n = 3, answer = YES)
13	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
14	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
15	Correct	5 ms	256 KB	OK (n = 3, answer = YES)
16	Correct	5 ms	256 KB	OK (n = 3, answer = NO)
17	Correct	5 ms	376 KB	OK (n = 3, answer = NO)
18	Correct	5 ms	256 KB	OK (n = 100, answer = NO)
19	Correct	5 ms	256 KB	OK (n = 100, answer = YES)
20	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
21	Correct	5 ms	256 KB	OK (n = 12, answer = YES)
22	Correct	5 ms	376 KB	OK (n = 12, answer = NO)
23	Correct	5 ms	256 KB	OK (n = 12, answer = NO)
24	Incorrect	5 ms	376 KB	Contestant can not find answer, jury can
25	Halted	0 ms	0 KB	-