oj.uz

답안 #223737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223737 2020-04-16T09:15:58 Z bharat2002 Detecting Molecules (IOI16_molecules) C++14
69 / 100
 57 ms 5992 KB 
/*input
10 20
4
15 17 16 18
*/
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
const int N=2e5 + 100;
const int mod=1e9 + 7;
#define pii pair<int, int>
#define mp make_pair
#define f first
#define s second
int n;vector< pii > vals;
bool sf(pii a, pii b);int pref[N];
vector<int> ans;int L, U;
void check(int num)
{
	if(pref[num-1]<=U)
	{
		for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
	}
	for(int i=num;i<n;i++)
	{
		if(pref[i]-pref[i-num]>=L&&pref[i]-pref[i-num]<=U)
		{
			for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
		}
	}
}
vector<int> find_subset(int l, int u, vector<int> w)
{
	vals.clear();L=l;U=u;
	n=w.size();
	for(int i=0;i<w.size();i++)
	{
		vals.push_back(mp(w[i], i));
	}
	sort(vals.begin(), vals.end(), sf);
		pref[0]=0;;
	for(int i=0;i<vals.size();i++)
	{
		pref[i]=vals[i].f;
		if(i>0) pref[i]+=pref[i-1];
	}

	for(int i=1;i<=n;i++)
	{
		if(i==n)
		{
			if(pref[n-1]>=l&&pref[n-1]<=u)
			{
				for(int i=0;i<n;i++) ans.push_back(vals[i].s);
			}
			break;
		}

		int maxsum=pref[i-1], minsum=pref[n-1] - pref[n-i-1];
//		cout<<maxsum<<" "<<minsum<<endl;
		if(minsum>u) break;
		if(maxsum<l) continue;check(i);if(!ans.empty()) break;
	}
	return ans;
}
bool sf(pii a, pii b)
{
	return a.f>b.f;
}
/*signed main()
{
	int l, u;cin>>l>>u;
	int n;cin>>n;vector<int> vs;
	for(int i=1;i<=n;i++)
	{
		int v;cin>>v;vs.push_back(v);
	}
	find_subset(l, u, vs);
}*/

Compilation message

molecules.cpp: In function 'void check(int)':
molecules.cpp:22:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
   ^~~
molecules.cpp:22:51: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for(int i=0;i<num;i++) ans.push_back(vals[i].s);return;
                                                   ^~~~~~
molecules.cpp:28:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
    ^~~
molecules.cpp:28:57: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    for(int j=i-num+1;j<=i;j++) ans.push_back(vals[j].s);return;
                                                         ^~~~~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:36:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<w.size();i++)
              ~^~~~~~~~~
molecules.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<vals.size();i++)
              ~^~~~~~~~~~~~
molecules.cpp:62:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if(maxsum<l) continue;check(i);if(!ans.empty()) break;
   ^~
molecules.cpp:62:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   if(maxsum<l) continue;check(i);if(!ans.empty()) break;
                         ^~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 4 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 384 KB OK (n = 100, answer = YES)
32 Correct 4 ms 256 KB OK (n = 100, answer = NO)
33 Correct 5 ms 384 KB OK (n = 100, answer = YES)
34 Correct 4 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 384 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 5 ms 256 KB OK (n = 28, answer = YES)
38 Correct 4 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 256 KB OK (n = 90, answer = YES)
40 Correct 4 ms 384 KB OK (n = 100, answer = YES)
41 Correct 5 ms 384 KB OK (n = 100, answer = YES)
42 Correct 4 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 384 KB OK (n = 100, answer = YES)
45 Correct 5 ms 384 KB OK (n = 100, answer = YES)
46 Correct 4 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 384 KB OK (n = 100, answer = NO)
48 Correct 5 ms 256 KB OK (n = 100, answer = NO)
49 Correct 4 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 384 KB OK (n = 100, answer = YES)
51 Correct 4 ms 384 KB OK (n = 100, answer = YES)
52 Correct 5 ms 384 KB OK (n = 100, answer = YES)
53 Correct 4 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)
55 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
59 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
63 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 5 ms 256 KB OK (n = 865, answer = YES)
73 Correct 5 ms 384 KB OK (n = 820, answer = YES)
74 Correct 6 ms 544 KB OK (n = 7500, answer = NO)
75 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 6 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 8 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 7 ms 652 KB OK (n = 10000, answer = YES)
81 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
83 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
85 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 6 ms 640 KB OK (n = 10000, answer = YES)

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB OK (n = 1, answer = NO)
2 Correct 4 ms 256 KB OK (n = 1, answer = NO)
3 Correct 4 ms 256 KB OK (n = 1, answer = YES)
4 Correct 4 ms 256 KB OK (n = 2, answer = YES)
5 Correct 4 ms 256 KB OK (n = 2, answer = YES)
6 Correct 5 ms 384 KB OK (n = 3, answer = YES)
7 Correct 4 ms 256 KB OK (n = 3, answer = YES)
8 Correct 5 ms 256 KB OK (n = 3, answer = YES)
9 Correct 4 ms 256 KB OK (n = 3, answer = YES)
10 Correct 4 ms 256 KB OK (n = 3, answer = YES)
11 Correct 5 ms 384 KB OK (n = 3, answer = YES)
12 Correct 4 ms 256 KB OK (n = 3, answer = YES)
13 Correct 5 ms 256 KB OK (n = 3, answer = NO)
14 Correct 5 ms 256 KB OK (n = 3, answer = YES)
15 Correct 4 ms 256 KB OK (n = 3, answer = YES)
16 Correct 4 ms 256 KB OK (n = 3, answer = NO)
17 Correct 4 ms 256 KB OK (n = 3, answer = NO)
18 Correct 4 ms 256 KB OK (n = 100, answer = NO)
19 Correct 5 ms 256 KB OK (n = 100, answer = YES)
20 Correct 5 ms 256 KB OK (n = 12, answer = YES)
21 Correct 4 ms 256 KB OK (n = 12, answer = YES)
22 Correct 4 ms 384 KB OK (n = 12, answer = NO)
23 Correct 5 ms 256 KB OK (n = 12, answer = NO)
24 Correct 4 ms 256 KB OK (n = 12, answer = YES)
25 Correct 5 ms 384 KB OK (n = 12, answer = YES)
26 Correct 5 ms 384 KB OK (n = 12, answer = YES)
27 Correct 5 ms 384 KB OK (n = 12, answer = YES)
28 Correct 4 ms 256 KB OK (n = 6, answer = YES)
29 Correct 4 ms 384 KB OK (n = 12, answer = YES)
30 Correct 5 ms 256 KB OK (n = 100, answer = NO)
31 Correct 5 ms 384 KB OK (n = 100, answer = YES)
32 Correct 4 ms 256 KB OK (n = 100, answer = NO)
33 Correct 5 ms 384 KB OK (n = 100, answer = YES)
34 Correct 4 ms 384 KB OK (n = 100, answer = YES)
35 Correct 4 ms 384 KB OK (n = 100, answer = YES)
36 Correct 5 ms 256 KB OK (n = 100, answer = YES)
37 Correct 5 ms 256 KB OK (n = 28, answer = YES)
38 Correct 4 ms 256 KB OK (n = 27, answer = YES)
39 Correct 5 ms 256 KB OK (n = 90, answer = YES)
40 Correct 4 ms 384 KB OK (n = 100, answer = YES)
41 Correct 5 ms 384 KB OK (n = 100, answer = YES)
42 Correct 4 ms 256 KB OK (n = 10, answer = YES)
43 Correct 5 ms 256 KB OK (n = 100, answer = YES)
44 Correct 5 ms 384 KB OK (n = 100, answer = YES)
45 Correct 5 ms 384 KB OK (n = 100, answer = YES)
46 Correct 4 ms 256 KB OK (n = 100, answer = YES)
47 Correct 5 ms 384 KB OK (n = 100, answer = NO)
48 Correct 5 ms 256 KB OK (n = 100, answer = NO)
49 Correct 4 ms 256 KB OK (n = 100, answer = NO)
50 Correct 5 ms 384 KB OK (n = 100, answer = YES)
51 Correct 4 ms 384 KB OK (n = 100, answer = YES)
52 Correct 5 ms 384 KB OK (n = 100, answer = YES)
53 Correct 4 ms 256 KB OK (n = 100, answer = YES)
54 Correct 5 ms 256 KB OK (n = 100, answer = YES)
55 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
56 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
59 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
63 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 5 ms 256 KB OK (n = 865, answer = YES)
73 Correct 5 ms 384 KB OK (n = 820, answer = YES)
74 Correct 6 ms 544 KB OK (n = 7500, answer = NO)
75 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 6 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 8 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 7 ms 652 KB OK (n = 10000, answer = YES)
81 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
83 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
85 Correct 7 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 7 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 6 ms 640 KB OK (n = 10000, answer = YES)
94 Correct 4 ms 256 KB OK (n = 1, answer = YES)
95 Correct 4 ms 256 KB OK (n = 3, answer = YES)
96 Correct 5 ms 384 KB OK (n = 3, answer = NO)
97 Correct 4 ms 256 KB OK (n = 3, answer = YES)
98 Correct 33 ms 4588 KB OK (n = 150000, answer = NO)
99 Incorrect 57 ms 5992 KB Contestant can not find answer, jury can
100 Halted 0 ms 0 KB -