oj.uz

답안 #117112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117112 2019-06-14T21:25:37 Z Lawliet Detecting Molecules (IOI16_molecules) C++17
46 / 100
 111 ms 768 KB 
#include <bits/stdc++.h>
#include "molecules.h"

#define MAX 10010

using namespace std;

int N, L, U;

int indAnt[MAX];
int valueAnt[MAX];

bool dp[MAX];

vector<int> ans;

void add(int w, int i)
{
	for(int g = U ; g >= w ; g--)
	{
		if(dp[g - w] && !dp[g])
		{
			dp[g] = true;

			indAnt[g] = i;
			valueAnt[g] = w;
		}
	}
}

std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
	L = l; U = u;

	N = w.size();

	//for(int g = 0 ; g < N ; g++)
		//printf("%d\n",w[g]);

	ans.clear();
	memset(dp , false , sizeof(dp));
	memset(indAnt , -1 , sizeof(indAnt));
	memset(valueAnt , -1 , sizeof(valueAnt));

	dp[0] = true;

	for(int g = 0 ; g < N ; g++)
		add( w[g] , g );

	int can = -1;

	//for(int g = 1 ; g <= U ; g++)
		//printf("-> %d %d\n",g,dp[g]);

	for(int g = L ; g <= U ; g++)
		if(dp[g]) can = g;

	//printf("can = %d\n",can);

	if(can == -1) return ans;

	while( indAnt[can] != -1 )
	{
		ans.push_back( indAnt[can] );

		can -= valueAnt[can];
	}

	//printf("-> %d\n",ans.size());

	return ans;
}

/*int main()
{
	scanf("%d %d %d",&N,&L,&U);

	vector<int> W(N);

	for(int g = 0 ; g < N ; g++)
		scanf("%d",&W[g]);

	printf("%d\n",find_subset(L , U , W).size());
}*/

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 2 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 356 KB OK (n = 3, answer = YES)
15 Correct 2 ms 384 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 2 ms 384 KB OK (n = 100, answer = YES)
20 Correct 3 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 3 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 3 ms 384 KB OK (n = 100, answer = YES)
36 Correct 2 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 512 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 2 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 2 ms 384 KB OK (n = 100, answer = YES)
46 Correct 3 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 111 ms 556 KB OK (n = 10000, answer = YES)
56 Correct 105 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 94 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 74 ms 612 KB OK (n = 10000, answer = YES)
59 Correct 90 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 34 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 35 ms 608 KB OK (n = 10000, answer = NO)
62 Correct 87 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 98 ms 604 KB OK (n = 10000, answer = YES)
65 Correct 98 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 88 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 14 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 12 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 76 ms 548 KB OK (n = 10000, answer = YES)
72 Correct 9 ms 512 KB OK (n = 865, answer = YES)
73 Correct 8 ms 384 KB OK (n = 820, answer = YES)

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 2 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 356 KB OK (n = 3, answer = YES)
15 Correct 2 ms 384 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 2 ms 384 KB OK (n = 100, answer = YES)
20 Correct 3 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 3 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 3 ms 384 KB OK (n = 100, answer = YES)
36 Correct 2 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 512 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 2 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 2 ms 384 KB OK (n = 100, answer = YES)
46 Correct 3 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 111 ms 556 KB OK (n = 10000, answer = YES)
56 Correct 105 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 94 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 74 ms 612 KB OK (n = 10000, answer = YES)
59 Correct 90 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 34 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 35 ms 608 KB OK (n = 10000, answer = NO)
62 Correct 87 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 98 ms 604 KB OK (n = 10000, answer = YES)
65 Correct 98 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 88 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 14 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 12 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 76 ms 548 KB OK (n = 10000, answer = YES)
72 Correct 9 ms 512 KB OK (n = 865, answer = YES)
73 Correct 8 ms 384 KB OK (n = 820, answer = YES)
74 Runtime error 3 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
75 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB OK (n = 1, answer = NO)
2 Correct 2 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 2 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 356 KB OK (n = 3, answer = YES)
15 Correct 2 ms 384 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 2 ms 384 KB OK (n = 100, answer = YES)
20 Correct 3 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 3 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 3 ms 384 KB OK (n = 100, answer = YES)
36 Correct 2 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 512 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 2 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 2 ms 384 KB OK (n = 100, answer = YES)
46 Correct 3 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 111 ms 556 KB OK (n = 10000, answer = YES)
56 Correct 105 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 94 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 74 ms 612 KB OK (n = 10000, answer = YES)
59 Correct 90 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 34 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 35 ms 608 KB OK (n = 10000, answer = NO)
62 Correct 87 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 98 ms 604 KB OK (n = 10000, answer = YES)
65 Correct 98 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 88 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 14 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 12 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 78 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 76 ms 548 KB OK (n = 10000, answer = YES)
72 Correct 9 ms 512 KB OK (n = 865, answer = YES)
73 Correct 8 ms 384 KB OK (n = 820, answer = YES)
74 Runtime error 3 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
75 Halted 0 ms 0 KB -