Submission #328238

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
328238	2020-11-16T00:04:46 Z	arwaeystoamneg	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	56 ms	5740 KB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
// warning: ld is rougly 2x slower than double. Proof: ld: https://oj.uz/submission/319677 double: https://oj.uz/submission/319678
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define endl '\n'
#define test int testc;cin>>testc;while(testc--)
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }


vi find_subset(int l, int r, vi w)
{
	int n = w.size();
	vpi a(n);
	F0R(i, n)a[i] = { w[i],i };
	sort(all(a));
	ll prefix = 0, suffix = 0;
	F0R(i, n)
	{
		prefix += a[i].f;
		suffix += a[n - i - 1].f;
		if (prefix >= l && prefix <= r)
		{
			vi ans;
			F0R(j, i + 1)
			{
				ans.pb(a[j].s);
			}
			return ans;
		}
		else if (suffix >= l && suffix <= r)
		{
			vi ans;
			F0R(j, i + 1)
			{
				ans.pb(a[n - j - 1].s);
			}
			return ans;
		}
		else
		{
			if (prefix > r && suffix > r)
			{
				vi ans(0);
				return ans;
			}
			if (prefix < l && suffix > r)
			{
				ll sum = 0;
				F0R(j, i + 1)sum += a[j].f;
				int left = 0, right = i;
				while (right < n - 1)
				{
					sum -= a[left++].f;
					sum += a[++right].f;
					if (sum >= l && sum <= r)
					{
						vi ans;
						FOR(j, left, right + 1)ans.pb(a[j].s);
						return ans;
					}
				}
				assert(0);
			}
		}
	}
	vi ans(0);
	return ans;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
2	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
3	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
4	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
5	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
11	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
12	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
13	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
15	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
16	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
17	Correct	1 ms	364 KB	OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	0 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	0 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
42	Correct	0 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
44	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	384 KB	OK (n = 100, answer = YES)
46	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
48	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
49	Correct	0 ms	364 KB	OK (n = 100, answer = NO)
50	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
51	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
52	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
55	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
56	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
57	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
58	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
59	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
60	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
61	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
62	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
63	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
64	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
65	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
66	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
67	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
68	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
69	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
70	Correct	2 ms	512 KB	OK (n = 10000, answer = YES)
71	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
72	Correct	1 ms	364 KB	OK (n = 865, answer = YES)
73	Correct	1 ms	364 KB	OK (n = 820, answer = YES)
74	Correct	2 ms	492 KB	OK (n = 7500, answer = NO)
75	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
76	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
77	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
78	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
79	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
80	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
81	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
82	Correct	3 ms	512 KB	OK (n = 10000, answer = YES)
83	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
84	Correct	4 ms	492 KB	OK (n = 10000, answer = YES)
85	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
86	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
87	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
88	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
89	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
90	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
91	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
92	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
93	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
94	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
95	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
96	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
97	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
98	Correct	35 ms	3436 KB	OK (n = 150000, answer = NO)
99	Correct	53 ms	5100 KB	OK (n = 200000, answer = YES)
100	Correct	56 ms	5740 KB	OK (n = 200000, answer = NO)
101	Correct	54 ms	4972 KB	OK (n = 200000, answer = YES)
102	Correct	53 ms	5504 KB	OK (n = 200000, answer = YES)
103	Correct	52 ms	4972 KB	OK (n = 200000, answer = YES)
104	Correct	50 ms	4844 KB	OK (n = 200000, answer = YES)
105	Correct	47 ms	4204 KB	OK (n = 200000, answer = NO)
106	Correct	54 ms	4972 KB	OK (n = 200000, answer = YES)
107	Correct	53 ms	5612 KB	OK (n = 200000, answer = NO)
108	Correct	47 ms	4332 KB	OK (n = 200000, answer = NO)
109	Correct	46 ms	4204 KB	OK (n = 200000, answer = NO)
110	Correct	41 ms	4460 KB	OK (n = 200000, answer = YES)
111	Correct	39 ms	4588 KB	OK (n = 200000, answer = YES)
112	Correct	34 ms	4588 KB	OK (n = 200000, answer = YES)
113	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
114	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
115	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
116	Correct	43 ms	4460 KB	OK (n = 200000, answer = YES)
117	Correct	44 ms	4460 KB	OK (n = 200000, answer = YES)

Submission #328238

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 12.0 / 12.0

Subtask #4 15.0 / 15.0

Subtask #5 23.0 / 23.0

Subtask #6 31.0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
12.0 / 12.0

Subtask #4
15.0 / 15.0

Subtask #5
23.0 / 23.0

Subtask #6
31.0 / 31.0