oj.uz

Submission #261620

# Submission time Handle Problem Language Result Execution time Memory
261620 2020-08-11T22:49:28 Z themax23 Detecting Molecules (IOI16_molecules) C++17
19 / 100
 64 ms 65540 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll L, R, N;
vector<int> W;

int   memo[10003][10003];
bool cache[10003][10003];
bool     P[10003][10003];

int DP(ll sum,int idx){
	if(idx > N) return 0;
	if(sum >=L && sum <= R) return sum;
	if(cache[sum][idx])
		return memo[sum][idx];
	cache[sum][idx] = true;
	
	ll ans1 = DP(sum + W[idx], idx+1);
	ll ans2 = DP(sum,idx+1);
	ll ans = 0;
	if(ans1 >= L && ans1 <= R){P[sum][idx] = true; ans = ans1;}
	else if(ans2 >= L && ans2 <= R)  {ans = ans2;}
	memo[sum][idx] = ans;
	return ans;
	
}


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	L = l, R = u, N = (int) w.size();
	W = w;
	vector<int> sub;
	ll ans = DP(0,0);
	for(int i = 0, s = 0; i < N; i++){
		if(P[s][i]) {sub.push_back(i); s += w[i];}
		//deb(P[s][i]);
	}
    return sub;

}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:35:5: warning: unused variable 'ans' [-Wunused-variable]
  ll ans = DP(0,0);
     ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 0 ms 384 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 KB OK (n = 2, answer = YES)
5 Correct 0 ms 384 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 384 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 0 ms 384 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 1664 KB OK (n = 100, answer = NO)
19 Correct 1 ms 1152 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB OK (n = 12, answer = YES)
2 Correct 1 ms 768 KB OK (n = 12, answer = YES)
3 Correct 1 ms 768 KB OK (n = 12, answer = NO)
4 Correct 1 ms 768 KB OK (n = 12, answer = NO)
5 Correct 1 ms 768 KB OK (n = 12, answer = YES)
6 Correct 1 ms 768 KB OK (n = 12, answer = YES)
7 Correct 1 ms 768 KB OK (n = 12, answer = YES)
8 Correct 1 ms 768 KB OK (n = 12, answer = YES)
9 Correct 1 ms 512 KB OK (n = 6, answer = YES)
10 Correct 1 ms 512 KB OK (n = 12, answer = YES)
11 Correct 1 ms 1152 KB OK (n = 100, answer = NO)
12 Correct 1 ms 896 KB OK (n = 100, answer = YES)
13 Correct 1 ms 1536 KB OK (n = 100, answer = NO)
14 Correct 18 ms 21120 KB OK (n = 100, answer = YES)
15 Correct 8 ms 11008 KB OK (n = 100, answer = YES)
16 Correct 14 ms 19840 KB OK (n = 100, answer = YES)
17 Correct 14 ms 19712 KB OK (n = 100, answer = YES)

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 0 ms 384 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 KB OK (n = 2, answer = YES)
5 Correct 0 ms 384 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 384 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 0 ms 384 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 1664 KB OK (n = 100, answer = NO)
19 Correct 1 ms 1152 KB OK (n = 100, answer = YES)
20 Correct 1 ms 768 KB OK (n = 12, answer = YES)
21 Correct 1 ms 768 KB OK (n = 12, answer = YES)
22 Correct 1 ms 768 KB OK (n = 12, answer = NO)
23 Correct 1 ms 768 KB OK (n = 12, answer = NO)
24 Correct 1 ms 768 KB OK (n = 12, answer = YES)
25 Correct 1 ms 768 KB OK (n = 12, answer = YES)
26 Correct 1 ms 768 KB OK (n = 12, answer = YES)
27 Correct 1 ms 768 KB OK (n = 12, answer = YES)
28 Correct 1 ms 512 KB OK (n = 6, answer = YES)
29 Correct 1 ms 512 KB OK (n = 12, answer = YES)
30 Correct 1 ms 1152 KB OK (n = 100, answer = NO)
31 Correct 1 ms 896 KB OK (n = 100, answer = YES)
32 Correct 1 ms 1536 KB OK (n = 100, answer = NO)
33 Correct 18 ms 21120 KB OK (n = 100, answer = YES)
34 Correct 8 ms 11008 KB OK (n = 100, answer = YES)
35 Correct 14 ms 19840 KB OK (n = 100, answer = YES)
36 Correct 14 ms 19712 KB OK (n = 100, answer = YES)
37 Correct 8 ms 11264 KB OK (n = 28, answer = YES)
38 Correct 8 ms 11264 KB OK (n = 27, answer = YES)
39 Runtime error 64 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 0 ms 384 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 KB OK (n = 2, answer = YES)
5 Correct 0 ms 384 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 384 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 0 ms 384 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 1664 KB OK (n = 100, answer = NO)
19 Correct 1 ms 1152 KB OK (n = 100, answer = YES)
20 Correct 1 ms 768 KB OK (n = 12, answer = YES)
21 Correct 1 ms 768 KB OK (n = 12, answer = YES)
22 Correct 1 ms 768 KB OK (n = 12, answer = NO)
23 Correct 1 ms 768 KB OK (n = 12, answer = NO)
24 Correct 1 ms 768 KB OK (n = 12, answer = YES)
25 Correct 1 ms 768 KB OK (n = 12, answer = YES)
26 Correct 1 ms 768 KB OK (n = 12, answer = YES)
27 Correct 1 ms 768 KB OK (n = 12, answer = YES)
28 Correct 1 ms 512 KB OK (n = 6, answer = YES)
29 Correct 1 ms 512 KB OK (n = 12, answer = YES)
30 Correct 1 ms 1152 KB OK (n = 100, answer = NO)
31 Correct 1 ms 896 KB OK (n = 100, answer = YES)
32 Correct 1 ms 1536 KB OK (n = 100, answer = NO)
33 Correct 18 ms 21120 KB OK (n = 100, answer = YES)
34 Correct 8 ms 11008 KB OK (n = 100, answer = YES)
35 Correct 14 ms 19840 KB OK (n = 100, answer = YES)
36 Correct 14 ms 19712 KB OK (n = 100, answer = YES)
37 Correct 8 ms 11264 KB OK (n = 28, answer = YES)
38 Correct 8 ms 11264 KB OK (n = 27, answer = YES)
39 Runtime error 64 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 0 ms 384 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 KB OK (n = 2, answer = YES)
5 Correct 0 ms 384 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 384 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 0 ms 384 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 1664 KB OK (n = 100, answer = NO)
19 Correct 1 ms 1152 KB OK (n = 100, answer = YES)
20 Correct 1 ms 768 KB OK (n = 12, answer = YES)
21 Correct 1 ms 768 KB OK (n = 12, answer = YES)
22 Correct 1 ms 768 KB OK (n = 12, answer = NO)
23 Correct 1 ms 768 KB OK (n = 12, answer = NO)
24 Correct 1 ms 768 KB OK (n = 12, answer = YES)
25 Correct 1 ms 768 KB OK (n = 12, answer = YES)
26 Correct 1 ms 768 KB OK (n = 12, answer = YES)
27 Correct 1 ms 768 KB OK (n = 12, answer = YES)
28 Correct 1 ms 512 KB OK (n = 6, answer = YES)
29 Correct 1 ms 512 KB OK (n = 12, answer = YES)
30 Correct 1 ms 1152 KB OK (n = 100, answer = NO)
31 Correct 1 ms 896 KB OK (n = 100, answer = YES)
32 Correct 1 ms 1536 KB OK (n = 100, answer = NO)
33 Correct 18 ms 21120 KB OK (n = 100, answer = YES)
34 Correct 8 ms 11008 KB OK (n = 100, answer = YES)
35 Correct 14 ms 19840 KB OK (n = 100, answer = YES)
36 Correct 14 ms 19712 KB OK (n = 100, answer = YES)
37 Correct 8 ms 11264 KB OK (n = 28, answer = YES)
38 Correct 8 ms 11264 KB OK (n = 27, answer = YES)
39 Runtime error 64 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB OK (n = 1, answer = NO)
2 Correct 0 ms 384 KB OK (n = 1, answer = NO)
3 Correct 0 ms 384 KB OK (n = 1, answer = YES)
4 Correct 0 ms 384 KB OK (n = 2, answer = YES)
5 Correct 0 ms 384 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 384 KB OK (n = 3, answer = YES)
9 Correct 1 ms 384 KB OK (n = 3, answer = YES)
10 Correct 1 ms 384 KB OK (n = 3, answer = YES)
11 Correct 0 ms 384 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 384 KB OK (n = 3, answer = NO)
14 Correct 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 384 KB OK (n = 3, answer = YES)
16 Correct 0 ms 384 KB OK (n = 3, answer = NO)
17 Correct 1 ms 384 KB OK (n = 3, answer = NO)
18 Correct 1 ms 1664 KB OK (n = 100, answer = NO)
19 Correct 1 ms 1152 KB OK (n = 100, answer = YES)
20 Correct 1 ms 768 KB OK (n = 12, answer = YES)
21 Correct 1 ms 768 KB OK (n = 12, answer = YES)
22 Correct 1 ms 768 KB OK (n = 12, answer = NO)
23 Correct 1 ms 768 KB OK (n = 12, answer = NO)
24 Correct 1 ms 768 KB OK (n = 12, answer = YES)
25 Correct 1 ms 768 KB OK (n = 12, answer = YES)
26 Correct 1 ms 768 KB OK (n = 12, answer = YES)
27 Correct 1 ms 768 KB OK (n = 12, answer = YES)
28 Correct 1 ms 512 KB OK (n = 6, answer = YES)
29 Correct 1 ms 512 KB OK (n = 12, answer = YES)
30 Correct 1 ms 1152 KB OK (n = 100, answer = NO)
31 Correct 1 ms 896 KB OK (n = 100, answer = YES)
32 Correct 1 ms 1536 KB OK (n = 100, answer = NO)
33 Correct 18 ms 21120 KB OK (n = 100, answer = YES)
34 Correct 8 ms 11008 KB OK (n = 100, answer = YES)
35 Correct 14 ms 19840 KB OK (n = 100, answer = YES)
36 Correct 14 ms 19712 KB OK (n = 100, answer = YES)
37 Correct 8 ms 11264 KB OK (n = 28, answer = YES)
38 Correct 8 ms 11264 KB OK (n = 27, answer = YES)
39 Runtime error 64 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -