oj.uz

Submission #98716

# Submission time Handle Problem Language Result Execution time Memory
98716 2019-02-25T08:56:42 Z youngyojun Alternating Current (BOI18_alternating) C++11
100 / 100
 620 ms 17820 KB 
#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define befv(V) ((V)[(sz(V)-2)])
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void fuk() { puts("impossible"); exit(0); }
 
const bool debug = 0;
const int MAXN = 100005;
const int MAXM = 100005;
 
struct PFS {
	int d[MAXN*2], N;
	void init() { fill(d, d+MAXN*2, 0); }
	void add(int s, int e) { d[s]++; d[e+1]--; }
	bool cal() {
		for(int i = 1; i <= N*2; i++) d[i+1] += d[i];
		for(int i = 1; i <= N; i++)
			if(!(d[i] + d[i+N])) return false;
		return true;
	}
} preA, preB;
 
vector<int> T[MAXN*2];
vector<int> G[MAXM], CH;
bitset<MAXM> isChild;
int prt[MAXM];
 
bitset<MAXM> CA, CB;
 
int A[MAXM], B[MAXM];
 
int Ans[MAXM];
int N, M;
 
bool isValid() {
	preA.init(); preB.init();
	for(int i = 1; i <= M; i++)
		(Ans[i] ? preA : preB).add(A[i], B[i]);
	return preA.cal() && preB.cal();
}
 
void dfs(int i, int c) {
	prt[i] = c;
	for(int v : G[i]) if(!prt[v])
		dfs(v, c);
}
 
int main() {
	ios::sync_with_stdio(false);
 
	cin >> N >> M;
	preA.N = preB.N = N;
	for(int i = 1; i <= M; i++) {
		cin >> A[i] >> B[i];
		if(A[i] > B[i]) B[i] += N;
		if(B[i]-A[i] == N-1) { A[i] = 1; B[i] = N; }
		T[A[i]].eb(i);
		T[A[i]+N].eb(i);
 
		if(debug) printf("%d ; %d %d\n", i, A[i], B[i]);
	}
 
	{
		int ci = -1;
		for(int i = 1; i <= M; i++)
			if(1 == A[i] && B[i] == N)
				ci = i;
		if(0 < ci) {
			for(int i = 1; i <= M; i++) if(i != ci) {
				isChild[i] = true;
				G[ci].eb(i);
			}
		} else {
			for(int i = 1; i <= N*2; i++)
				sort(allv(T[i]), [&](int a, int b) {
					if(B[a] != B[b]) return B[a] > B[b];
					return a < b;
				});
			for(int i = 1, et = 0, ei = -1; i <= N*2; i++) {
				for(int v : T[i]) {
					int e = i + (B[v]-A[v]);
					if(e <= et) {
						isChild[v] = true;
						G[ei].eb(v);
					}
					else {
						et = e; ei = v;
					}
				}
			}
		}
	}
	for(int i = 1; i <= M; i++) if(!isChild[i]) CH.eb(i);
	for(int i : CH) dfs(i, i);
	for(int i = 1; i <= M; i++) G[i].clear();
	for(int i = 1; i <= M; i++) if(isChild[i]) G[prt[i]].eb(i);
	sort(allv(CH), [&](int a, int b) { return A[a] < A[b]; });
 
	if(debug) {
		for(int v : CH) printf("%d ", v); puts("");
	}
 
	for(int v : CH) preA.add(A[v], B[v]);
	if(!preA.cal()) fuk();
	preA.init();
 
	if(sz(CH) & 1) {
		if(sz(CH) < 10) {
			for(int i = 0, n = sz(CH); i < n; i++) {
				for(int j = 0; j < i; j++) Ans[CH[j]] = (i-j-1) & 1;
				for(int j = i; j < n; j++) Ans[CH[j]] = (j-i) & 1;
				for(int j = 1; j <= M; j++) if(isChild[j])
					Ans[j] = !Ans[prt[j]];
				if(isValid()) break;
			}
		} else {
			int ret = 0;
			for(int i = 0; i < 10000; i++) for(int j = 0; j < 10000; j++)
				ret = (ret + i + j) % 998353288;
			if(!ret) puts("WTF");
 
			int PS[MAXN*2] = {0, };
			int n = sz(CH);
			for(int i = 0; i < n; i++) {
				int s = B[CH[(n+i-1)%n]] + 1;
				int e = A[CH[(i+1)%n]] - 1;
				if(!i) s -= N;
				if(s > e) {
					CB[i] = true;
					continue;
				}
				if(debug) printf("i=%d, s=%d, e=%d\n", i, s, e);
				fill(PS+s, PS+e+1, 0);
				for(int v : G[CH[i]]) {
					int a = max(s, A[v]), b = min(e, B[v]);
					if(a <= b) { PS[a]++; PS[b+1]--; }
					a = max(s, A[v]-N); b = min(e, B[v]-N);
					if(a <= b) { PS[a]++; PS[b+1]--; }
					a = max(s, A[v]+N); b = min(e, B[v]+N);
					if(a <= b) { PS[a]++; PS[b+1]--; }
				}
				bool flag = false;
				for(int i = s; i <= e; i++) {
					PS[i+1] += PS[i];
					if(!PS[i]) flag = true;
				}
				CB[i] = !flag;
			}
 
			for(int i = 0; i < n; i++) {
				int s = B[CH[(n+i-2)%n]] + 1;
				int e = A[CH[(i+1)%n]] - 1;
				if(i-2 < 0) s -= N; if(n <= i+1) e += N;
				if(s > e) {
					CA[i] = true;
					continue;
				}
				fill(PS+s, PS+e+1, 0);
				vector<int> V = G[CH[(n+i-1)%n]];
				for(int v : G[CH[i]]) V.eb(v);
				for(int v : V) {
					int a = max(s, A[v]), b = min(e, B[v]);
					if(a <= b) { PS[a]++; PS[b+1]--; }
					a = max(s, A[v]-N); b = min(e, B[v]-N);
					if(a <= b) { PS[a]++; PS[b+1]--; }
					a = max(s, A[v]+N); b = min(e, B[v]+N);
					if(a <= b) { PS[a]++; PS[b+1]--; }
				}
				bool flag = false;
				for(int i = s; i <= e; i++) {
					PS[i+1] += PS[i];
					if(!PS[i]) flag = true;
				}
				CA[i] = !flag;
			}
 
			if(debug) {
				for(int i = 0; i < n; i++)
					printf("%d  :: %d %d\n", i, int(CA[i]), int(CB[i]));
			}
 
			int cnt = 0;
			for(int i = 0; i < n; i++) if(CB[i]) cnt++;
 
			for(int i = 0; i < n; i++) {
				if(!CA[i]) continue;
				int ncnt = cnt;
				if(CB[i]) ncnt--;
				if(CB[(n+i-1)%n]) ncnt--;
 
				if(ncnt < n-2) continue;
 
				for(int j = 0; j < i; j++) Ans[CH[j]] = (i-j-1) & 1;
				for(int j = i; j < n; j++) Ans[CH[j]] = (j-i) & 1;
				for(int j = 1; j <= M; j++) if(isChild[j])
					Ans[j] = !Ans[prt[j]];
				break;
			}
		}
	} else {
		for(int i = 0, n = sz(CH); i < n; i++)
			Ans[CH[i]] = i & 1;
		for(int i = 1; i <= M; i++) if(isChild[i])
			Ans[i] = !Ans[prt[i]];
	}
 
	if(!isValid()) fuk();
	for(int i = 1; i <= M; i++) printf("%d", !!Ans[i]);
	puts("");
	return 0;
}

Compilation message

alternating.cpp: In function 'int main()':
alternating.cpp:116:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for(int v : CH) printf("%d ", v); puts("");
   ^~~
alternating.cpp:116:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for(int v : CH) printf("%d ", v); puts("");
                                     ^~~~
alternating.cpp:169:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(i-2 < 0) s -= N; if(n <= i+1) e += N;
     ^~
alternating.cpp:169:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(i-2 < 0) s -= N; if(n <= i+1) e += N;
                         ^~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 10 ms 8960 KB Output is correct
4 Correct 12 ms 8960 KB Output is correct
5 Correct 10 ms 8960 KB Output is correct
6 Correct 12 ms 8960 KB Output is correct
7 Correct 12 ms 8960 KB Output is correct
8 Correct 11 ms 8960 KB Output is correct
9 Correct 11 ms 8932 KB Output is correct
10 Correct 13 ms 8960 KB Output is correct
11 Correct 9 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 12 ms 9028 KB Output is correct
14 Correct 10 ms 8960 KB Output is correct
15 Correct 9 ms 8960 KB Output is correct
16 Correct 11 ms 8960 KB Output is correct
17 Correct 10 ms 8960 KB Output is correct
18 Correct 10 ms 8960 KB Output is correct
19 Correct 10 ms 8960 KB Output is correct
20 Correct 11 ms 8960 KB Output is correct
21 Correct 10 ms 8960 KB Output is correct
22 Correct 11 ms 8960 KB Output is correct
23 Correct 10 ms 8960 KB Output is correct
24 Correct 11 ms 8960 KB Output is correct
25 Correct 10 ms 8960 KB Output is correct
26 Correct 10 ms 8960 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 11 ms 8960 KB Output is correct
29 Correct 13 ms 8960 KB Output is correct
30 Correct 11 ms 8960 KB Output is correct
31 Correct 10 ms 8960 KB Output is correct
32 Correct 9 ms 8960 KB Output is correct
33 Correct 11 ms 8960 KB Output is correct
34 Correct 8 ms 7424 KB Output is correct
35 Correct 10 ms 8960 KB Output is correct
36 Correct 12 ms 8960 KB Output is correct
37 Correct 10 ms 8960 KB Output is correct
38 Correct 11 ms 8960 KB Output is correct
39 Correct 10 ms 8960 KB Output is correct
40 Correct 11 ms 8960 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 10 ms 8960 KB Output is correct
4 Correct 12 ms 8960 KB Output is correct
5 Correct 10 ms 8960 KB Output is correct
6 Correct 12 ms 8960 KB Output is correct
7 Correct 12 ms 8960 KB Output is correct
8 Correct 11 ms 8960 KB Output is correct
9 Correct 11 ms 8932 KB Output is correct
10 Correct 13 ms 8960 KB Output is correct
11 Correct 9 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 12 ms 9028 KB Output is correct
14 Correct 10 ms 8960 KB Output is correct
15 Correct 9 ms 8960 KB Output is correct
16 Correct 11 ms 8960 KB Output is correct
17 Correct 10 ms 8960 KB Output is correct
18 Correct 10 ms 8960 KB Output is correct
19 Correct 10 ms 8960 KB Output is correct
20 Correct 11 ms 8960 KB Output is correct
21 Correct 10 ms 8960 KB Output is correct
22 Correct 11 ms 8960 KB Output is correct
23 Correct 10 ms 8960 KB Output is correct
24 Correct 11 ms 8960 KB Output is correct
25 Correct 10 ms 8960 KB Output is correct
26 Correct 10 ms 8960 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 11 ms 8960 KB Output is correct
29 Correct 13 ms 8960 KB Output is correct
30 Correct 11 ms 8960 KB Output is correct
31 Correct 10 ms 8960 KB Output is correct
32 Correct 9 ms 8960 KB Output is correct
33 Correct 11 ms 8960 KB Output is correct
34 Correct 8 ms 7424 KB Output is correct
35 Correct 10 ms 8960 KB Output is correct
36 Correct 12 ms 8960 KB Output is correct
37 Correct 10 ms 8960 KB Output is correct
38 Correct 11 ms 8960 KB Output is correct
39 Correct 10 ms 8960 KB Output is correct
40 Correct 11 ms 8960 KB Output is correct
41 Correct 10 ms 8960 KB Output is correct
42 Correct 426 ms 9848 KB Output is correct
43 Correct 431 ms 9820 KB Output is correct
44 Correct 9 ms 8960 KB Output is correct
45 Correct 419 ms 9820 KB Output is correct
46 Correct 10 ms 8960 KB Output is correct
47 Correct 10 ms 8960 KB Output is correct
48 Correct 10 ms 8960 KB Output is correct
49 Correct 10 ms 8960 KB Output is correct
50 Correct 11 ms 8960 KB Output is correct
51 Correct 420 ms 9720 KB Output is correct
52 Correct 12 ms 8960 KB Output is correct
53 Correct 417 ms 9852 KB Output is correct
54 Correct 9 ms 8960 KB Output is correct
55 Correct 12 ms 8960 KB Output is correct
56 Correct 12 ms 8960 KB Output is correct
57 Correct 11 ms 8960 KB Output is correct
58 Correct 10 ms 8960 KB Output is correct
59 Correct 10 ms 8960 KB Output is correct
60 Correct 12 ms 8960 KB Output is correct
61 Correct 11 ms 8960 KB Output is correct
62 Correct 10 ms 7424 KB Output is correct
63 Correct 8 ms 7424 KB Output is correct
64 Correct 10 ms 8960 KB Output is correct
65 Correct 9 ms 8960 KB Output is correct
66 Correct 9 ms 8960 KB Output is correct
67 Correct 434 ms 9776 KB Output is correct
68 Correct 445 ms 9848 KB Output is correct
69 Correct 11 ms 8960 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 10 ms 8960 KB Output is correct
4 Correct 12 ms 8960 KB Output is correct
5 Correct 10 ms 8960 KB Output is correct
6 Correct 12 ms 8960 KB Output is correct
7 Correct 12 ms 8960 KB Output is correct
8 Correct 11 ms 8960 KB Output is correct
9 Correct 11 ms 8932 KB Output is correct
10 Correct 13 ms 8960 KB Output is correct
11 Correct 9 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 12 ms 9028 KB Output is correct
14 Correct 10 ms 8960 KB Output is correct
15 Correct 9 ms 8960 KB Output is correct
16 Correct 11 ms 8960 KB Output is correct
17 Correct 10 ms 8960 KB Output is correct
18 Correct 10 ms 8960 KB Output is correct
19 Correct 10 ms 8960 KB Output is correct
20 Correct 11 ms 8960 KB Output is correct
21 Correct 10 ms 8960 KB Output is correct
22 Correct 11 ms 8960 KB Output is correct
23 Correct 10 ms 8960 KB Output is correct
24 Correct 11 ms 8960 KB Output is correct
25 Correct 10 ms 8960 KB Output is correct
26 Correct 10 ms 8960 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 11 ms 8960 KB Output is correct
29 Correct 13 ms 8960 KB Output is correct
30 Correct 11 ms 8960 KB Output is correct
31 Correct 10 ms 8960 KB Output is correct
32 Correct 9 ms 8960 KB Output is correct
33 Correct 11 ms 8960 KB Output is correct
34 Correct 8 ms 7424 KB Output is correct
35 Correct 10 ms 8960 KB Output is correct
36 Correct 12 ms 8960 KB Output is correct
37 Correct 10 ms 8960 KB Output is correct
38 Correct 11 ms 8960 KB Output is correct
39 Correct 10 ms 8960 KB Output is correct
40 Correct 11 ms 8960 KB Output is correct
41 Correct 10 ms 8960 KB Output is correct
42 Correct 426 ms 9848 KB Output is correct
43 Correct 431 ms 9820 KB Output is correct
44 Correct 9 ms 8960 KB Output is correct
45 Correct 419 ms 9820 KB Output is correct
46 Correct 10 ms 8960 KB Output is correct
47 Correct 10 ms 8960 KB Output is correct
48 Correct 10 ms 8960 KB Output is correct
49 Correct 10 ms 8960 KB Output is correct
50 Correct 11 ms 8960 KB Output is correct
51 Correct 420 ms 9720 KB Output is correct
52 Correct 12 ms 8960 KB Output is correct
53 Correct 417 ms 9852 KB Output is correct
54 Correct 9 ms 8960 KB Output is correct
55 Correct 12 ms 8960 KB Output is correct
56 Correct 12 ms 8960 KB Output is correct
57 Correct 11 ms 8960 KB Output is correct
58 Correct 10 ms 8960 KB Output is correct
59 Correct 10 ms 8960 KB Output is correct
60 Correct 12 ms 8960 KB Output is correct
61 Correct 11 ms 8960 KB Output is correct
62 Correct 10 ms 7424 KB Output is correct
63 Correct 8 ms 7424 KB Output is correct
64 Correct 10 ms 8960 KB Output is correct
65 Correct 9 ms 8960 KB Output is correct
66 Correct 9 ms 8960 KB Output is correct
67 Correct 434 ms 9776 KB Output is correct
68 Correct 445 ms 9848 KB Output is correct
69 Correct 11 ms 8960 KB Output is correct
70 Correct 12 ms 9088 KB Output is correct
71 Correct 423 ms 9848 KB Output is correct
72 Correct 435 ms 9848 KB Output is correct
73 Correct 12 ms 8960 KB Output is correct
74 Correct 432 ms 9848 KB Output is correct
75 Correct 10 ms 8960 KB Output is correct
76 Correct 11 ms 9088 KB Output is correct
77 Correct 11 ms 8960 KB Output is correct
78 Correct 444 ms 9832 KB Output is correct
79 Correct 10 ms 8960 KB Output is correct
80 Correct 13 ms 9088 KB Output is correct
81 Correct 452 ms 9848 KB Output is correct
82 Correct 10 ms 8960 KB Output is correct
83 Correct 11 ms 9088 KB Output is correct
84 Correct 423 ms 9856 KB Output is correct
85 Correct 11 ms 8960 KB Output is correct
86 Correct 11 ms 8960 KB Output is correct
87 Correct 12 ms 9088 KB Output is correct
88 Correct 10 ms 8960 KB Output is correct
89 Correct 436 ms 9852 KB Output is correct
90 Correct 13 ms 9088 KB Output is correct
91 Correct 418 ms 9820 KB Output is correct
92 Correct 11 ms 9088 KB Output is correct
93 Correct 11 ms 8960 KB Output is correct
94 Correct 10 ms 7424 KB Output is correct
95 Correct 11 ms 8960 KB Output is correct
96 Correct 11 ms 9088 KB Output is correct
97 Correct 437 ms 9980 KB Output is correct
98 Correct 11 ms 9088 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12012 KB Output is correct
2 Correct 11 ms 8960 KB Output is correct
3 Correct 32 ms 13172 KB Output is correct
4 Correct 35 ms 13300 KB Output is correct
5 Correct 168 ms 16604 KB Output is correct
6 Correct 620 ms 16888 KB Output is correct
7 Correct 569 ms 17532 KB Output is correct
8 Correct 12 ms 9216 KB Output is correct
9 Correct 12 ms 9088 KB Output is correct
10 Correct 597 ms 17820 KB Output is correct
11 Correct 128 ms 15316 KB Output is correct
12 Correct 96 ms 16624 KB Output is correct
13 Correct 13 ms 8192 KB Output is correct
14 Correct 11 ms 8192 KB Output is correct
15 Correct 122 ms 15172 KB Output is correct
16 Correct 439 ms 14036 KB Output is correct
17 Correct 120 ms 15200 KB Output is correct
18 Correct 61 ms 13008 KB Output is correct
19 Correct 14 ms 8704 KB Output is correct
20 Correct 88 ms 15616 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8960 KB Output is correct
2 Correct 10 ms 8960 KB Output is correct
3 Correct 10 ms 8960 KB Output is correct
4 Correct 12 ms 8960 KB Output is correct
5 Correct 10 ms 8960 KB Output is correct
6 Correct 12 ms 8960 KB Output is correct
7 Correct 12 ms 8960 KB Output is correct
8 Correct 11 ms 8960 KB Output is correct
9 Correct 11 ms 8932 KB Output is correct
10 Correct 13 ms 8960 KB Output is correct
11 Correct 9 ms 8960 KB Output is correct
12 Correct 10 ms 8960 KB Output is correct
13 Correct 12 ms 9028 KB Output is correct
14 Correct 10 ms 8960 KB Output is correct
15 Correct 9 ms 8960 KB Output is correct
16 Correct 11 ms 8960 KB Output is correct
17 Correct 10 ms 8960 KB Output is correct
18 Correct 10 ms 8960 KB Output is correct
19 Correct 10 ms 8960 KB Output is correct
20 Correct 11 ms 8960 KB Output is correct
21 Correct 10 ms 8960 KB Output is correct
22 Correct 11 ms 8960 KB Output is correct
23 Correct 10 ms 8960 KB Output is correct
24 Correct 11 ms 8960 KB Output is correct
25 Correct 10 ms 8960 KB Output is correct
26 Correct 10 ms 8960 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 11 ms 8960 KB Output is correct
29 Correct 13 ms 8960 KB Output is correct
30 Correct 11 ms 8960 KB Output is correct
31 Correct 10 ms 8960 KB Output is correct
32 Correct 9 ms 8960 KB Output is correct
33 Correct 11 ms 8960 KB Output is correct
34 Correct 8 ms 7424 KB Output is correct
35 Correct 10 ms 8960 KB Output is correct
36 Correct 12 ms 8960 KB Output is correct
37 Correct 10 ms 8960 KB Output is correct
38 Correct 11 ms 8960 KB Output is correct
39 Correct 10 ms 8960 KB Output is correct
40 Correct 11 ms 8960 KB Output is correct
41 Correct 10 ms 8960 KB Output is correct
42 Correct 426 ms 9848 KB Output is correct
43 Correct 431 ms 9820 KB Output is correct
44 Correct 9 ms 8960 KB Output is correct
45 Correct 419 ms 9820 KB Output is correct
46 Correct 10 ms 8960 KB Output is correct
47 Correct 10 ms 8960 KB Output is correct
48 Correct 10 ms 8960 KB Output is correct
49 Correct 10 ms 8960 KB Output is correct
50 Correct 11 ms 8960 KB Output is correct
51 Correct 420 ms 9720 KB Output is correct
52 Correct 12 ms 8960 KB Output is correct
53 Correct 417 ms 9852 KB Output is correct
54 Correct 9 ms 8960 KB Output is correct
55 Correct 12 ms 8960 KB Output is correct
56 Correct 12 ms 8960 KB Output is correct
57 Correct 11 ms 8960 KB Output is correct
58 Correct 10 ms 8960 KB Output is correct
59 Correct 10 ms 8960 KB Output is correct
60 Correct 12 ms 8960 KB Output is correct
61 Correct 11 ms 8960 KB Output is correct
62 Correct 10 ms 7424 KB Output is correct
63 Correct 8 ms 7424 KB Output is correct
64 Correct 10 ms 8960 KB Output is correct
65 Correct 9 ms 8960 KB Output is correct
66 Correct 9 ms 8960 KB Output is correct
67 Correct 434 ms 9776 KB Output is correct
68 Correct 445 ms 9848 KB Output is correct
69 Correct 11 ms 8960 KB Output is correct
70 Correct 12 ms 9088 KB Output is correct
71 Correct 423 ms 9848 KB Output is correct
72 Correct 435 ms 9848 KB Output is correct
73 Correct 12 ms 8960 KB Output is correct
74 Correct 432 ms 9848 KB Output is correct
75 Correct 10 ms 8960 KB Output is correct
76 Correct 11 ms 9088 KB Output is correct
77 Correct 11 ms 8960 KB Output is correct
78 Correct 444 ms 9832 KB Output is correct
79 Correct 10 ms 8960 KB Output is correct
80 Correct 13 ms 9088 KB Output is correct
81 Correct 452 ms 9848 KB Output is correct
82 Correct 10 ms 8960 KB Output is correct
83 Correct 11 ms 9088 KB Output is correct
84 Correct 423 ms 9856 KB Output is correct
85 Correct 11 ms 8960 KB Output is correct
86 Correct 11 ms 8960 KB Output is correct
87 Correct 12 ms 9088 KB Output is correct
88 Correct 10 ms 8960 KB Output is correct
89 Correct 436 ms 9852 KB Output is correct
90 Correct 13 ms 9088 KB Output is correct
91 Correct 418 ms 9820 KB Output is correct
92 Correct 11 ms 9088 KB Output is correct
93 Correct 11 ms 8960 KB Output is correct
94 Correct 10 ms 7424 KB Output is correct
95 Correct 11 ms 8960 KB Output is correct
96 Correct 11 ms 9088 KB Output is correct
97 Correct 437 ms 9980 KB Output is correct
98 Correct 11 ms 9088 KB Output is correct
99 Correct 48 ms 12012 KB Output is correct
100 Correct 11 ms 8960 KB Output is correct
101 Correct 32 ms 13172 KB Output is correct
102 Correct 35 ms 13300 KB Output is correct
103 Correct 168 ms 16604 KB Output is correct
104 Correct 620 ms 16888 KB Output is correct
105 Correct 569 ms 17532 KB Output is correct
106 Correct 12 ms 9216 KB Output is correct
107 Correct 12 ms 9088 KB Output is correct
108 Correct 597 ms 17820 KB Output is correct
109 Correct 128 ms 15316 KB Output is correct
110 Correct 96 ms 16624 KB Output is correct
111 Correct 13 ms 8192 KB Output is correct
112 Correct 11 ms 8192 KB Output is correct
113 Correct 122 ms 15172 KB Output is correct
114 Correct 439 ms 14036 KB Output is correct
115 Correct 120 ms 15200 KB Output is correct
116 Correct 61 ms 13008 KB Output is correct
117 Correct 14 ms 8704 KB Output is correct
118 Correct 88 ms 15616 KB Output is correct
119 Correct 418 ms 9820 KB Output is correct
120 Correct 497 ms 15860 KB Output is correct
121 Correct 468 ms 13688 KB Output is correct
122 Correct 10 ms 8960 KB Output is correct
123 Correct 429 ms 10232 KB Output is correct
124 Correct 57 ms 12152 KB Output is correct
125 Correct 43 ms 11512 KB Output is correct
126 Correct 14 ms 9088 KB Output is correct
127 Correct 448 ms 10616 KB Output is correct
128 Correct 118 ms 15476 KB Output is correct
129 Correct 505 ms 14072 KB Output is correct
130 Correct 101 ms 13944 KB Output is correct
131 Correct 12 ms 8960 KB Output is correct
132 Correct 15 ms 9088 KB Output is correct
133 Correct 145 ms 15136 KB Output is correct
134 Correct 51 ms 11148 KB Output is correct
135 Correct 13 ms 8960 KB Output is correct
136 Correct 108 ms 13428 KB Output is correct
137 Correct 515 ms 15416 KB Output is correct
138 Correct 432 ms 9976 KB Output is correct