Submission #88254

# Submission time Handle Problem Language Result Execution time Memory
88254 2018-12-04T22:03:03 Z amiratou Detecting Molecules (IOI16_molecules) C++14
0 / 100
1000 ms 592 KB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> vec,ans;
bool used[200005];
//unordered_map<long long,bool> mymap;
int n,L,R;
bool solve(long long sum,int idx){
	if(sum>R)
		return 0;
	if(sum>=L&&sum<=R){
		for (int i = 0; i < n; ++i)
		{
			if(used[i])
				ans.push_back(i);
		}
		return 1;
	}
	//if(mymap.find(sum)!=mymap.end())
	//	return 0;
	for (int i = idx+1; i < n; ++i)
	{
		used[i]=1;
		if(solve(sum+vec[i],i))return 1;
		//mymap[sum]=1;
		used[i]=0;
	}
	return 0;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	n=w.size();
	L=l;R=u;
	vec=w;
	if(!solve(0,-1))
		return vector<int>(0);
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Correct 2 ms 508 KB OK (n = 1, answer = YES)
4 Correct 2 ms 508 KB OK (n = 2, answer = YES)
5 Correct 2 ms 508 KB OK (n = 2, answer = YES)
6 Correct 2 ms 508 KB OK (n = 3, answer = YES)
7 Correct 2 ms 508 KB OK (n = 3, answer = YES)
8 Correct 2 ms 532 KB OK (n = 3, answer = YES)
9 Correct 2 ms 532 KB OK (n = 3, answer = YES)
10 Correct 2 ms 592 KB OK (n = 3, answer = YES)
11 Correct 2 ms 592 KB OK (n = 3, answer = YES)
12 Correct 2 ms 592 KB OK (n = 3, answer = YES)
13 Correct 2 ms 592 KB OK (n = 3, answer = NO)
14 Correct 2 ms 592 KB OK (n = 3, answer = YES)
15 Correct 2 ms 592 KB OK (n = 3, answer = YES)
16 Correct 2 ms 592 KB OK (n = 3, answer = NO)
17 Correct 2 ms 592 KB OK (n = 3, answer = NO)
18 Execution timed out 1088 ms 592 KB Time limit exceeded
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB OK (n = 12, answer = YES)
2 Correct 2 ms 592 KB OK (n = 12, answer = YES)
3 Correct 2 ms 592 KB OK (n = 12, answer = NO)
4 Correct 2 ms 592 KB OK (n = 12, answer = NO)
5 Correct 2 ms 592 KB OK (n = 12, answer = YES)
6 Correct 2 ms 592 KB OK (n = 12, answer = YES)
7 Correct 2 ms 592 KB OK (n = 12, answer = YES)
8 Correct 2 ms 592 KB OK (n = 12, answer = YES)
9 Correct 2 ms 592 KB OK (n = 6, answer = YES)
10 Correct 2 ms 592 KB OK (n = 12, answer = YES)
11 Execution timed out 1074 ms 592 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Correct 2 ms 508 KB OK (n = 1, answer = YES)
4 Correct 2 ms 508 KB OK (n = 2, answer = YES)
5 Correct 2 ms 508 KB OK (n = 2, answer = YES)
6 Correct 2 ms 508 KB OK (n = 3, answer = YES)
7 Correct 2 ms 508 KB OK (n = 3, answer = YES)
8 Correct 2 ms 532 KB OK (n = 3, answer = YES)
9 Correct 2 ms 532 KB OK (n = 3, answer = YES)
10 Correct 2 ms 592 KB OK (n = 3, answer = YES)
11 Correct 2 ms 592 KB OK (n = 3, answer = YES)
12 Correct 2 ms 592 KB OK (n = 3, answer = YES)
13 Correct 2 ms 592 KB OK (n = 3, answer = NO)
14 Correct 2 ms 592 KB OK (n = 3, answer = YES)
15 Correct 2 ms 592 KB OK (n = 3, answer = YES)
16 Correct 2 ms 592 KB OK (n = 3, answer = NO)
17 Correct 2 ms 592 KB OK (n = 3, answer = NO)
18 Execution timed out 1088 ms 592 KB Time limit exceeded
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Correct 2 ms 508 KB OK (n = 1, answer = YES)
4 Correct 2 ms 508 KB OK (n = 2, answer = YES)
5 Correct 2 ms 508 KB OK (n = 2, answer = YES)
6 Correct 2 ms 508 KB OK (n = 3, answer = YES)
7 Correct 2 ms 508 KB OK (n = 3, answer = YES)
8 Correct 2 ms 532 KB OK (n = 3, answer = YES)
9 Correct 2 ms 532 KB OK (n = 3, answer = YES)
10 Correct 2 ms 592 KB OK (n = 3, answer = YES)
11 Correct 2 ms 592 KB OK (n = 3, answer = YES)
12 Correct 2 ms 592 KB OK (n = 3, answer = YES)
13 Correct 2 ms 592 KB OK (n = 3, answer = NO)
14 Correct 2 ms 592 KB OK (n = 3, answer = YES)
15 Correct 2 ms 592 KB OK (n = 3, answer = YES)
16 Correct 2 ms 592 KB OK (n = 3, answer = NO)
17 Correct 2 ms 592 KB OK (n = 3, answer = NO)
18 Execution timed out 1088 ms 592 KB Time limit exceeded
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Correct 2 ms 508 KB OK (n = 1, answer = YES)
4 Correct 2 ms 508 KB OK (n = 2, answer = YES)
5 Correct 2 ms 508 KB OK (n = 2, answer = YES)
6 Correct 2 ms 508 KB OK (n = 3, answer = YES)
7 Correct 2 ms 508 KB OK (n = 3, answer = YES)
8 Correct 2 ms 532 KB OK (n = 3, answer = YES)
9 Correct 2 ms 532 KB OK (n = 3, answer = YES)
10 Correct 2 ms 592 KB OK (n = 3, answer = YES)
11 Correct 2 ms 592 KB OK (n = 3, answer = YES)
12 Correct 2 ms 592 KB OK (n = 3, answer = YES)
13 Correct 2 ms 592 KB OK (n = 3, answer = NO)
14 Correct 2 ms 592 KB OK (n = 3, answer = YES)
15 Correct 2 ms 592 KB OK (n = 3, answer = YES)
16 Correct 2 ms 592 KB OK (n = 3, answer = NO)
17 Correct 2 ms 592 KB OK (n = 3, answer = NO)
18 Execution timed out 1088 ms 592 KB Time limit exceeded
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 508 KB OK (n = 1, answer = NO)
3 Correct 2 ms 508 KB OK (n = 1, answer = YES)
4 Correct 2 ms 508 KB OK (n = 2, answer = YES)
5 Correct 2 ms 508 KB OK (n = 2, answer = YES)
6 Correct 2 ms 508 KB OK (n = 3, answer = YES)
7 Correct 2 ms 508 KB OK (n = 3, answer = YES)
8 Correct 2 ms 532 KB OK (n = 3, answer = YES)
9 Correct 2 ms 532 KB OK (n = 3, answer = YES)
10 Correct 2 ms 592 KB OK (n = 3, answer = YES)
11 Correct 2 ms 592 KB OK (n = 3, answer = YES)
12 Correct 2 ms 592 KB OK (n = 3, answer = YES)
13 Correct 2 ms 592 KB OK (n = 3, answer = NO)
14 Correct 2 ms 592 KB OK (n = 3, answer = YES)
15 Correct 2 ms 592 KB OK (n = 3, answer = YES)
16 Correct 2 ms 592 KB OK (n = 3, answer = NO)
17 Correct 2 ms 592 KB OK (n = 3, answer = NO)
18 Execution timed out 1088 ms 592 KB Time limit exceeded
19 Halted 0 ms 0 KB -