oj.uz

답안 #828870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828870 2023-08-17T18:01:01 Z QwertyPi From Hacks to Snitches (BOI21_watchmen) C++14
50 / 100
 6000 ms 238888 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2.5e5 + 11;
const int MAXV = 2750 + 11;
const int MAXC = 1500 + 11;
const int MAXA = 2e6 + 11;
int cyc[MAXN], ci[MAXN], cl[MAXN], vi[MAXN];
vector<int> G[MAXN], H[MAXN];
int dp[MAXN], dp2[MAXV][MAXC];
bool vis[MAXN], vis2[MAXV][MAXC];
vector<pair<int, int>> ch[MAXA];
vector<int> cycles[MAXV];

struct edge{
	int u, v;
};

bool in_cycle(int v){
	return cyc[v] != 0;
}

int cycle_nxt(int v){
	assert(cyc[v] != 0);
	return cycles[cyc[v]][(ci[v] + 1) % cl[v]];
}

int cycle_prv(int v){
	assert(cyc[v] != 0);
	return cycles[cyc[v]][(ci[v] + cl[v] - 1) % cl[v]];
}

int32_t main(){
	cin.tie(0); cout.tie(0)->sync_with_stdio(false);
	int n, m; cin >> n >> m;
	vector<edge> E;
	for(int i = 0; i < m; i++){
		int u, v; cin >> u >> v;
		E.push_back({u, v});
	}
	int s_cyc = 0;
	int k; cin >> k;
	for(int i = 0; i < k; i++){
		vector<int> v;
		int l; cin >> l;
		for(int j = 0; j < l; j++){
			int u; cin >> u; v.push_back(u);
		}
		cycles[i + 1] = v;
		for(int j = 0; j < l; j++) cyc[v[j]] = i + 1, ci[v[j]] = j, cl[v[j]] = v.size(), vi[v[j]] = 1 + s_cyc + j; s_cyc += l;
	}

	for(int i = 0; i < m; i++){
		edge e = E[i];
		if(!in_cycle(e.u)) swap(e.u, e.v);
		if(in_cycle(e.u) && in_cycle(e.v)){
			if(e.u == cycle_nxt(e.v) || e.u == cycle_prv(e.v))
				continue;
			H[e.u].push_back(e.v);
			H[e.v].push_back(e.u);
		}else{
			G[e.u].push_back(e.v);
			G[e.v].push_back(e.u);
		}
	}
	// for(int i = 1; i <= n; i++) cout << cyc[i] << ' '; cout << endl;
	// for(int i = 1; i <= n; i++) cout << ci[i] << ' '; cout << endl;
	// for(int i = 1; i <= n; i++) cout << vi[i] << ' '; cout << endl;

	memset(dp, 0x3f, sizeof(dp));
	memset(dp2, 0x3f, sizeof(dp2));

	dp[1] = 0; ch[0].push_back({1, 0});
	for(int d = 0; d < MAXA; d++){
		for(auto [v, i] : ch[d]){
			// printf("dist[(%d %d)] = %d\n", v, i, d);
			if(!in_cycle(v)){
				assert(i == 0);
				if(vis[v]) continue; vis[v] = true;
				for(auto u : G[v]){
					if(!in_cycle(u)){
						if(dp[v] + 1 < dp[u]){
							dp[u] = dp[v] + 1;
							ch[d + 1].push_back({u, 0});
						}
					}else{
						vector<int> J;
						J.push_back(0); J.push_back(1);
						J.push_back((((ci[u] - dp[v]) % cl[u]) + cl[u]) % cl[u]);
						for(int j : J){
							int dst = dp[v] + 1 + j;
							if(dst % cl[u] == ci[u]) continue;
							if(dst < dp2[vi[u]][dst % cl[u]]){
								dp2[vi[u]][dst % cl[u]] = dst;
								ch[dst].push_back({u, dst % cl[u]});
							}
						}
					}
				}
			}else{
				if(!vis[v]){
					for(int i = 0; i < cl[v]; i++){
						dp[v] = min(dp[v], dp2[vi[v]][i]);
					}
					// printf("dp[%d] = %d\n", v, dp[v]);
					vis[v] = true;
					for(auto u : G[v]){
						assert(!in_cycle(u));
						if(dp[v] + 1 < dp[u]){
							dp[u] = dp[v] + 1;
							ch[d + 1].push_back({u, 0});
						}
					}
				}

				assert(d % cl[v] != ci[v]);

				if(vis2[vi[v]][d % cl[v]]) continue; vis2[vi[v]][d % cl[v]] = true;
				// stationery
				if((d + 1) % cl[v] != ci[v] && d + 1 < dp2[vi[v]][(d + 1) % cl[v]]){
					dp2[vi[v]][(d + 1) % cl[v]] = d + 1;
					ch[d + 1].push_back({v, (d + 1) % cl[v]});
				}

				for(auto u : H[v]){
					for(int j = 0; j < cl[u] / __gcd(cl[u], cl[v]); j++){
						int dst = d + 1 + j * cl[v];
						if(dst % cl[u] != ci[u] && dst < dp2[vi[u]][dst % cl[u]]){
							dp2[vi[u]][dst % cl[u]] = dst;
							ch[dst].push_back({u, dst % cl[u]});
						}
					}
				}

				// forward
				int u = cycle_nxt(v);
				if(d + 1 < dp2[vi[u]][(d + 1) % cl[u]]){
					dp2[vi[u]][(d + 1) % cl[u]] = d + 1;
					ch[d + 1].push_back({u, (d + 1) % cl[u]});
				}
				
				// backward
				u = cycle_prv(v);
				if((d + 1) % cl[v] != ci[v] && (d + 2) % cl[v] != ci[v] && d + 1 < dp2[vi[u]][(d + 1) % cl[u]]){
					dp2[vi[u]][(d + 1) % cl[u]] = d + 1;
					ch[d + 1].push_back({u, (d + 1) % cl[u]});
				}
			}
		}
		ch[d].clear();
	}
	if(dp[n] == 0x3f3f3f3f){
		cout << "impossible" << endl;
	}else{
		cout << dp[n] << endl;
	}
}

Compilation message

watchmen.cpp: In function 'int32_t main()':
watchmen.cpp:51:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |   for(int j = 0; j < l; j++) cyc[v[j]] = i + 1, ci[v[j]] = j, cl[v[j]] = v.size(), vi[v[j]] = 1 + s_cyc + j; s_cyc += l;
      |   ^~~
watchmen.cpp:51:110: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   51 |   for(int j = 0; j < l; j++) cyc[v[j]] = i + 1, ci[v[j]] = j, cl[v[j]] = v.size(), vi[v[j]] = 1 + s_cyc + j; s_cyc += l;
      |                                                                                                              ^~~~~
watchmen.cpp:76:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |   for(auto [v, i] : ch[d]){
      |            ^
watchmen.cpp:80:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   80 |     if(vis[v]) continue; vis[v] = true;
      |     ^~
watchmen.cpp:80:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   80 |     if(vis[v]) continue; vis[v] = true;
      |                          ^~~
watchmen.cpp:119:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  119 |     if(vis2[vi[v]][d % cl[v]]) continue; vis2[vi[v]][d % cl[v]] = true;
      |     ^~
watchmen.cpp:119:42: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  119 |     if(vis2[vi[v]][d % cl[v]]) continue; vis2[vi[v]][d % cl[v]] = true;
      |                                          ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 78272 KB Output is correct
2 Correct 79 ms 84892 KB Output is correct
3 Correct 77 ms 83784 KB Output is correct
4 Correct 113 ms 83348 KB Output is correct
5 Correct 44 ms 76632 KB Output is correct
6 Correct 71 ms 83532 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 78260 KB Output is correct
2 Correct 77 ms 84944 KB Output is correct
3 Correct 72 ms 83808 KB Output is correct
4 Correct 124 ms 83588 KB Output is correct
5 Correct 45 ms 76680 KB Output is correct
6 Correct 72 ms 83576 KB Output is correct
7 Correct 88 ms 83908 KB Output is correct
8 Correct 72 ms 83992 KB Output is correct
9 Correct 73 ms 84104 KB Output is correct
10 Correct 90 ms 83052 KB Output is correct
11 Correct 72 ms 82336 KB Output is correct
12 Correct 74 ms 83468 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 78260 KB Output is correct
2 Correct 77 ms 84944 KB Output is correct
3 Correct 72 ms 83808 KB Output is correct
4 Correct 124 ms 83588 KB Output is correct
5 Correct 45 ms 76680 KB Output is correct
6 Correct 72 ms 83576 KB Output is correct
7 Correct 88 ms 83908 KB Output is correct
8 Correct 72 ms 83992 KB Output is correct
9 Correct 73 ms 84104 KB Output is correct
10 Correct 90 ms 83052 KB Output is correct
11 Correct 72 ms 82336 KB Output is correct
12 Correct 74 ms 83468 KB Output is correct
13 Correct 91 ms 78268 KB Output is correct
14 Correct 98 ms 84948 KB Output is correct
15 Correct 88 ms 83864 KB Output is correct
16 Correct 116 ms 83344 KB Output is correct
17 Correct 40 ms 76756 KB Output is correct
18 Correct 73 ms 83528 KB Output is correct
19 Correct 77 ms 83868 KB Output is correct
20 Correct 96 ms 83892 KB Output is correct
21 Correct 85 ms 84316 KB Output is correct
22 Correct 81 ms 82904 KB Output is correct
23 Correct 72 ms 82324 KB Output is correct
24 Correct 72 ms 83536 KB Output is correct
25 Correct 756 ms 148356 KB Output is correct
26 Correct 725 ms 154388 KB Output is correct
27 Correct 719 ms 150444 KB Output is correct
28 Correct 649 ms 154756 KB Output is correct
29 Correct 1064 ms 141784 KB Output is correct
30 Correct 1296 ms 182972 KB Output is correct
31 Correct 810 ms 192728 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 78260 KB Output is correct
2 Correct 77 ms 84944 KB Output is correct
3 Correct 72 ms 83808 KB Output is correct
4 Correct 124 ms 83588 KB Output is correct
5 Correct 45 ms 76680 KB Output is correct
6 Correct 72 ms 83576 KB Output is correct
7 Correct 88 ms 83908 KB Output is correct
8 Correct 72 ms 83992 KB Output is correct
9 Correct 73 ms 84104 KB Output is correct
10 Correct 90 ms 83052 KB Output is correct
11 Correct 72 ms 82336 KB Output is correct
12 Correct 74 ms 83468 KB Output is correct
13 Correct 91 ms 78268 KB Output is correct
14 Correct 98 ms 84948 KB Output is correct
15 Correct 88 ms 83864 KB Output is correct
16 Correct 116 ms 83344 KB Output is correct
17 Correct 40 ms 76756 KB Output is correct
18 Correct 73 ms 83528 KB Output is correct
19 Correct 77 ms 83868 KB Output is correct
20 Correct 96 ms 83892 KB Output is correct
21 Correct 85 ms 84316 KB Output is correct
22 Correct 81 ms 82904 KB Output is correct
23 Correct 72 ms 82324 KB Output is correct
24 Correct 72 ms 83536 KB Output is correct
25 Correct 756 ms 148356 KB Output is correct
26 Correct 725 ms 154388 KB Output is correct
27 Correct 719 ms 150444 KB Output is correct
28 Correct 649 ms 154756 KB Output is correct
29 Correct 1064 ms 141784 KB Output is correct
30 Correct 1296 ms 182972 KB Output is correct
31 Correct 810 ms 192728 KB Output is correct
32 Correct 93 ms 78824 KB Output is correct
33 Correct 82 ms 86096 KB Output is correct
34 Correct 72 ms 84964 KB Output is correct
35 Correct 114 ms 84604 KB Output is correct
36 Correct 38 ms 76756 KB Output is correct
37 Correct 91 ms 84772 KB Output is correct
38 Correct 87 ms 85040 KB Output is correct
39 Correct 75 ms 85104 KB Output is correct
40 Correct 73 ms 85300 KB Output is correct
41 Correct 79 ms 84036 KB Output is correct
42 Correct 72 ms 83604 KB Output is correct
43 Correct 73 ms 84676 KB Output is correct
44 Correct 765 ms 186900 KB Output is correct
45 Correct 730 ms 192796 KB Output is correct
46 Correct 706 ms 189028 KB Output is correct
47 Correct 691 ms 193284 KB Output is correct
48 Correct 1065 ms 180444 KB Output is correct
49 Correct 1201 ms 183056 KB Output is correct
50 Correct 807 ms 192724 KB Output is correct
51 Correct 926 ms 214272 KB Output is correct
52 Correct 989 ms 238888 KB Output is correct
53 Correct 860 ms 217020 KB Output is correct
54 Correct 666 ms 191392 KB Output is correct
55 Execution timed out 6045 ms 190896 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 78272 KB Output is correct
2 Correct 79 ms 84892 KB Output is correct
3 Correct 77 ms 83784 KB Output is correct
4 Correct 113 ms 83348 KB Output is correct
5 Correct 44 ms 76632 KB Output is correct
6 Correct 71 ms 83532 KB Output is correct
7 Correct 90 ms 78260 KB Output is correct
8 Correct 77 ms 84944 KB Output is correct
9 Correct 72 ms 83808 KB Output is correct
10 Correct 124 ms 83588 KB Output is correct
11 Correct 45 ms 76680 KB Output is correct
12 Correct 72 ms 83576 KB Output is correct
13 Correct 88 ms 83908 KB Output is correct
14 Correct 72 ms 83992 KB Output is correct
15 Correct 73 ms 84104 KB Output is correct
16 Correct 90 ms 83052 KB Output is correct
17 Correct 72 ms 82336 KB Output is correct
18 Correct 74 ms 83468 KB Output is correct
19 Correct 37 ms 76372 KB Output is correct
20 Correct 38 ms 76340 KB Output is correct
21 Correct 38 ms 76340 KB Output is correct
22 Correct 98 ms 78224 KB Output is correct
23 Correct 75 ms 84936 KB Output is correct
24 Correct 76 ms 83836 KB Output is correct
25 Correct 113 ms 83412 KB Output is correct
26 Correct 38 ms 76756 KB Output is correct
27 Correct 75 ms 83604 KB Output is correct
28 Correct 74 ms 83868 KB Output is correct
29 Correct 75 ms 83904 KB Output is correct
30 Correct 75 ms 84208 KB Output is correct
31 Correct 79 ms 82924 KB Output is correct
32 Correct 69 ms 82440 KB Output is correct
33 Correct 75 ms 83524 KB Output is correct
34 Correct 846 ms 147480 KB Output is correct
35 Correct 821 ms 143500 KB Output is correct
36 Correct 839 ms 143332 KB Output is correct
37 Correct 721 ms 150108 KB Output is correct
38 Correct 757 ms 147436 KB Output is correct
39 Correct 995 ms 141140 KB Output is correct
40 Correct 1657 ms 142392 KB Output is correct
41 Correct 1114 ms 141548 KB Output is correct
42 Correct 798 ms 147292 KB Output is correct
43 Correct 825 ms 152104 KB Output is correct
44 Correct 804 ms 152088 KB Output is correct
45 Correct 819 ms 145180 KB Output is correct
46 Correct 749 ms 147192 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 78272 KB Output is correct
2 Correct 79 ms 84892 KB Output is correct
3 Correct 77 ms 83784 KB Output is correct
4 Correct 113 ms 83348 KB Output is correct
5 Correct 44 ms 76632 KB Output is correct
6 Correct 71 ms 83532 KB Output is correct
7 Correct 90 ms 78260 KB Output is correct
8 Correct 77 ms 84944 KB Output is correct
9 Correct 72 ms 83808 KB Output is correct
10 Correct 124 ms 83588 KB Output is correct
11 Correct 45 ms 76680 KB Output is correct
12 Correct 72 ms 83576 KB Output is correct
13 Correct 88 ms 83908 KB Output is correct
14 Correct 72 ms 83992 KB Output is correct
15 Correct 73 ms 84104 KB Output is correct
16 Correct 90 ms 83052 KB Output is correct
17 Correct 72 ms 82336 KB Output is correct
18 Correct 74 ms 83468 KB Output is correct
19 Correct 91 ms 78268 KB Output is correct
20 Correct 98 ms 84948 KB Output is correct
21 Correct 88 ms 83864 KB Output is correct
22 Correct 116 ms 83344 KB Output is correct
23 Correct 40 ms 76756 KB Output is correct
24 Correct 73 ms 83528 KB Output is correct
25 Correct 77 ms 83868 KB Output is correct
26 Correct 96 ms 83892 KB Output is correct
27 Correct 85 ms 84316 KB Output is correct
28 Correct 81 ms 82904 KB Output is correct
29 Correct 72 ms 82324 KB Output is correct
30 Correct 72 ms 83536 KB Output is correct
31 Correct 756 ms 148356 KB Output is correct
32 Correct 725 ms 154388 KB Output is correct
33 Correct 719 ms 150444 KB Output is correct
34 Correct 649 ms 154756 KB Output is correct
35 Correct 1064 ms 141784 KB Output is correct
36 Correct 1296 ms 182972 KB Output is correct
37 Correct 810 ms 192728 KB Output is correct
38 Correct 37 ms 76372 KB Output is correct
39 Correct 38 ms 76340 KB Output is correct
40 Correct 38 ms 76340 KB Output is correct
41 Correct 98 ms 78224 KB Output is correct
42 Correct 75 ms 84936 KB Output is correct
43 Correct 76 ms 83836 KB Output is correct
44 Correct 113 ms 83412 KB Output is correct
45 Correct 38 ms 76756 KB Output is correct
46 Correct 75 ms 83604 KB Output is correct
47 Correct 74 ms 83868 KB Output is correct
48 Correct 75 ms 83904 KB Output is correct
49 Correct 75 ms 84208 KB Output is correct
50 Correct 79 ms 82924 KB Output is correct
51 Correct 69 ms 82440 KB Output is correct
52 Correct 75 ms 83524 KB Output is correct
53 Correct 846 ms 147480 KB Output is correct
54 Correct 821 ms 143500 KB Output is correct
55 Correct 839 ms 143332 KB Output is correct
56 Correct 721 ms 150108 KB Output is correct
57 Correct 757 ms 147436 KB Output is correct
58 Correct 995 ms 141140 KB Output is correct
59 Correct 1657 ms 142392 KB Output is correct
60 Correct 1114 ms 141548 KB Output is correct
61 Correct 798 ms 147292 KB Output is correct
62 Correct 825 ms 152104 KB Output is correct
63 Correct 804 ms 152088 KB Output is correct
64 Correct 819 ms 145180 KB Output is correct
65 Correct 749 ms 147192 KB Output is correct
66 Correct 39 ms 76364 KB Output is correct
67 Correct 44 ms 76436 KB Output is correct
68 Correct 38 ms 76392 KB Output is correct
69 Correct 103 ms 78852 KB Output is correct
70 Correct 79 ms 86156 KB Output is correct
71 Correct 77 ms 84976 KB Output is correct
72 Correct 118 ms 84512 KB Output is correct
73 Correct 41 ms 76664 KB Output is correct
74 Correct 72 ms 84708 KB Output is correct
75 Correct 75 ms 85004 KB Output is correct
76 Correct 77 ms 85080 KB Output is correct
77 Correct 74 ms 85320 KB Output is correct
78 Correct 94 ms 84168 KB Output is correct
79 Correct 82 ms 83660 KB Output is correct
80 Correct 75 ms 84624 KB Output is correct
81 Correct 757 ms 186868 KB Output is correct
82 Correct 775 ms 192836 KB Output is correct
83 Correct 721 ms 189084 KB Output is correct
84 Correct 696 ms 193364 KB Output is correct
85 Correct 1116 ms 180576 KB Output is correct
86 Correct 1239 ms 182976 KB Output is correct
87 Correct 819 ms 192752 KB Output is correct
88 Correct 796 ms 185956 KB Output is correct
89 Correct 817 ms 181908 KB Output is correct
90 Correct 807 ms 181744 KB Output is correct
91 Correct 765 ms 188616 KB Output is correct
92 Correct 841 ms 186000 KB Output is correct
93 Correct 1002 ms 179920 KB Output is correct
94 Correct 1672 ms 180572 KB Output is correct
95 Correct 1130 ms 180020 KB Output is correct
96 Correct 772 ms 185856 KB Output is correct
97 Correct 850 ms 190492 KB Output is correct
98 Correct 826 ms 190572 KB Output is correct
99 Correct 820 ms 183728 KB Output is correct
100 Correct 847 ms 185732 KB Output is correct
101 Correct 885 ms 187836 KB Output is correct
102 Correct 750 ms 190624 KB Output is correct
103 Correct 787 ms 187968 KB Output is correct
104 Execution timed out 6084 ms 187788 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 78272 KB Output is correct
2 Correct 79 ms 84892 KB Output is correct
3 Correct 77 ms 83784 KB Output is correct
4 Correct 113 ms 83348 KB Output is correct
5 Correct 44 ms 76632 KB Output is correct
6 Correct 71 ms 83532 KB Output is correct
7 Correct 90 ms 78260 KB Output is correct
8 Correct 77 ms 84944 KB Output is correct
9 Correct 72 ms 83808 KB Output is correct
10 Correct 124 ms 83588 KB Output is correct
11 Correct 45 ms 76680 KB Output is correct
12 Correct 72 ms 83576 KB Output is correct
13 Correct 88 ms 83908 KB Output is correct
14 Correct 72 ms 83992 KB Output is correct
15 Correct 73 ms 84104 KB Output is correct
16 Correct 90 ms 83052 KB Output is correct
17 Correct 72 ms 82336 KB Output is correct
18 Correct 74 ms 83468 KB Output is correct
19 Correct 91 ms 78268 KB Output is correct
20 Correct 98 ms 84948 KB Output is correct
21 Correct 88 ms 83864 KB Output is correct
22 Correct 116 ms 83344 KB Output is correct
23 Correct 40 ms 76756 KB Output is correct
24 Correct 73 ms 83528 KB Output is correct
25 Correct 77 ms 83868 KB Output is correct
26 Correct 96 ms 83892 KB Output is correct
27 Correct 85 ms 84316 KB Output is correct
28 Correct 81 ms 82904 KB Output is correct
29 Correct 72 ms 82324 KB Output is correct
30 Correct 72 ms 83536 KB Output is correct
31 Correct 756 ms 148356 KB Output is correct
32 Correct 725 ms 154388 KB Output is correct
33 Correct 719 ms 150444 KB Output is correct
34 Correct 649 ms 154756 KB Output is correct
35 Correct 1064 ms 141784 KB Output is correct
36 Correct 1296 ms 182972 KB Output is correct
37 Correct 810 ms 192728 KB Output is correct
38 Correct 93 ms 78824 KB Output is correct
39 Correct 82 ms 86096 KB Output is correct
40 Correct 72 ms 84964 KB Output is correct
41 Correct 114 ms 84604 KB Output is correct
42 Correct 38 ms 76756 KB Output is correct
43 Correct 91 ms 84772 KB Output is correct
44 Correct 87 ms 85040 KB Output is correct
45 Correct 75 ms 85104 KB Output is correct
46 Correct 73 ms 85300 KB Output is correct
47 Correct 79 ms 84036 KB Output is correct
48 Correct 72 ms 83604 KB Output is correct
49 Correct 73 ms 84676 KB Output is correct
50 Correct 765 ms 186900 KB Output is correct
51 Correct 730 ms 192796 KB Output is correct
52 Correct 706 ms 189028 KB Output is correct
53 Correct 691 ms 193284 KB Output is correct
54 Correct 1065 ms 180444 KB Output is correct
55 Correct 1201 ms 183056 KB Output is correct
56 Correct 807 ms 192724 KB Output is correct
57 Correct 926 ms 214272 KB Output is correct
58 Correct 989 ms 238888 KB Output is correct
59 Correct 860 ms 217020 KB Output is correct
60 Correct 666 ms 191392 KB Output is correct
61 Execution timed out 6045 ms 190896 KB Time limit exceeded
62 Halted 0 ms 0 KB -