답안 #98715 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
98715	2019-02-25T08:56:15 Z	youngyojun	Alternating Current (BOI18_alternating)	C++11	55 / 100	199 ms	17400 KB

alternating

#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 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:164:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(i-2 < 0) s -= N; if(n <= i+1) e += N;
     ^~
alternating.cpp:164: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

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8960 KB	Output is correct
2	Correct	10 ms	8960 KB	Output is correct
3	Correct	13 ms	8960 KB	Output is correct
4	Correct	12 ms	8960 KB	Output is correct
5	Correct	0 ms	8960 KB	Output is correct
6	Correct	10 ms	8960 KB	Output is correct
7	Correct	10 ms	8960 KB	Output is correct
8	Correct	11 ms	8960 KB	Output is correct
9	Correct	11 ms	8960 KB	Output is correct
10	Correct	9 ms	8960 KB	Output is correct
11	Correct	11 ms	8960 KB	Output is correct
12	Correct	11 ms	8960 KB	Output is correct
13	Correct	12 ms	8960 KB	Output is correct
14	Correct	9 ms	8960 KB	Output is correct
15	Correct	13 ms	8960 KB	Output is correct
16	Correct	10 ms	8960 KB	Output is correct
17	Correct	9 ms	8960 KB	Output is correct
18	Correct	10 ms	8960 KB	Output is correct
19	Correct	11 ms	8960 KB	Output is correct
20	Correct	9 ms	8960 KB	Output is correct
21	Correct	11 ms	8960 KB	Output is correct
22	Correct	10 ms	8960 KB	Output is correct
23	Correct	11 ms	8960 KB	Output is correct
24	Correct	11 ms	8960 KB	Output is correct
25	Correct	10 ms	8956 KB	Output is correct
26	Correct	12 ms	8960 KB	Output is correct
27	Correct	9 ms	7468 KB	Output is correct
28	Correct	10 ms	8960 KB	Output is correct
29	Correct	12 ms	8960 KB	Output is correct
30	Correct	12 ms	8960 KB	Output is correct
31	Correct	10 ms	8960 KB	Output is correct
32	Correct	11 ms	8960 KB	Output is correct
33	Correct	10 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	10 ms	8960 KB	Output is correct
37	Correct	10 ms	9036 KB	Output is correct
38	Correct	13 ms	8960 KB	Output is correct
39	Correct	10 ms	8960 KB	Output is correct
40	Correct	12 ms	8960 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8960 KB	Output is correct
2	Correct	10 ms	8960 KB	Output is correct
3	Correct	13 ms	8960 KB	Output is correct
4	Correct	12 ms	8960 KB	Output is correct
5	Correct	0 ms	8960 KB	Output is correct
6	Correct	10 ms	8960 KB	Output is correct
7	Correct	10 ms	8960 KB	Output is correct
8	Correct	11 ms	8960 KB	Output is correct
9	Correct	11 ms	8960 KB	Output is correct
10	Correct	9 ms	8960 KB	Output is correct
11	Correct	11 ms	8960 KB	Output is correct
12	Correct	11 ms	8960 KB	Output is correct
13	Correct	12 ms	8960 KB	Output is correct
14	Correct	9 ms	8960 KB	Output is correct
15	Correct	13 ms	8960 KB	Output is correct
16	Correct	10 ms	8960 KB	Output is correct
17	Correct	9 ms	8960 KB	Output is correct
18	Correct	10 ms	8960 KB	Output is correct
19	Correct	11 ms	8960 KB	Output is correct
20	Correct	9 ms	8960 KB	Output is correct
21	Correct	11 ms	8960 KB	Output is correct
22	Correct	10 ms	8960 KB	Output is correct
23	Correct	11 ms	8960 KB	Output is correct
24	Correct	11 ms	8960 KB	Output is correct
25	Correct	10 ms	8956 KB	Output is correct
26	Correct	12 ms	8960 KB	Output is correct
27	Correct	9 ms	7468 KB	Output is correct
28	Correct	10 ms	8960 KB	Output is correct
29	Correct	12 ms	8960 KB	Output is correct
30	Correct	12 ms	8960 KB	Output is correct
31	Correct	10 ms	8960 KB	Output is correct
32	Correct	11 ms	8960 KB	Output is correct
33	Correct	10 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	10 ms	8960 KB	Output is correct
37	Correct	10 ms	9036 KB	Output is correct
38	Correct	13 ms	8960 KB	Output is correct
39	Correct	10 ms	8960 KB	Output is correct
40	Correct	12 ms	8960 KB	Output is correct
41	Correct	10 ms	8960 KB	Output is correct
42	Correct	10 ms	9728 KB	Output is correct
43	Correct	11 ms	9692 KB	Output is correct
44	Correct	11 ms	8960 KB	Output is correct
45	Correct	11 ms	9728 KB	Output is correct
46	Correct	11 ms	8960 KB	Output is correct
47	Correct	11 ms	8960 KB	Output is correct
48	Correct	10 ms	8960 KB	Output is correct
49	Correct	11 ms	8960 KB	Output is correct
50	Correct	12 ms	8960 KB	Output is correct
51	Correct	11 ms	9728 KB	Output is correct
52	Correct	10 ms	8960 KB	Output is correct
53	Correct	11 ms	9728 KB	Output is correct
54	Correct	11 ms	8960 KB	Output is correct
55	Correct	12 ms	8960 KB	Output is correct
56	Correct	10 ms	8960 KB	Output is correct
57	Correct	10 ms	8960 KB	Output is correct
58	Correct	12 ms	8960 KB	Output is correct
59	Correct	10 ms	8960 KB	Output is correct
60	Correct	10 ms	8960 KB	Output is correct
61	Correct	10 ms	8960 KB	Output is correct
62	Correct	9 ms	7424 KB	Output is correct
63	Correct	8 ms	7396 KB	Output is correct
64	Correct	11 ms	8960 KB	Output is correct
65	Correct	11 ms	8960 KB	Output is correct
66	Correct	9 ms	8960 KB	Output is correct
67	Correct	13 ms	9856 KB	Output is correct
68	Correct	12 ms	9856 KB	Output is correct
69	Correct	12 ms	8960 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8960 KB	Output is correct
2	Correct	10 ms	8960 KB	Output is correct
3	Correct	13 ms	8960 KB	Output is correct
4	Correct	12 ms	8960 KB	Output is correct
5	Correct	0 ms	8960 KB	Output is correct
6	Correct	10 ms	8960 KB	Output is correct
7	Correct	10 ms	8960 KB	Output is correct
8	Correct	11 ms	8960 KB	Output is correct
9	Correct	11 ms	8960 KB	Output is correct
10	Correct	9 ms	8960 KB	Output is correct
11	Correct	11 ms	8960 KB	Output is correct
12	Correct	11 ms	8960 KB	Output is correct
13	Correct	12 ms	8960 KB	Output is correct
14	Correct	9 ms	8960 KB	Output is correct
15	Correct	13 ms	8960 KB	Output is correct
16	Correct	10 ms	8960 KB	Output is correct
17	Correct	9 ms	8960 KB	Output is correct
18	Correct	10 ms	8960 KB	Output is correct
19	Correct	11 ms	8960 KB	Output is correct
20	Correct	9 ms	8960 KB	Output is correct
21	Correct	11 ms	8960 KB	Output is correct
22	Correct	10 ms	8960 KB	Output is correct
23	Correct	11 ms	8960 KB	Output is correct
24	Correct	11 ms	8960 KB	Output is correct
25	Correct	10 ms	8956 KB	Output is correct
26	Correct	12 ms	8960 KB	Output is correct
27	Correct	9 ms	7468 KB	Output is correct
28	Correct	10 ms	8960 KB	Output is correct
29	Correct	12 ms	8960 KB	Output is correct
30	Correct	12 ms	8960 KB	Output is correct
31	Correct	10 ms	8960 KB	Output is correct
32	Correct	11 ms	8960 KB	Output is correct
33	Correct	10 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	10 ms	8960 KB	Output is correct
37	Correct	10 ms	9036 KB	Output is correct
38	Correct	13 ms	8960 KB	Output is correct
39	Correct	10 ms	8960 KB	Output is correct
40	Correct	12 ms	8960 KB	Output is correct
41	Correct	10 ms	8960 KB	Output is correct
42	Correct	10 ms	9728 KB	Output is correct
43	Correct	11 ms	9692 KB	Output is correct
44	Correct	11 ms	8960 KB	Output is correct
45	Correct	11 ms	9728 KB	Output is correct
46	Correct	11 ms	8960 KB	Output is correct
47	Correct	11 ms	8960 KB	Output is correct
48	Correct	10 ms	8960 KB	Output is correct
49	Correct	11 ms	8960 KB	Output is correct
50	Correct	12 ms	8960 KB	Output is correct
51	Correct	11 ms	9728 KB	Output is correct
52	Correct	10 ms	8960 KB	Output is correct
53	Correct	11 ms	9728 KB	Output is correct
54	Correct	11 ms	8960 KB	Output is correct
55	Correct	12 ms	8960 KB	Output is correct
56	Correct	10 ms	8960 KB	Output is correct
57	Correct	10 ms	8960 KB	Output is correct
58	Correct	12 ms	8960 KB	Output is correct
59	Correct	10 ms	8960 KB	Output is correct
60	Correct	10 ms	8960 KB	Output is correct
61	Correct	10 ms	8960 KB	Output is correct
62	Correct	9 ms	7424 KB	Output is correct
63	Correct	8 ms	7396 KB	Output is correct
64	Correct	11 ms	8960 KB	Output is correct
65	Correct	11 ms	8960 KB	Output is correct
66	Correct	9 ms	8960 KB	Output is correct
67	Correct	13 ms	9856 KB	Output is correct
68	Correct	12 ms	9856 KB	Output is correct
69	Correct	12 ms	8960 KB	Output is correct
70	Correct	12 ms	9088 KB	Output is correct
71	Correct	11 ms	9856 KB	Output is correct
72	Correct	11 ms	9728 KB	Output is correct
73	Correct	12 ms	8960 KB	Output is correct
74	Correct	14 ms	9728 KB	Output is correct
75	Correct	10 ms	8960 KB	Output is correct
76	Correct	13 ms	8960 KB	Output is correct
77	Correct	12 ms	8960 KB	Output is correct
78	Correct	11 ms	9728 KB	Output is correct
79	Correct	11 ms	8960 KB	Output is correct
80	Correct	11 ms	9088 KB	Output is correct
81	Correct	10 ms	9728 KB	Output is correct
82	Correct	10 ms	9008 KB	Output is correct
83	Correct	11 ms	9088 KB	Output is correct
84	Correct	11 ms	9856 KB	Output is correct
85	Correct	10 ms	8960 KB	Output is correct
86	Correct	9 ms	8960 KB	Output is correct
87	Correct	10 ms	9088 KB	Output is correct
88	Correct	9 ms	8960 KB	Output is correct
89	Correct	10 ms	9728 KB	Output is correct
90	Correct	33 ms	9080 KB	Output is correct
91	Correct	12 ms	9856 KB	Output is correct
92	Correct	12 ms	8960 KB	Output is correct
93	Correct	9 ms	8960 KB	Output is correct
94	Correct	10 ms	7424 KB	Output is correct
95	Correct	10 ms	8960 KB	Output is correct
96	Correct	12 ms	9088 KB	Output is correct
97	Correct	15 ms	9856 KB	Output is correct
98	Correct	11 ms	9088 KB	Output is correct

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	12012 KB	Output is correct
2	Correct	11 ms	8960 KB	Output is correct
3	Correct	29 ms	13248 KB	Output is correct
4	Correct	49 ms	13300 KB	Output is correct
5	Correct	127 ms	16760 KB	Output is correct
6	Correct	199 ms	16888 KB	Output is correct
7	Incorrect	119 ms	17400 KB	'impossible' claimed, but there is a solution
8	Halted	0 ms	0 KB	-

Subtask #5
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	11 ms	8960 KB	Output is correct
2	Correct	10 ms	8960 KB	Output is correct
3	Correct	13 ms	8960 KB	Output is correct
4	Correct	12 ms	8960 KB	Output is correct
5	Correct	0 ms	8960 KB	Output is correct
6	Correct	10 ms	8960 KB	Output is correct
7	Correct	10 ms	8960 KB	Output is correct
8	Correct	11 ms	8960 KB	Output is correct
9	Correct	11 ms	8960 KB	Output is correct
10	Correct	9 ms	8960 KB	Output is correct
11	Correct	11 ms	8960 KB	Output is correct
12	Correct	11 ms	8960 KB	Output is correct
13	Correct	12 ms	8960 KB	Output is correct
14	Correct	9 ms	8960 KB	Output is correct
15	Correct	13 ms	8960 KB	Output is correct
16	Correct	10 ms	8960 KB	Output is correct
17	Correct	9 ms	8960 KB	Output is correct
18	Correct	10 ms	8960 KB	Output is correct
19	Correct	11 ms	8960 KB	Output is correct
20	Correct	9 ms	8960 KB	Output is correct
21	Correct	11 ms	8960 KB	Output is correct
22	Correct	10 ms	8960 KB	Output is correct
23	Correct	11 ms	8960 KB	Output is correct
24	Correct	11 ms	8960 KB	Output is correct
25	Correct	10 ms	8956 KB	Output is correct
26	Correct	12 ms	8960 KB	Output is correct
27	Correct	9 ms	7468 KB	Output is correct
28	Correct	10 ms	8960 KB	Output is correct
29	Correct	12 ms	8960 KB	Output is correct
30	Correct	12 ms	8960 KB	Output is correct
31	Correct	10 ms	8960 KB	Output is correct
32	Correct	11 ms	8960 KB	Output is correct
33	Correct	10 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	10 ms	8960 KB	Output is correct
37	Correct	10 ms	9036 KB	Output is correct
38	Correct	13 ms	8960 KB	Output is correct
39	Correct	10 ms	8960 KB	Output is correct
40	Correct	12 ms	8960 KB	Output is correct
41	Correct	10 ms	8960 KB	Output is correct
42	Correct	10 ms	9728 KB	Output is correct
43	Correct	11 ms	9692 KB	Output is correct
44	Correct	11 ms	8960 KB	Output is correct
45	Correct	11 ms	9728 KB	Output is correct
46	Correct	11 ms	8960 KB	Output is correct
47	Correct	11 ms	8960 KB	Output is correct
48	Correct	10 ms	8960 KB	Output is correct
49	Correct	11 ms	8960 KB	Output is correct
50	Correct	12 ms	8960 KB	Output is correct
51	Correct	11 ms	9728 KB	Output is correct
52	Correct	10 ms	8960 KB	Output is correct
53	Correct	11 ms	9728 KB	Output is correct
54	Correct	11 ms	8960 KB	Output is correct
55	Correct	12 ms	8960 KB	Output is correct
56	Correct	10 ms	8960 KB	Output is correct
57	Correct	10 ms	8960 KB	Output is correct
58	Correct	12 ms	8960 KB	Output is correct
59	Correct	10 ms	8960 KB	Output is correct
60	Correct	10 ms	8960 KB	Output is correct
61	Correct	10 ms	8960 KB	Output is correct
62	Correct	9 ms	7424 KB	Output is correct
63	Correct	8 ms	7396 KB	Output is correct
64	Correct	11 ms	8960 KB	Output is correct
65	Correct	11 ms	8960 KB	Output is correct
66	Correct	9 ms	8960 KB	Output is correct
67	Correct	13 ms	9856 KB	Output is correct
68	Correct	12 ms	9856 KB	Output is correct
69	Correct	12 ms	8960 KB	Output is correct
70	Correct	12 ms	9088 KB	Output is correct
71	Correct	11 ms	9856 KB	Output is correct
72	Correct	11 ms	9728 KB	Output is correct
73	Correct	12 ms	8960 KB	Output is correct
74	Correct	14 ms	9728 KB	Output is correct
75	Correct	10 ms	8960 KB	Output is correct
76	Correct	13 ms	8960 KB	Output is correct
77	Correct	12 ms	8960 KB	Output is correct
78	Correct	11 ms	9728 KB	Output is correct
79	Correct	11 ms	8960 KB	Output is correct
80	Correct	11 ms	9088 KB	Output is correct
81	Correct	10 ms	9728 KB	Output is correct
82	Correct	10 ms	9008 KB	Output is correct
83	Correct	11 ms	9088 KB	Output is correct
84	Correct	11 ms	9856 KB	Output is correct
85	Correct	10 ms	8960 KB	Output is correct
86	Correct	9 ms	8960 KB	Output is correct
87	Correct	10 ms	9088 KB	Output is correct
88	Correct	9 ms	8960 KB	Output is correct
89	Correct	10 ms	9728 KB	Output is correct
90	Correct	33 ms	9080 KB	Output is correct
91	Correct	12 ms	9856 KB	Output is correct
92	Correct	12 ms	8960 KB	Output is correct
93	Correct	9 ms	8960 KB	Output is correct
94	Correct	10 ms	7424 KB	Output is correct
95	Correct	10 ms	8960 KB	Output is correct
96	Correct	12 ms	9088 KB	Output is correct
97	Correct	15 ms	9856 KB	Output is correct
98	Correct	11 ms	9088 KB	Output is correct
99	Correct	54 ms	12012 KB	Output is correct
100	Correct	11 ms	8960 KB	Output is correct
101	Correct	29 ms	13248 KB	Output is correct
102	Correct	49 ms	13300 KB	Output is correct
103	Correct	127 ms	16760 KB	Output is correct
104	Correct	199 ms	16888 KB	Output is correct
105	Incorrect	119 ms	17400 KB	'impossible' claimed, but there is a solution
106	Halted	0 ms	0 KB	-

답안 #98715

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 20.0 / 20.0

Subtask #3 22.0 / 22.0

Subtask #4 0 / 19.0

Subtask #5 0 / 26.0

Subtask #1
13.0 / 13.0

Subtask #2
20.0 / 20.0

Subtask #3
22.0 / 22.0

Subtask #4
0 / 19.0

Subtask #5
0 / 26.0