oj.uz

Submission #305614

# Submission time Handle Problem Language Result Execution time Memory
305614 2020-09-23T17:15:16 Z AmineWeslati Painting Walls (APIO20_paint) C++14
51 / 100
 1012 ms 54428 KB 
//Never stop trying
#include "paint.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

int N,M,K;
vi c(MX);
//unordered_set <int> s[MX];
//bitset<2005> bs[20005];

bool bs[2005][20005];

//vi f(MX,0);

bitset<MX> pos;


void check(){
	FOR(j,0,M){
		bool mismatch[N]; FOR(i,0,N) mismatch[i]=false;
		int nb=0;
		FOR(i,0,N){
			//if(s[(i+j)%M].count(c[i])==0) mismatch[i]=true,nb++;
			if(bs[(i+j)%M][c[i]]==0) mismatch[i]=true,nb++;
			if(i>=M-1){
				if(nb==0) pos[i-M+1]=true;
				if(mismatch[i-M+1]==true) nb--;
			}
			
		}
	}
}

int minimumInstructions(int NN, int MM, int KK, vi CC, vi AA, V<vi>B){
	N=NN; M=MM; K=KK;
	FOR(i,0,N) c[i]=CC[i];

	unordered_map<int,int> mp; int cnt=0;
	FOR(i,0,N){
		if(!mp.count(c[i])) mp[c[i]]=cnt++;
		c[i]=mp[c[i]];
	}
	assert(cnt<=N);

	FOR(i,0,M){
		FOR(j,0,AA[i]){
			int x=B[i][j];
			if(mp.count(x)==false) continue;
			x=mp[x];
			bs[i][x]=1;
			//s[i].insert(x),f[B[i][j]]++;
		}
	}

	check();
	if(!pos[0]) return -1;

	ll ans=0;
	for(int i=0; i<N; ){
		if(pos[i]){
			i+=M;
			ans++;
		}
		else{
			int j=i; bool y=false;
			while(j>i-M){
				if(pos[j]){y=true; break;}
				j--;
			}
			if(!y) return -1;
			ans++;
			i=j+M;
		}
	}
	assert(ans<=N-M+1);
	return ans;
}


/*
8 3 5 
3 3 1 3 4 4 2 2
3 2 2 
0 1 2	
2 3
3 4

3
*/


/*
5 4 4 
1 0 1 2 2
2 1 1 1 
0 1
1 
2 
3

*/

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

paint.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
paint.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
paint.cpp: In function 'void IO()':
paint.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
paint.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 2 ms 1664 KB Output is correct
14 Correct 3 ms 1664 KB Output is correct
15 Correct 2 ms 1536 KB Output is correct
16 Correct 2 ms 1536 KB Output is correct
17 Correct 2 ms 1664 KB Output is correct
18 Correct 2 ms 1664 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 18 ms 2304 KB Output is correct
23 Correct 18 ms 2304 KB Output is correct
24 Correct 18 ms 2304 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 3 ms 896 KB Output is correct
27 Correct 4 ms 896 KB Output is correct
28 Correct 5 ms 896 KB Output is correct
29 Correct 4 ms 896 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 634 ms 41260 KB Output is correct
32 Correct 619 ms 41216 KB Output is correct
33 Correct 637 ms 41336 KB Output is correct
34 Correct 663 ms 41336 KB Output is correct
35 Correct 635 ms 41208 KB Output is correct
36 Correct 636 ms 41312 KB Output is correct
37 Correct 724 ms 35320 KB Output is correct
38 Correct 753 ms 35328 KB Output is correct
39 Correct 779 ms 35576 KB Output is correct
40 Correct 11 ms 1536 KB Output is correct
41 Correct 7 ms 1280 KB Output is correct
42 Correct 17 ms 1536 KB Output is correct
43 Correct 12 ms 1280 KB Output is correct
44 Correct 11 ms 1280 KB Output is correct
45 Correct 19 ms 1664 KB Output is correct
46 Runtime error 137 ms 54428 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 2 ms 1664 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 1 ms 768 KB Output is correct
26 Correct 1 ms 768 KB Output is correct
27 Correct 1 ms 768 KB Output is correct
28 Correct 1 ms 896 KB Output is correct
29 Correct 1 ms 896 KB Output is correct
30 Correct 1 ms 896 KB Output is correct
31 Correct 1 ms 768 KB Output is correct
32 Correct 1 ms 896 KB Output is correct
33 Correct 2 ms 1408 KB Output is correct
34 Correct 2 ms 1408 KB Output is correct
35 Correct 1 ms 1280 KB Output is correct
36 Correct 2 ms 1408 KB Output is correct
37 Correct 2 ms 1536 KB Output is correct
38 Correct 1 ms 768 KB Output is correct
39 Correct 1 ms 768 KB Output is correct
40 Correct 1 ms 768 KB Output is correct
41 Correct 2 ms 1408 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 1024 KB Output is correct
44 Correct 1 ms 768 KB Output is correct
45 Correct 1 ms 896 KB Output is correct
46 Correct 1 ms 896 KB Output is correct
47 Correct 1 ms 896 KB Output is correct
48 Correct 1 ms 896 KB Output is correct
49 Correct 1 ms 1024 KB Output is correct
50 Correct 3 ms 1664 KB Output is correct
51 Correct 2 ms 1664 KB Output is correct
52 Correct 2 ms 1664 KB Output is correct
53 Correct 2 ms 1664 KB Output is correct
54 Correct 3 ms 1664 KB Output is correct
55 Correct 2 ms 1664 KB Output is correct
56 Correct 2 ms 768 KB Output is correct
57 Correct 2 ms 1536 KB Output is correct
58 Correct 2 ms 768 KB Output is correct
59 Correct 2 ms 1536 KB Output is correct
60 Correct 2 ms 768 KB Output is correct
61 Correct 2 ms 1536 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 2 ms 1664 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 18 ms 2304 KB Output is correct
25 Correct 18 ms 2304 KB Output is correct
26 Correct 18 ms 2304 KB Output is correct
27 Correct 1 ms 768 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 1 ms 768 KB Output is correct
30 Correct 1 ms 768 KB Output is correct
31 Correct 1 ms 896 KB Output is correct
32 Correct 1 ms 896 KB Output is correct
33 Correct 1 ms 896 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 2 ms 1408 KB Output is correct
37 Correct 2 ms 1408 KB Output is correct
38 Correct 1 ms 1280 KB Output is correct
39 Correct 2 ms 1408 KB Output is correct
40 Correct 2 ms 1536 KB Output is correct
41 Correct 1 ms 768 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 768 KB Output is correct
44 Correct 2 ms 1408 KB Output is correct
45 Correct 1 ms 768 KB Output is correct
46 Correct 1 ms 1024 KB Output is correct
47 Correct 1 ms 768 KB Output is correct
48 Correct 1 ms 896 KB Output is correct
49 Correct 1 ms 896 KB Output is correct
50 Correct 1 ms 896 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 1 ms 1024 KB Output is correct
53 Correct 3 ms 1664 KB Output is correct
54 Correct 2 ms 1664 KB Output is correct
55 Correct 2 ms 1664 KB Output is correct
56 Correct 2 ms 1664 KB Output is correct
57 Correct 3 ms 1664 KB Output is correct
58 Correct 2 ms 1664 KB Output is correct
59 Correct 2 ms 768 KB Output is correct
60 Correct 2 ms 1536 KB Output is correct
61 Correct 2 ms 768 KB Output is correct
62 Correct 2 ms 1536 KB Output is correct
63 Correct 2 ms 768 KB Output is correct
64 Correct 2 ms 1536 KB Output is correct
65 Correct 1 ms 1536 KB Output is correct
66 Correct 1 ms 896 KB Output is correct
67 Correct 2 ms 1280 KB Output is correct
68 Correct 1 ms 1024 KB Output is correct
69 Correct 2 ms 1152 KB Output is correct
70 Correct 4 ms 1664 KB Output is correct
71 Correct 4 ms 1536 KB Output is correct
72 Correct 3 ms 1152 KB Output is correct
73 Correct 2 ms 896 KB Output is correct
74 Correct 3 ms 1280 KB Output is correct
75 Correct 4 ms 1664 KB Output is correct
76 Correct 18 ms 2048 KB Output is correct
77 Correct 20 ms 1664 KB Output is correct
78 Correct 23 ms 2040 KB Output is correct
79 Correct 2 ms 1536 KB Output is correct
80 Correct 2 ms 1536 KB Output is correct
81 Correct 2 ms 1536 KB Output is correct
82 Correct 2 ms 1536 KB Output is correct
83 Correct 2 ms 1536 KB Output is correct
84 Correct 5 ms 1792 KB Output is correct
85 Correct 6 ms 1792 KB Output is correct
86 Correct 5 ms 1792 KB Output is correct
87 Correct 5 ms 1792 KB Output is correct
88 Correct 5 ms 1792 KB Output is correct
89 Correct 5 ms 1792 KB Output is correct
90 Correct 26 ms 2808 KB Output is correct
91 Correct 26 ms 2808 KB Output is correct
92 Correct 26 ms 2816 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 2 ms 1664 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 18 ms 2304 KB Output is correct
25 Correct 18 ms 2304 KB Output is correct
26 Correct 18 ms 2304 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 896 KB Output is correct
30 Correct 5 ms 896 KB Output is correct
31 Correct 4 ms 896 KB Output is correct
32 Correct 4 ms 896 KB Output is correct
33 Correct 634 ms 41260 KB Output is correct
34 Correct 619 ms 41216 KB Output is correct
35 Correct 637 ms 41336 KB Output is correct
36 Correct 663 ms 41336 KB Output is correct
37 Correct 635 ms 41208 KB Output is correct
38 Correct 636 ms 41312 KB Output is correct
39 Correct 724 ms 35320 KB Output is correct
40 Correct 753 ms 35328 KB Output is correct
41 Correct 779 ms 35576 KB Output is correct
42 Correct 1 ms 768 KB Output is correct
43 Correct 1 ms 768 KB Output is correct
44 Correct 1 ms 768 KB Output is correct
45 Correct 1 ms 768 KB Output is correct
46 Correct 1 ms 896 KB Output is correct
47 Correct 1 ms 896 KB Output is correct
48 Correct 1 ms 896 KB Output is correct
49 Correct 1 ms 768 KB Output is correct
50 Correct 1 ms 896 KB Output is correct
51 Correct 2 ms 1408 KB Output is correct
52 Correct 2 ms 1408 KB Output is correct
53 Correct 1 ms 1280 KB Output is correct
54 Correct 2 ms 1408 KB Output is correct
55 Correct 2 ms 1536 KB Output is correct
56 Correct 1 ms 768 KB Output is correct
57 Correct 1 ms 768 KB Output is correct
58 Correct 1 ms 768 KB Output is correct
59 Correct 2 ms 1408 KB Output is correct
60 Correct 1 ms 768 KB Output is correct
61 Correct 1 ms 1024 KB Output is correct
62 Correct 1 ms 768 KB Output is correct
63 Correct 1 ms 896 KB Output is correct
64 Correct 1 ms 896 KB Output is correct
65 Correct 1 ms 896 KB Output is correct
66 Correct 1 ms 896 KB Output is correct
67 Correct 1 ms 1024 KB Output is correct
68 Correct 3 ms 1664 KB Output is correct
69 Correct 2 ms 1664 KB Output is correct
70 Correct 2 ms 1664 KB Output is correct
71 Correct 2 ms 1664 KB Output is correct
72 Correct 3 ms 1664 KB Output is correct
73 Correct 2 ms 1664 KB Output is correct
74 Correct 2 ms 768 KB Output is correct
75 Correct 2 ms 1536 KB Output is correct
76 Correct 2 ms 768 KB Output is correct
77 Correct 2 ms 1536 KB Output is correct
78 Correct 2 ms 768 KB Output is correct
79 Correct 2 ms 1536 KB Output is correct
80 Correct 1 ms 1536 KB Output is correct
81 Correct 1 ms 896 KB Output is correct
82 Correct 2 ms 1280 KB Output is correct
83 Correct 1 ms 1024 KB Output is correct
84 Correct 2 ms 1152 KB Output is correct
85 Correct 4 ms 1664 KB Output is correct
86 Correct 4 ms 1536 KB Output is correct
87 Correct 3 ms 1152 KB Output is correct
88 Correct 2 ms 896 KB Output is correct
89 Correct 3 ms 1280 KB Output is correct
90 Correct 4 ms 1664 KB Output is correct
91 Correct 18 ms 2048 KB Output is correct
92 Correct 20 ms 1664 KB Output is correct
93 Correct 23 ms 2040 KB Output is correct
94 Correct 2 ms 1536 KB Output is correct
95 Correct 2 ms 1536 KB Output is correct
96 Correct 2 ms 1536 KB Output is correct
97 Correct 2 ms 1536 KB Output is correct
98 Correct 2 ms 1536 KB Output is correct
99 Correct 5 ms 1792 KB Output is correct
100 Correct 6 ms 1792 KB Output is correct
101 Correct 5 ms 1792 KB Output is correct
102 Correct 5 ms 1792 KB Output is correct
103 Correct 5 ms 1792 KB Output is correct
104 Correct 5 ms 1792 KB Output is correct
105 Correct 26 ms 2808 KB Output is correct
106 Correct 26 ms 2808 KB Output is correct
107 Correct 26 ms 2816 KB Output is correct
108 Correct 3 ms 896 KB Output is correct
109 Correct 62 ms 3456 KB Output is correct
110 Correct 112 ms 3456 KB Output is correct
111 Correct 119 ms 3584 KB Output is correct
112 Correct 154 ms 3840 KB Output is correct
113 Correct 120 ms 4736 KB Output is correct
114 Correct 158 ms 16380 KB Output is correct
115 Correct 21 ms 2688 KB Output is correct
116 Correct 188 ms 16632 KB Output is correct
117 Correct 105 ms 11776 KB Output is correct
118 Correct 29 ms 3328 KB Output is correct
119 Correct 323 ms 27640 KB Output is correct
120 Correct 426 ms 25080 KB Output is correct
121 Correct 532 ms 20216 KB Output is correct
122 Correct 128 ms 9976 KB Output is correct
123 Correct 97 ms 7168 KB Output is correct
124 Correct 55 ms 5752 KB Output is correct
125 Correct 35 ms 3968 KB Output is correct
126 Correct 12 ms 2176 KB Output is correct
127 Correct 136 ms 12672 KB Output is correct
128 Correct 26 ms 3968 KB Output is correct
129 Correct 36 ms 5120 KB Output is correct
130 Correct 4 ms 896 KB Output is correct
131 Correct 89 ms 3584 KB Output is correct
132 Correct 250 ms 4224 KB Output is correct
133 Correct 264 ms 4736 KB Output is correct
134 Correct 252 ms 5112 KB Output is correct
135 Correct 248 ms 5376 KB Output is correct
136 Correct 659 ms 42452 KB Output is correct
137 Correct 667 ms 42232 KB Output is correct
138 Correct 645 ms 42384 KB Output is correct
139 Correct 674 ms 42360 KB Output is correct
140 Correct 651 ms 42488 KB Output is correct
141 Correct 633 ms 42360 KB Output is correct
142 Correct 790 ms 40824 KB Output is correct
143 Correct 998 ms 30840 KB Output is correct
144 Correct 802 ms 40824 KB Output is correct
145 Correct 1012 ms 30712 KB Output is correct
146 Correct 800 ms 41080 KB Output is correct
147 Correct 998 ms 30840 KB Output is correct
148 Correct 636 ms 41720 KB Output is correct
149 Correct 294 ms 22016 KB Output is correct
150 Correct 190 ms 15360 KB Output is correct
151 Correct 150 ms 12160 KB Output is correct

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 768 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 2 ms 1664 KB Output is correct
16 Correct 3 ms 1664 KB Output is correct
17 Correct 2 ms 1536 KB Output is correct
18 Correct 2 ms 1536 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 2 ms 1664 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 2 ms 768 KB Output is correct
24 Correct 18 ms 2304 KB Output is correct
25 Correct 18 ms 2304 KB Output is correct
26 Correct 18 ms 2304 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 4 ms 896 KB Output is correct
30 Correct 5 ms 896 KB Output is correct
31 Correct 4 ms 896 KB Output is correct
32 Correct 4 ms 896 KB Output is correct
33 Correct 634 ms 41260 KB Output is correct
34 Correct 619 ms 41216 KB Output is correct
35 Correct 637 ms 41336 KB Output is correct
36 Correct 663 ms 41336 KB Output is correct
37 Correct 635 ms 41208 KB Output is correct
38 Correct 636 ms 41312 KB Output is correct
39 Correct 724 ms 35320 KB Output is correct
40 Correct 753 ms 35328 KB Output is correct
41 Correct 779 ms 35576 KB Output is correct
42 Correct 11 ms 1536 KB Output is correct
43 Correct 7 ms 1280 KB Output is correct
44 Correct 17 ms 1536 KB Output is correct
45 Correct 12 ms 1280 KB Output is correct
46 Correct 11 ms 1280 KB Output is correct
47 Correct 19 ms 1664 KB Output is correct
48 Runtime error 137 ms 54428 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -