oj.uz

답안 #173931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173931 2020-01-05T20:02:01 Z CaroLinda Detecting Molecules (IOI16_molecules) C++14
31 / 100
 149 ms 65540 KB 
#include "molecules.h"
#include <bits/stdc++.h>

#define debug printf
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define ll long long
#define sz size()
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define tiii tuple<int,int,int>
#define mkt make_tuple

const int MAX = 10010 ;

using namespace std ;

bool dp[MAX][MAX] ;

vector<int> find_subset(int l, int u, vector<int> w) 
{
    
	if( u >= MAX ) return vector<int>(0) ;

	int cnt = 1 ;

	dp[0][0] = true ;

	for(int i : w)
	{
		
		for(int j = u ; j >= 0 ; j-- )
		{
			dp[cnt][j] = dp[cnt-1][j] ;
			if( j + i <= u )
				dp[cnt][j+i] |= dp[cnt-1][j] ;
		}

		cnt ++ ;

	}
			
	cnt -- ;

	vector<int> res ;

	int ok = -1 ;

	lp(i,l,u+1)
		if( dp[cnt][i] ) ok = i ;

	if( ok == -1 ) return res ;

	for(int i = cnt ; i > 0 ; i-- )
		if( ok > 0 && dp[i][ok] && !dp[i-1][ok] )
		{
			res.pb(i-1) ;
			ok -= w[i-1] ;
		}

	sort(all(res));

	return res ;

}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 504 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 504 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 3 ms 888 KB OK (n = 100, answer = NO)
19 Correct 2 ms 760 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 760 KB OK (n = 100, answer = NO)
31 Correct 2 ms 756 KB OK (n = 100, answer = YES)
32 Correct 2 ms 760 KB OK (n = 100, answer = NO)
33 Correct 2 ms 888 KB OK (n = 100, answer = YES)
34 Correct 2 ms 760 KB OK (n = 100, answer = YES)
35 Correct 2 ms 888 KB OK (n = 100, answer = YES)
36 Correct 2 ms 888 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 508 KB OK (n = 27, answer = YES)
39 Correct 2 ms 760 KB OK (n = 90, answer = YES)
40 Correct 2 ms 760 KB OK (n = 100, answer = YES)
41 Correct 2 ms 760 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 888 KB OK (n = 100, answer = YES)
44 Correct 2 ms 888 KB OK (n = 100, answer = YES)
45 Correct 2 ms 892 KB OK (n = 100, answer = YES)
46 Correct 2 ms 888 KB OK (n = 100, answer = YES)
47 Correct 2 ms 760 KB OK (n = 100, answer = NO)
48 Correct 2 ms 888 KB OK (n = 100, answer = NO)
49 Correct 2 ms 760 KB OK (n = 100, answer = NO)
50 Correct 2 ms 760 KB OK (n = 100, answer = YES)
51 Correct 2 ms 888 KB OK (n = 100, answer = YES)
52 Correct 2 ms 760 KB OK (n = 100, answer = YES)
53 Correct 2 ms 760 KB OK (n = 100, answer = YES)
54 Correct 2 ms 760 KB OK (n = 100, answer = YES)

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 504 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 504 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 3 ms 888 KB OK (n = 100, answer = NO)
19 Correct 2 ms 760 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 760 KB OK (n = 100, answer = NO)
31 Correct 2 ms 756 KB OK (n = 100, answer = YES)
32 Correct 2 ms 760 KB OK (n = 100, answer = NO)
33 Correct 2 ms 888 KB OK (n = 100, answer = YES)
34 Correct 2 ms 760 KB OK (n = 100, answer = YES)
35 Correct 2 ms 888 KB OK (n = 100, answer = YES)
36 Correct 2 ms 888 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 508 KB OK (n = 27, answer = YES)
39 Correct 2 ms 760 KB OK (n = 90, answer = YES)
40 Correct 2 ms 760 KB OK (n = 100, answer = YES)
41 Correct 2 ms 760 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 888 KB OK (n = 100, answer = YES)
44 Correct 2 ms 888 KB OK (n = 100, answer = YES)
45 Correct 2 ms 892 KB OK (n = 100, answer = YES)
46 Correct 2 ms 888 KB OK (n = 100, answer = YES)
47 Correct 2 ms 760 KB OK (n = 100, answer = NO)
48 Correct 2 ms 888 KB OK (n = 100, answer = NO)
49 Correct 2 ms 760 KB OK (n = 100, answer = NO)
50 Correct 2 ms 760 KB OK (n = 100, answer = YES)
51 Correct 2 ms 888 KB OK (n = 100, answer = YES)
52 Correct 2 ms 760 KB OK (n = 100, answer = YES)
53 Correct 2 ms 760 KB OK (n = 100, answer = YES)
54 Correct 2 ms 760 KB OK (n = 100, answer = YES)
55 Runtime error 149 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 504 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 504 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 3 ms 888 KB OK (n = 100, answer = NO)
19 Correct 2 ms 760 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 760 KB OK (n = 100, answer = NO)
31 Correct 2 ms 756 KB OK (n = 100, answer = YES)
32 Correct 2 ms 760 KB OK (n = 100, answer = NO)
33 Correct 2 ms 888 KB OK (n = 100, answer = YES)
34 Correct 2 ms 760 KB OK (n = 100, answer = YES)
35 Correct 2 ms 888 KB OK (n = 100, answer = YES)
36 Correct 2 ms 888 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 508 KB OK (n = 27, answer = YES)
39 Correct 2 ms 760 KB OK (n = 90, answer = YES)
40 Correct 2 ms 760 KB OK (n = 100, answer = YES)
41 Correct 2 ms 760 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 888 KB OK (n = 100, answer = YES)
44 Correct 2 ms 888 KB OK (n = 100, answer = YES)
45 Correct 2 ms 892 KB OK (n = 100, answer = YES)
46 Correct 2 ms 888 KB OK (n = 100, answer = YES)
47 Correct 2 ms 760 KB OK (n = 100, answer = NO)
48 Correct 2 ms 888 KB OK (n = 100, answer = NO)
49 Correct 2 ms 760 KB OK (n = 100, answer = NO)
50 Correct 2 ms 760 KB OK (n = 100, answer = YES)
51 Correct 2 ms 888 KB OK (n = 100, answer = YES)
52 Correct 2 ms 760 KB OK (n = 100, answer = YES)
53 Correct 2 ms 760 KB OK (n = 100, answer = YES)
54 Correct 2 ms 760 KB OK (n = 100, answer = YES)
55 Runtime error 149 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 504 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 504 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 376 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 376 KB OK (n = 3, answer = NO)
18 Correct 3 ms 888 KB OK (n = 100, answer = NO)
19 Correct 2 ms 760 KB OK (n = 100, answer = YES)
20 Correct 2 ms 376 KB OK (n = 12, answer = YES)
21 Correct 2 ms 376 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 376 KB OK (n = 12, answer = NO)
24 Correct 2 ms 376 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 760 KB OK (n = 100, answer = NO)
31 Correct 2 ms 756 KB OK (n = 100, answer = YES)
32 Correct 2 ms 760 KB OK (n = 100, answer = NO)
33 Correct 2 ms 888 KB OK (n = 100, answer = YES)
34 Correct 2 ms 760 KB OK (n = 100, answer = YES)
35 Correct 2 ms 888 KB OK (n = 100, answer = YES)
36 Correct 2 ms 888 KB OK (n = 100, answer = YES)
37 Correct 2 ms 504 KB OK (n = 28, answer = YES)
38 Correct 2 ms 508 KB OK (n = 27, answer = YES)
39 Correct 2 ms 760 KB OK (n = 90, answer = YES)
40 Correct 2 ms 760 KB OK (n = 100, answer = YES)
41 Correct 2 ms 760 KB OK (n = 100, answer = YES)
42 Correct 2 ms 376 KB OK (n = 10, answer = YES)
43 Correct 2 ms 888 KB OK (n = 100, answer = YES)
44 Correct 2 ms 888 KB OK (n = 100, answer = YES)
45 Correct 2 ms 892 KB OK (n = 100, answer = YES)
46 Correct 2 ms 888 KB OK (n = 100, answer = YES)
47 Correct 2 ms 760 KB OK (n = 100, answer = NO)
48 Correct 2 ms 888 KB OK (n = 100, answer = NO)
49 Correct 2 ms 760 KB OK (n = 100, answer = NO)
50 Correct 2 ms 760 KB OK (n = 100, answer = YES)
51 Correct 2 ms 888 KB OK (n = 100, answer = YES)
52 Correct 2 ms 760 KB OK (n = 100, answer = YES)
53 Correct 2 ms 760 KB OK (n = 100, answer = YES)
54 Correct 2 ms 760 KB OK (n = 100, answer = YES)
55 Runtime error 149 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
56 Halted 0 ms 0 KB -