oj.uz

답안 #387302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387302 2021-04-08T08:55:43 Z milleniumEeee 벽 칠하기 (APIO20_paint) C++17
28 / 100
 1500 ms 524292 KB 
#include <bits/stdc++.h>
#include "paint.h"
//#include "grader.cpp"
#define all(s) s.begin(), s.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
 
const int MAXN = (int)1e5 + 5;
const int INF = 1e9 + 7;
 
int pos[MAXN];
int dp[MAXN];
int pref[MAXN];
 
struct Segment_Tree {
	vector <int> tree;
	vector <int> lazy;
	Segment_Tree (int n) {
		tree.resize(n * 4, INF);
		lazy.resize(n * 4, INF);
	}
	void push(int v, int tl, int tr) {
		if (lazy[v] == INF) {
			return;
		}
		if (tl != tr) {
			chkmin(lazy[v + v], lazy[v]);
			chkmin(lazy[v + v + 1], lazy[v]);
		}
		chkmin(tree[v], lazy[v]);
		lazy[v] = INF;
	}
	void upd(int l, int r, int val, int v, int tl, int tr) {
		push(v, tl, tr);
		if (l > tr || tl > r) {
			return;
		}
		if (l <= tl && tr <= r) {
			lazy[v] = val;
			push(v, tl, tr);
			return;
		}
		int mid = (tl + tr) >> 1;
		upd(l, r, val, v + v, tl, mid);
		upd(l, r, val, v + v + 1, mid + 1, tr);
		tree[v] = min(tree[v + v], tree[v + v + 1]);
	}
	int get(int l, int r, int v, int tl, int tr) {
		push(v, tl, tr);
		if (l > tr || tl > r) {
			return INF;
		}
		if (l <= tl && tr <= r) {
			return tree[v];
		}
		int mid = (tl + tr) >> 1;
		return min(get(l, r, v + v, tl, mid), get(l, r, v + v + 1, mid + 1, tr));
	}
};
 
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
	memset(pos, -1, sizeof(pos));
	bool subtask1 = true;
	for (int i = 0; i < M; i++) {
		for (int el : B[i]) {
			if (pos[el] != -1) {
				subtask1 = false;
			}
			pos[el] = i;
		}
	}
	for (int i = 0; i < N; i++) {
		if (pos[C[i]] == -1) {
			return -1;
		}
	}
	auto nxt = [&](int p) {
		if (p + 1 < M) {
			return p + 1;
		} else {
			return 0;
		}
	};
	for (int i = 0; i + 1 < N; i++) {
		int before = (i > 0 ? pref[i - 1] : 0);
		pref[i] = before + (pos[C[i + 1]] == nxt(pos[C[i]]));
	}
	auto get = [&](int l, int r) {
		return pref[r - 1] - pref[l - 1];
	};
	
	
	bool subtask3 = (N <= 20000 && M <= min(N, 2000));
	subtask3 = false; // wtf
	
	vector <vector<int>> Q;
	vector <int> MAXQ;
	Q.resize(N + 1);
	MAXQ.resize(N + 1);
	for (auto &el : Q) {
		el.resize(M, 0);
	}
	auto exist = [&](vector <int> &vec, int color) {
		return binary_search(all(vec), color);
	};
	
	for (int i = N - 1; i >= 0; i--) {
		MAXQ[i] = 0;
		for (int j = 0; j < M; j++) {
			if (exist(B[j], C[i])) {
				int add = 0;
				if (j + 1 < N) {
					add = Q[i + 1][(j + 1) % M];
				}
				Q[i][j] = 1 + add;
			} else {
				Q[i][j] = 0;
			}
			MAXQ[i] = max(MAXQ[i], Q[i][j]);
		}
	}
	
	auto can = [&](int l, int r) {
		if (subtask3) {
			return l + MAXQ[l] - 1 >= r;
		}
		if (subtask1) {
			if (r - l + 1 == M && get(l, r) == M - 1) {
				return true;
			} else {
				return false;
			}			
		} else {
			for (int x = 0; x < M; x++) {
				bool ok = 1;
				int step = 0;
				int pos = x;
				while (1) {
					ok &= (binary_search(all(B[pos]), C[l + step]));
					step++;
					pos = nxt(pos);
					if (step == M) {
						break;
					}
				}
				if (ok) {
					return true;
				}
			}
			return false;
		}
	};
	fill(dp, dp + MAXN, INF);
	Segment_Tree T(N);
	if (can(0, M - 1)) {
		T.upd(0, M - 1, 1, 1, 0, N - 1);
	}
	for (int i = M; i < N; i++) {
		if (can(i - M + 1, i)) {
			int best = T.get(i - M, i - 1, 1, 0, N - 1);
			T.upd(i - M + 1, i, best + 1, 1, 0, N - 1);
		}
	}
	if (T.get(N - 1, N - 1, 1, 0, N - 1) < INF) {
		return T.get(N - 1, N - 1, 1, 0, N - 1);
	} else {
		return -1;
	}
}
 
/*
5 3 10
0 2 1 4 3
2 0 4
2 3 2
1 1
*/

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:90:34: warning: array subscript -1 is below array bounds of 'int [100005]' [-Warray-bounds]
   90 |   return pref[r - 1] - pref[l - 1];
      |                        ~~~~~~~~~~^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 3 ms 1516 KB Output is correct
14 Correct 3 ms 1516 KB Output is correct
15 Correct 3 ms 1516 KB Output is correct
16 Correct 3 ms 1516 KB Output is correct
17 Correct 3 ms 1516 KB Output is correct
18 Correct 4 ms 1516 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 1 ms 748 KB Output is correct
21 Correct 1 ms 748 KB Output is correct
22 Correct 20 ms 2924 KB Output is correct
23 Correct 20 ms 2924 KB Output is correct
24 Correct 20 ms 2924 KB Output is correct
25 Correct 13 ms 3180 KB Output is correct
26 Correct 14 ms 3180 KB Output is correct
27 Correct 15 ms 3180 KB Output is correct
28 Correct 7 ms 3180 KB Output is correct
29 Correct 7 ms 3180 KB Output is correct
30 Correct 7 ms 3180 KB Output is correct
31 Correct 813 ms 160060 KB Output is correct
32 Correct 813 ms 159984 KB Output is correct
33 Correct 816 ms 160108 KB Output is correct
34 Correct 811 ms 159984 KB Output is correct
35 Correct 803 ms 159852 KB Output is correct
36 Correct 811 ms 159852 KB Output is correct
37 Correct 1254 ms 161132 KB Output is correct
38 Correct 1251 ms 161096 KB Output is correct
39 Correct 1255 ms 161132 KB Output is correct
40 Correct 68 ms 10476 KB Output is correct
41 Correct 47 ms 7020 KB Output is correct
42 Correct 49 ms 11372 KB Output is correct
43 Correct 21 ms 7916 KB Output is correct
44 Correct 18 ms 7276 KB Output is correct
45 Correct 39 ms 11500 KB Output is correct
46 Runtime error 331 ms 524292 KB Execution killed with signal 9
47 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 2 ms 1132 KB Output is correct
8 Correct 2 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 3 ms 1516 KB Output is correct
14 Correct 3 ms 1516 KB Output is correct
15 Correct 3 ms 1516 KB Output is correct
16 Correct 3 ms 1516 KB Output is correct
17 Correct 3 ms 1516 KB Output is correct
18 Correct 4 ms 1516 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 1 ms 748 KB Output is correct
21 Correct 1 ms 748 KB Output is correct
22 Correct 2 ms 1132 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 2 ms 1132 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 2 ms 1132 KB Output is correct
27 Correct 2 ms 1132 KB Output is correct
28 Correct 2 ms 1132 KB Output is correct
29 Correct 4 ms 1132 KB Output is correct
30 Correct 5 ms 1132 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 9 ms 1260 KB Output is correct
33 Correct 48 ms 1388 KB Output is correct
34 Correct 58 ms 1408 KB Output is correct
35 Correct 22 ms 1260 KB Output is correct
36 Correct 41 ms 1388 KB Output is correct
37 Correct 35 ms 1388 KB Output is correct
38 Correct 1 ms 748 KB Output is correct
39 Correct 2 ms 1136 KB Output is correct
40 Correct 2 ms 876 KB Output is correct
41 Correct 31 ms 1388 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 14 ms 1260 KB Output is correct
44 Correct 2 ms 1132 KB Output is correct
45 Correct 2 ms 1260 KB Output is correct
46 Correct 9 ms 1260 KB Output is correct
47 Correct 17 ms 1260 KB Output is correct
48 Correct 21 ms 1260 KB Output is correct
49 Correct 25 ms 1260 KB Output is correct
50 Correct 108 ms 1516 KB Output is correct
51 Correct 89 ms 1644 KB Output is correct
52 Correct 86 ms 1516 KB Output is correct
53 Correct 110 ms 1516 KB Output is correct
54 Correct 92 ms 1644 KB Output is correct
55 Correct 88 ms 1516 KB Output is correct
56 Correct 2 ms 748 KB Output is correct
57 Correct 82 ms 1644 KB Output is correct
58 Correct 2 ms 748 KB Output is correct
59 Correct 97 ms 1516 KB Output is correct
60 Correct 2 ms 748 KB Output is correct
61 Correct 105 ms 1516 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 3 ms 1516 KB Output is correct
16 Correct 3 ms 1516 KB Output is correct
17 Correct 3 ms 1516 KB Output is correct
18 Correct 3 ms 1516 KB Output is correct
19 Correct 3 ms 1516 KB Output is correct
20 Correct 4 ms 1516 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 1 ms 748 KB Output is correct
23 Correct 1 ms 748 KB Output is correct
24 Correct 20 ms 2924 KB Output is correct
25 Correct 20 ms 2924 KB Output is correct
26 Correct 20 ms 2924 KB Output is correct
27 Correct 2 ms 1132 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 2 ms 1132 KB Output is correct
30 Correct 2 ms 1132 KB Output is correct
31 Correct 2 ms 1132 KB Output is correct
32 Correct 4 ms 1132 KB Output is correct
33 Correct 5 ms 1132 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 9 ms 1260 KB Output is correct
36 Correct 48 ms 1388 KB Output is correct
37 Correct 58 ms 1408 KB Output is correct
38 Correct 22 ms 1260 KB Output is correct
39 Correct 41 ms 1388 KB Output is correct
40 Correct 35 ms 1388 KB Output is correct
41 Correct 1 ms 748 KB Output is correct
42 Correct 2 ms 1136 KB Output is correct
43 Correct 2 ms 876 KB Output is correct
44 Correct 31 ms 1388 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 14 ms 1260 KB Output is correct
47 Correct 2 ms 1132 KB Output is correct
48 Correct 2 ms 1260 KB Output is correct
49 Correct 9 ms 1260 KB Output is correct
50 Correct 17 ms 1260 KB Output is correct
51 Correct 21 ms 1260 KB Output is correct
52 Correct 25 ms 1260 KB Output is correct
53 Correct 108 ms 1516 KB Output is correct
54 Correct 89 ms 1644 KB Output is correct
55 Correct 86 ms 1516 KB Output is correct
56 Correct 110 ms 1516 KB Output is correct
57 Correct 92 ms 1644 KB Output is correct
58 Correct 88 ms 1516 KB Output is correct
59 Correct 2 ms 748 KB Output is correct
60 Correct 82 ms 1644 KB Output is correct
61 Correct 2 ms 748 KB Output is correct
62 Correct 97 ms 1516 KB Output is correct
63 Correct 2 ms 748 KB Output is correct
64 Correct 105 ms 1516 KB Output is correct
65 Correct 2 ms 1260 KB Output is correct
66 Correct 2 ms 1260 KB Output is correct
67 Correct 3 ms 1388 KB Output is correct
68 Correct 3 ms 1260 KB Output is correct
69 Correct 4 ms 1388 KB Output is correct
70 Correct 91 ms 1772 KB Output is correct
71 Correct 50 ms 1516 KB Output is correct
72 Correct 11 ms 1388 KB Output is correct
73 Correct 3 ms 1260 KB Output is correct
74 Correct 14 ms 1388 KB Output is correct
75 Correct 75 ms 1516 KB Output is correct
76 Correct 16 ms 2284 KB Output is correct
77 Correct 16 ms 2412 KB Output is correct
78 Correct 30 ms 2668 KB Output is correct
79 Correct 4 ms 1516 KB Output is correct
80 Correct 4 ms 1516 KB Output is correct
81 Correct 4 ms 1516 KB Output is correct
82 Correct 4 ms 1516 KB Output is correct
83 Correct 4 ms 1516 KB Output is correct
84 Correct 82 ms 1772 KB Output is correct
85 Correct 124 ms 1800 KB Output is correct
86 Correct 98 ms 1772 KB Output is correct
87 Correct 98 ms 1800 KB Output is correct
88 Correct 70 ms 1800 KB Output is correct
89 Correct 92 ms 1772 KB Output is correct
90 Correct 23 ms 2796 KB Output is correct
91 Correct 21 ms 2924 KB Output is correct
92 Correct 22 ms 2796 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 3 ms 1516 KB Output is correct
16 Correct 3 ms 1516 KB Output is correct
17 Correct 3 ms 1516 KB Output is correct
18 Correct 3 ms 1516 KB Output is correct
19 Correct 3 ms 1516 KB Output is correct
20 Correct 4 ms 1516 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 1 ms 748 KB Output is correct
23 Correct 1 ms 748 KB Output is correct
24 Correct 20 ms 2924 KB Output is correct
25 Correct 20 ms 2924 KB Output is correct
26 Correct 20 ms 2924 KB Output is correct
27 Correct 13 ms 3180 KB Output is correct
28 Correct 14 ms 3180 KB Output is correct
29 Correct 15 ms 3180 KB Output is correct
30 Correct 7 ms 3180 KB Output is correct
31 Correct 7 ms 3180 KB Output is correct
32 Correct 7 ms 3180 KB Output is correct
33 Correct 813 ms 160060 KB Output is correct
34 Correct 813 ms 159984 KB Output is correct
35 Correct 816 ms 160108 KB Output is correct
36 Correct 811 ms 159984 KB Output is correct
37 Correct 803 ms 159852 KB Output is correct
38 Correct 811 ms 159852 KB Output is correct
39 Correct 1254 ms 161132 KB Output is correct
40 Correct 1251 ms 161096 KB Output is correct
41 Correct 1255 ms 161132 KB Output is correct
42 Correct 2 ms 1132 KB Output is correct
43 Correct 2 ms 748 KB Output is correct
44 Correct 2 ms 1132 KB Output is correct
45 Correct 2 ms 1132 KB Output is correct
46 Correct 2 ms 1132 KB Output is correct
47 Correct 4 ms 1132 KB Output is correct
48 Correct 5 ms 1132 KB Output is correct
49 Correct 2 ms 1132 KB Output is correct
50 Correct 9 ms 1260 KB Output is correct
51 Correct 48 ms 1388 KB Output is correct
52 Correct 58 ms 1408 KB Output is correct
53 Correct 22 ms 1260 KB Output is correct
54 Correct 41 ms 1388 KB Output is correct
55 Correct 35 ms 1388 KB Output is correct
56 Correct 1 ms 748 KB Output is correct
57 Correct 2 ms 1136 KB Output is correct
58 Correct 2 ms 876 KB Output is correct
59 Correct 31 ms 1388 KB Output is correct
60 Correct 2 ms 748 KB Output is correct
61 Correct 14 ms 1260 KB Output is correct
62 Correct 2 ms 1132 KB Output is correct
63 Correct 2 ms 1260 KB Output is correct
64 Correct 9 ms 1260 KB Output is correct
65 Correct 17 ms 1260 KB Output is correct
66 Correct 21 ms 1260 KB Output is correct
67 Correct 25 ms 1260 KB Output is correct
68 Correct 108 ms 1516 KB Output is correct
69 Correct 89 ms 1644 KB Output is correct
70 Correct 86 ms 1516 KB Output is correct
71 Correct 110 ms 1516 KB Output is correct
72 Correct 92 ms 1644 KB Output is correct
73 Correct 88 ms 1516 KB Output is correct
74 Correct 2 ms 748 KB Output is correct
75 Correct 82 ms 1644 KB Output is correct
76 Correct 2 ms 748 KB Output is correct
77 Correct 97 ms 1516 KB Output is correct
78 Correct 2 ms 748 KB Output is correct
79 Correct 105 ms 1516 KB Output is correct
80 Correct 2 ms 1260 KB Output is correct
81 Correct 2 ms 1260 KB Output is correct
82 Correct 3 ms 1388 KB Output is correct
83 Correct 3 ms 1260 KB Output is correct
84 Correct 4 ms 1388 KB Output is correct
85 Correct 91 ms 1772 KB Output is correct
86 Correct 50 ms 1516 KB Output is correct
87 Correct 11 ms 1388 KB Output is correct
88 Correct 3 ms 1260 KB Output is correct
89 Correct 14 ms 1388 KB Output is correct
90 Correct 75 ms 1516 KB Output is correct
91 Correct 16 ms 2284 KB Output is correct
92 Correct 16 ms 2412 KB Output is correct
93 Correct 30 ms 2668 KB Output is correct
94 Correct 4 ms 1516 KB Output is correct
95 Correct 4 ms 1516 KB Output is correct
96 Correct 4 ms 1516 KB Output is correct
97 Correct 4 ms 1516 KB Output is correct
98 Correct 4 ms 1516 KB Output is correct
99 Correct 82 ms 1772 KB Output is correct
100 Correct 124 ms 1800 KB Output is correct
101 Correct 98 ms 1772 KB Output is correct
102 Correct 98 ms 1800 KB Output is correct
103 Correct 70 ms 1800 KB Output is correct
104 Correct 92 ms 1772 KB Output is correct
105 Correct 23 ms 2796 KB Output is correct
106 Correct 21 ms 2924 KB Output is correct
107 Correct 22 ms 2796 KB Output is correct
108 Correct 20 ms 3200 KB Output is correct
109 Correct 146 ms 37484 KB Output is correct
110 Execution timed out 1590 ms 33260 KB Time limit exceeded
111 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1132 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 1 ms 1132 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1132 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 3 ms 1516 KB Output is correct
16 Correct 3 ms 1516 KB Output is correct
17 Correct 3 ms 1516 KB Output is correct
18 Correct 3 ms 1516 KB Output is correct
19 Correct 3 ms 1516 KB Output is correct
20 Correct 4 ms 1516 KB Output is correct
21 Correct 2 ms 748 KB Output is correct
22 Correct 1 ms 748 KB Output is correct
23 Correct 1 ms 748 KB Output is correct
24 Correct 20 ms 2924 KB Output is correct
25 Correct 20 ms 2924 KB Output is correct
26 Correct 20 ms 2924 KB Output is correct
27 Correct 13 ms 3180 KB Output is correct
28 Correct 14 ms 3180 KB Output is correct
29 Correct 15 ms 3180 KB Output is correct
30 Correct 7 ms 3180 KB Output is correct
31 Correct 7 ms 3180 KB Output is correct
32 Correct 7 ms 3180 KB Output is correct
33 Correct 813 ms 160060 KB Output is correct
34 Correct 813 ms 159984 KB Output is correct
35 Correct 816 ms 160108 KB Output is correct
36 Correct 811 ms 159984 KB Output is correct
37 Correct 803 ms 159852 KB Output is correct
38 Correct 811 ms 159852 KB Output is correct
39 Correct 1254 ms 161132 KB Output is correct
40 Correct 1251 ms 161096 KB Output is correct
41 Correct 1255 ms 161132 KB Output is correct
42 Correct 68 ms 10476 KB Output is correct
43 Correct 47 ms 7020 KB Output is correct
44 Correct 49 ms 11372 KB Output is correct
45 Correct 21 ms 7916 KB Output is correct
46 Correct 18 ms 7276 KB Output is correct
47 Correct 39 ms 11500 KB Output is correct
48 Runtime error 331 ms 524292 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -