oj.uz

답안 #114596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114596 2019-06-02T03:07:47 Z davitmarg Detecting Molecules (IOI16_molecules) C++17
46 / 100
 78 ms 896 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <ctype.h>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin (),v.end()
using namespace std;

int l, r;
int n;
vector<pair<int,int>> a;
vector<int> ans;
int dp[10004],st,p[10004];

int Main()
{
	sort(all(a));
	n = a.size();
	for (int i = 1; i <= r; i++)
	{
		dp[i] = -mod;
		p[i] = -1;
	}
	p[0] = -1;
	for (int i = 0; i < a.size(); i++)
		for (int j = min(r,a[i].first*(i+1)); j >= a[i].first; j--)
			if (dp[j - a[i].first] + 1 > dp[j])
			{
				dp[j] = dp[j - a[i].first] + 1;
				p[j] = i;
			}

	for (int i = l; i <= r; i++)
		if (dp[i] >= dp[st])
			st = i;
	while (p[st] != -1)
	{
		ans.PB(a[p[st]].second);
		st -= a[p[st]].first;
	}
	sort(all(ans));
	return 0;
}

vector<int> find_subset(int L, int R, vector<int> w)
{
	l = L;
	r = R;
	while (!w.empty())
	{
		a.PB(MP(w.back(), w.size() - 1));
		w.pop_back();
	}
	Main();
	return ans;
}

#ifdef death

int main()
{
	int L, R,N;
	vector<int> W;
	cin >> N >> L >> R;
	for (int i = 0; i < N; i++)
	{
		W.PB(0);
		cin >> W.back();
	}
	W=find_subset(L, R, W);
	cout << W.size() << endl;
	reverse(all(W));
	while (!W.empty())
	{
		cout << W.back() << " ";
		W.pop_back();
	}
	cout << endl;
	return 0;
}

#endif 


/*



*/

Compilation message

molecules.cpp: In function 'int Main()':
molecules.cpp:42:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.size(); i++)
                  ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 256 KB OK (n = 12, answer = NO)
5 Correct 2 ms 256 KB OK (n = 12, answer = YES)
6 Correct 2 ms 256 KB OK (n = 12, answer = YES)
7 Correct 2 ms 256 KB OK (n = 12, answer = YES)
8 Correct 2 ms 304 KB OK (n = 12, answer = YES)
9 Correct 2 ms 256 KB OK (n = 6, answer = YES)
10 Correct 2 ms 256 KB OK (n = 12, answer = YES)
11 Correct 3 ms 256 KB OK (n = 100, answer = NO)
12 Correct 2 ms 256 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 2 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 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 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 256 KB OK (n = 100, answer = YES)
20 Correct 2 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 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 256 KB OK (n = 12, answer = YES)
26 Correct 2 ms 256 KB OK (n = 12, answer = YES)
27 Correct 2 ms 304 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 3 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 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 2 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 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 256 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 2 ms 256 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 2 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 1 ms 256 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 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 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 256 KB OK (n = 100, answer = YES)
20 Correct 2 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 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 256 KB OK (n = 12, answer = YES)
26 Correct 2 ms 256 KB OK (n = 12, answer = YES)
27 Correct 2 ms 304 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 3 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 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 2 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 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 256 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 2 ms 256 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 2 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 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 73 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 76 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 72 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 69 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 77 ms 760 KB OK (n = 10000, answer = YES)
60 Correct 33 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 33 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 59 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 76 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 78 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 71 ms 808 KB OK (n = 10000, answer = YES)
67 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 612 KB OK (n = 10000, answer = YES)
69 Correct 53 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 54 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 54 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 384 KB OK (n = 865, answer = YES)
73 Correct 7 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 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 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 256 KB OK (n = 100, answer = YES)
20 Correct 2 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 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 256 KB OK (n = 12, answer = YES)
26 Correct 2 ms 256 KB OK (n = 12, answer = YES)
27 Correct 2 ms 304 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 3 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 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 2 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 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 256 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 2 ms 256 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 2 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 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 73 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 76 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 72 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 69 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 77 ms 760 KB OK (n = 10000, answer = YES)
60 Correct 33 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 33 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 59 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 76 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 78 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 71 ms 808 KB OK (n = 10000, answer = YES)
67 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 612 KB OK (n = 10000, answer = YES)
69 Correct 53 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 54 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 54 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 384 KB OK (n = 865, answer = YES)
73 Correct 7 ms 384 KB OK (n = 820, answer = YES)
74 Runtime error 4 ms 896 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 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 256 KB OK (n = 1, answer = YES)
4 Correct 2 ms 256 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 256 KB OK (n = 3, answer = YES)
7 Correct 2 ms 256 KB OK (n = 3, answer = YES)
8 Correct 2 ms 256 KB OK (n = 3, answer = YES)
9 Correct 2 ms 256 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 256 KB OK (n = 3, answer = YES)
12 Correct 2 ms 256 KB OK (n = 3, answer = YES)
13 Correct 2 ms 256 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 256 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 256 KB OK (n = 100, answer = YES)
20 Correct 2 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 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 256 KB OK (n = 12, answer = YES)
26 Correct 2 ms 256 KB OK (n = 12, answer = YES)
27 Correct 2 ms 304 KB OK (n = 12, answer = YES)
28 Correct 2 ms 256 KB OK (n = 6, answer = YES)
29 Correct 2 ms 256 KB OK (n = 12, answer = YES)
30 Correct 3 ms 256 KB OK (n = 100, answer = NO)
31 Correct 2 ms 256 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 2 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 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 256 KB OK (n = 100, answer = YES)
41 Correct 2 ms 256 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 2 ms 256 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 2 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 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 73 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 76 ms 888 KB OK (n = 10000, answer = YES)
57 Correct 72 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 69 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 77 ms 760 KB OK (n = 10000, answer = YES)
60 Correct 33 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 33 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 59 ms 888 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 76 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 78 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 71 ms 808 KB OK (n = 10000, answer = YES)
67 Correct 8 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 8 ms 612 KB OK (n = 10000, answer = YES)
69 Correct 53 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 54 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 54 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 8 ms 384 KB OK (n = 865, answer = YES)
73 Correct 7 ms 384 KB OK (n = 820, answer = YES)
74 Runtime error 4 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
75 Halted 0 ms 0 KB -