oj.uz

Submission #497067

# Submission time Handle Problem Language Result Execution time Memory
497067 2021-12-22T09:49:37 Z AQ0212 Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 5852 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <string>
#include <sstream>
#include <cstring>

#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

#define ll long long int
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(x) x.begin(), x.end()
 
using namespace std;
 
ll inf2 = 3e18;
 
ll x1[ 100111 ], x2[ 100111 ];
ll y11[ 100111 ], y2[ 100111 ], ans = inf2;
vector < ll > divv;
map < ll , ll > mp;
 
ll white_first(ll sz, ll n, ll m){
	ll sqrs = n / sz;
	ll cnt_move = (sqrs & 1) ? ((((sqrs >> 1) * ((sqrs >> 1) + 1)) << 1) * (sz * sz)) : (sqrs >> 1) * (sqrs) * (sz * sz);
	// cout << "w: " << cnt_move << " sz: " << sz << "\n";
 
	for(int i = 1; i <= m; i ++){
		if(x1[ i ] == x2[ i ] && y11[ i ] == y2[ i ]){
			if(((x1[ i ] + sz - 1) / sz) & 1)
				if(((y11[ i ] + sz - 1) / sz) & 1)
					cnt_move ++;
				else
					cnt_move --;
			else
				if(((y11[ i ] + sz - 1) / sz) & 1)
					cnt_move --;
				else
					cnt_move ++;
			continue;
		}
		for(int j = 1, j2 = 1; j <= n; j += sz, j2 ++){
 
			if(j <= x1[ i ] && x2[ i ] <= (j2 * sz)){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){
 
					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
 
					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * ((k2 * sz) - k + 1);
 
					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += (x2[ i ] - x1[ i ] + 1) * (y2[ i ] - k + 1);
						break;
					}
				}
 
			}else if(j <= x1[ i ] && x1[ i ] <= (j2 * sz) && (j2 * sz) <= x2[ i ]){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){
 
					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - y11[ i ] + 1);
 
					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * ((k2 * sz) - k + 1);
 
					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += ((j2 * sz) - x1[ i ] + 1) * (y2[ i ] - k + 1);
						break;
					}
				}
 
			}else if(x1[ i ] <= j && (j2 * sz) <= x2[ i ]){
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){
 
					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - y11[ i ] + 1);
 
					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * ((k2 * sz) - k + 1);
 
					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += ((j2 * sz) - j + 1) * (y2[ i ] - k + 1);
						break;
					}
				}
 
			}else{
				for(int k = 1, k2 = 1; k <= n; k += sz, k2 ++){
 
					if(k <= y11[ i ] && y2[ i ] <= (k2 * sz)){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - y11[ i ] + 1);
						break;
					}else if(k <= y11[ i ] && y11[ i ] <= (k2 * sz) && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - y11[ i ] + 1);
 
					}else if(y11[ i ] <= k && (k2 * sz) <= y2[ i ]){
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * ((k2 * sz) - k + 1);
 
					}else{
						if(j2 & 1)
							if(k2 & 1)
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
						else
							if(k2 & 1)
								cnt_move -= (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
							else
								cnt_move += (x2[ i ] - j + 1) * (y2[ i ] - k + 1);
						break;
					}
				}
 
			}
		}
	}
 
	return cnt_move;
}
 
int main(){
  	// ios_base::sync_with_stdio(false);
    // cin.tie(0); cout.tie(0);
  
	ll n, m;
 
	cin >> n >> m;
 
	for(int i = 1; i <= m; i ++){
		scanf("%lld%lld%lld%lld", &x1[ i ], &y11[ i ], &x2[ i ], &y2[ i ]);
	}
 
	divv.pb(1);
	for(int i = 2; i <= ((ll)ceil(sqrt(n))); i ++){
		if(n % i == 0 && !mp[ i ] && i != n){
			divv.pb(i);
			mp[ i ] ++;
			if(!mp[ n / i ]){
				divv.pb(n / i);
				mp[ n / i ] ++;
			}
		}
	}
 
	// sort(all(divv));
 
	for(int i = 0; i < divv.size(); i ++){
		ll white = white_first(divv[ i ], n, m);
		
		ans = min(ans, min((n * n) - white, white));
		// cout << white << " " << (n * n) - white << "\n";
	}
 
	cout << ans;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:308:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  308 |  for(int i = 0; i < divv.size(); i ++){
      |                 ~~^~~~~~~~~~~~~
chessboard.cpp:291:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  291 |   scanf("%lld%lld%lld%lld", &x1[ i ], &y11[ i ], &x2[ i ], &y2[ i ]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2224 KB Output is correct
2 Correct 10 ms 1056 KB Output is correct
3 Correct 15 ms 2456 KB Output is correct
4 Correct 20 ms 2488 KB Output is correct
5 Correct 19 ms 3236 KB Output is correct
6 Correct 12 ms 2116 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 13 ms 2096 KB Output is correct
9 Correct 32 ms 5108 KB Output is correct
10 Correct 17 ms 2996 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 296 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 9 ms 1536 KB Output is correct
17 Correct 27 ms 4272 KB Output is correct
18 Correct 48 ms 4932 KB Output is correct
19 Correct 78 ms 4384 KB Output is correct
20 Correct 71 ms 5040 KB Output is correct
21 Correct 24 ms 4028 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 19 ms 2304 KB Output is correct
24 Correct 32 ms 4480 KB Output is correct
25 Correct 5 ms 716 KB Output is correct
26 Correct 23 ms 2872 KB Output is correct
27 Correct 23 ms 3524 KB Output is correct
28 Correct 30 ms 4696 KB Output is correct
29 Correct 10 ms 1848 KB Output is correct
30 Correct 2 ms 436 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2224 KB Output is correct
2 Correct 10 ms 1056 KB Output is correct
3 Correct 15 ms 2456 KB Output is correct
4 Correct 20 ms 2488 KB Output is correct
5 Correct 19 ms 3236 KB Output is correct
6 Correct 12 ms 2116 KB Output is correct
7 Correct 3 ms 692 KB Output is correct
8 Correct 13 ms 2096 KB Output is correct
9 Correct 32 ms 5108 KB Output is correct
10 Correct 17 ms 2996 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 300 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 296 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 308 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 9 ms 1536 KB Output is correct
27 Correct 27 ms 4272 KB Output is correct
28 Correct 48 ms 4932 KB Output is correct
29 Correct 78 ms 4384 KB Output is correct
30 Correct 71 ms 5040 KB Output is correct
31 Correct 24 ms 4028 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 19 ms 2304 KB Output is correct
34 Correct 32 ms 4480 KB Output is correct
35 Correct 5 ms 716 KB Output is correct
36 Correct 23 ms 2872 KB Output is correct
37 Correct 23 ms 3524 KB Output is correct
38 Correct 30 ms 4696 KB Output is correct
39 Correct 10 ms 1848 KB Output is correct
40 Correct 2 ms 436 KB Output is correct
41 Correct 71 ms 4860 KB Output is correct
42 Correct 38 ms 5456 KB Output is correct
43 Correct 48 ms 4808 KB Output is correct
44 Correct 47 ms 5236 KB Output is correct
45 Correct 38 ms 5620 KB Output is correct
46 Correct 73 ms 5316 KB Output is correct
47 Correct 29 ms 5028 KB Output is correct
48 Correct 49 ms 4996 KB Output is correct
49 Correct 40 ms 4828 KB Output is correct
50 Correct 240 ms 5188 KB Output is correct
51 Correct 272 ms 5544 KB Output is correct
52 Correct 235 ms 5296 KB Output is correct
53 Correct 283 ms 5656 KB Output is correct
54 Correct 247 ms 5196 KB Output is correct
55 Correct 267 ms 5852 KB Output is correct
56 Correct 230 ms 5108 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 19 ms 2224 KB Output is correct
10 Correct 10 ms 1056 KB Output is correct
11 Correct 15 ms 2456 KB Output is correct
12 Correct 20 ms 2488 KB Output is correct
13 Correct 19 ms 3236 KB Output is correct
14 Correct 12 ms 2116 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 13 ms 2096 KB Output is correct
17 Correct 32 ms 5108 KB Output is correct
18 Correct 17 ms 2996 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 304 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 9 ms 1536 KB Output is correct
35 Correct 27 ms 4272 KB Output is correct
36 Correct 48 ms 4932 KB Output is correct
37 Correct 78 ms 4384 KB Output is correct
38 Correct 71 ms 5040 KB Output is correct
39 Correct 24 ms 4028 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 19 ms 2304 KB Output is correct
42 Correct 32 ms 4480 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 23 ms 2872 KB Output is correct
45 Correct 23 ms 3524 KB Output is correct
46 Correct 30 ms 4696 KB Output is correct
47 Correct 10 ms 1848 KB Output is correct
48 Correct 2 ms 436 KB Output is correct
49 Correct 71 ms 4860 KB Output is correct
50 Correct 38 ms 5456 KB Output is correct
51 Correct 48 ms 4808 KB Output is correct
52 Correct 47 ms 5236 KB Output is correct
53 Correct 38 ms 5620 KB Output is correct
54 Correct 73 ms 5316 KB Output is correct
55 Correct 29 ms 5028 KB Output is correct
56 Correct 49 ms 4996 KB Output is correct
57 Correct 40 ms 4828 KB Output is correct
58 Correct 240 ms 5188 KB Output is correct
59 Correct 272 ms 5544 KB Output is correct
60 Correct 235 ms 5296 KB Output is correct
61 Correct 283 ms 5656 KB Output is correct
62 Correct 247 ms 5196 KB Output is correct
63 Correct 267 ms 5852 KB Output is correct
64 Correct 230 ms 5108 KB Output is correct
65 Correct 1 ms 280 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Execution timed out 2041 ms 5412 KB Time limit exceeded
68 Halted 0 ms 0 KB -