oj.uz

답안 #491973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491973 2021-12-05T09:15:36 Z MassimilianoF Detecting Molecules (IOI16_molecules) C++14
46 / 100
 110 ms 1028 KB 
#include "molecules.h"
#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

struct molecola {
		long long pos;
		long long weight;
	};

bool operator<(const molecola & lhs, const molecola & rhs) {
		return lhs.weight<rhs.weight;
	}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int i, j, k, n, S=0;
	vector<int> t;
	n=w.size();
	
	vector<molecola> V;
	for (i=0; i<n; i++) {
		V.push_back({i, w[i]});
		S+=w[i];
	}
	if (S<l) {
		cerr << "SCENARIO 1" << endl;
		return t;
	}
	sort(V.begin(), V.end());
	
	for (i=0; i<n; i++) {
		cerr << "V[" << i << "] = {" << V[i].pos << ", " << V[i].weight << "}"<< endl;
	}
	
	i=0; S=0;
	while (S<l) {
		S+=V[i].weight;
		i++;
	}
	if (S<=u) {
		for (j=0; j<i; j++) {
			t.push_back(V[j].pos);
		}
		cerr << "SCENARIO 2" << endl;
		return t;
	}
	
	j=0;
	i--;
	S-=V[i].weight;
	
	while (j+i<=n && S<l) {
		S-=V[j].weight;
		S+=V[j+i].weight;
		j++;
	}
	if (j+i>n) {
		cerr << "SCENARIO 3" << endl;
		return t;	
	}
	
	for (k=j; k<j+i; k++) {
		t.push_back(V[k].pos);
	}
	
	cerr << "SCENARIO 4" << endl;
	
    return t;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 2 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 332 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 2 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 2 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 2 ms 204 KB OK (n = 100, answer = NO)
49 Correct 2 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 2 ms 204 KB OK (n = 100, answer = YES)
55 Correct 93 ms 828 KB OK (n = 10000, answer = YES)
56 Correct 110 ms 840 KB OK (n = 10000, answer = YES)
57 Correct 90 ms 772 KB OK (n = 10000, answer = YES)
58 Correct 95 ms 1028 KB OK (n = 10000, answer = YES)
59 Correct 95 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 93 ms 860 KB OK (n = 10000, answer = YES)
61 Correct 91 ms 864 KB OK (n = 10000, answer = NO)
62 Correct 93 ms 872 KB OK (n = 10000, answer = YES)
63 Correct 109 ms 852 KB OK (n = 10000, answer = NO)
64 Correct 99 ms 832 KB OK (n = 10000, answer = YES)
65 Correct 96 ms 828 KB OK (n = 10000, answer = YES)
66 Correct 92 ms 788 KB OK (n = 10000, answer = YES)
67 Correct 93 ms 832 KB OK (n = 10000, answer = YES)
68 Correct 93 ms 760 KB OK (n = 10000, answer = YES)
69 Correct 94 ms 856 KB OK (n = 10000, answer = YES)
70 Correct 90 ms 832 KB OK (n = 10000, answer = YES)
71 Correct 93 ms 812 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 356 KB OK (n = 865, answer = YES)
73 Correct 8 ms 340 KB OK (n = 820, answer = YES)

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 2 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 332 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 2 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 2 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 2 ms 204 KB OK (n = 100, answer = NO)
49 Correct 2 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 2 ms 204 KB OK (n = 100, answer = YES)
55 Correct 93 ms 828 KB OK (n = 10000, answer = YES)
56 Correct 110 ms 840 KB OK (n = 10000, answer = YES)
57 Correct 90 ms 772 KB OK (n = 10000, answer = YES)
58 Correct 95 ms 1028 KB OK (n = 10000, answer = YES)
59 Correct 95 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 93 ms 860 KB OK (n = 10000, answer = YES)
61 Correct 91 ms 864 KB OK (n = 10000, answer = NO)
62 Correct 93 ms 872 KB OK (n = 10000, answer = YES)
63 Correct 109 ms 852 KB OK (n = 10000, answer = NO)
64 Correct 99 ms 832 KB OK (n = 10000, answer = YES)
65 Correct 96 ms 828 KB OK (n = 10000, answer = YES)
66 Correct 92 ms 788 KB OK (n = 10000, answer = YES)
67 Correct 93 ms 832 KB OK (n = 10000, answer = YES)
68 Correct 93 ms 760 KB OK (n = 10000, answer = YES)
69 Correct 94 ms 856 KB OK (n = 10000, answer = YES)
70 Correct 90 ms 832 KB OK (n = 10000, answer = YES)
71 Correct 93 ms 812 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 356 KB OK (n = 865, answer = YES)
73 Correct 8 ms 340 KB OK (n = 820, answer = YES)
74 Correct 1 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 101 ms 828 KB OK (n = 10000, answer = YES)
80 Correct 92 ms 868 KB OK (n = 10000, answer = YES)
81 Correct 92 ms 840 KB OK (n = 10000, answer = YES)
82 Incorrect 2 ms 716 KB Contestant can not find answer, jury can
83 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 2 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 332 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 0 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 2 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 292 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 2 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 2 ms 204 KB OK (n = 100, answer = NO)
49 Correct 2 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 2 ms 204 KB OK (n = 100, answer = YES)
55 Correct 93 ms 828 KB OK (n = 10000, answer = YES)
56 Correct 110 ms 840 KB OK (n = 10000, answer = YES)
57 Correct 90 ms 772 KB OK (n = 10000, answer = YES)
58 Correct 95 ms 1028 KB OK (n = 10000, answer = YES)
59 Correct 95 ms 764 KB OK (n = 10000, answer = YES)
60 Correct 93 ms 860 KB OK (n = 10000, answer = YES)
61 Correct 91 ms 864 KB OK (n = 10000, answer = NO)
62 Correct 93 ms 872 KB OK (n = 10000, answer = YES)
63 Correct 109 ms 852 KB OK (n = 10000, answer = NO)
64 Correct 99 ms 832 KB OK (n = 10000, answer = YES)
65 Correct 96 ms 828 KB OK (n = 10000, answer = YES)
66 Correct 92 ms 788 KB OK (n = 10000, answer = YES)
67 Correct 93 ms 832 KB OK (n = 10000, answer = YES)
68 Correct 93 ms 760 KB OK (n = 10000, answer = YES)
69 Correct 94 ms 856 KB OK (n = 10000, answer = YES)
70 Correct 90 ms 832 KB OK (n = 10000, answer = YES)
71 Correct 93 ms 812 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 356 KB OK (n = 865, answer = YES)
73 Correct 8 ms 340 KB OK (n = 820, answer = YES)
74 Correct 1 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 101 ms 828 KB OK (n = 10000, answer = YES)
80 Correct 92 ms 868 KB OK (n = 10000, answer = YES)
81 Correct 92 ms 840 KB OK (n = 10000, answer = YES)
82 Incorrect 2 ms 716 KB Contestant can not find answer, jury can
83 Halted 0 ms 0 KB -