oj.uz

Submission #305602

# Submission time Handle Problem Language Result Execution time Memory
305602 2020-09-23T16:39:04 Z AmineWeslati Painting Walls (APIO20_paint) C++14
28 / 100
 313 ms 42792 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[40005];

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]]) mismatch[i]=true,nb++;
			if(i>=M-1){
				if(nb==0) pos[i-M+1]=true;
				if(mismatch[i-M+1]) 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]];
	}

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

	

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

	int 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;
		}
	}
	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 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 2 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 2 ms 1152 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 2 ms 1152 KB Output is correct
19 Correct 2 ms 1280 KB Output is correct
20 Correct 2 ms 1280 KB Output is correct
21 Correct 2 ms 1280 KB Output is correct
22 Correct 35 ms 6044 KB Output is correct
23 Correct 37 ms 6052 KB Output is correct
24 Correct 36 ms 6044 KB Output is correct
25 Correct 4 ms 1280 KB Output is correct
26 Correct 4 ms 1280 KB Output is correct
27 Correct 4 ms 1280 KB Output is correct
28 Correct 5 ms 1280 KB Output is correct
29 Correct 5 ms 1280 KB Output is correct
30 Correct 5 ms 1280 KB Output is correct
31 Correct 270 ms 3064 KB Output is correct
32 Correct 261 ms 3072 KB Output is correct
33 Correct 265 ms 2944 KB Output is correct
34 Correct 264 ms 3064 KB Output is correct
35 Correct 261 ms 3072 KB Output is correct
36 Correct 264 ms 3064 KB Output is correct
37 Correct 311 ms 6812 KB Output is correct
38 Correct 306 ms 6812 KB Output is correct
39 Correct 313 ms 6812 KB Output is correct
40 Correct 13 ms 1920 KB Output is correct
41 Correct 8 ms 1664 KB Output is correct
42 Correct 17 ms 1920 KB Output is correct
43 Correct 12 ms 1664 KB Output is correct
44 Correct 12 ms 1664 KB Output is correct
45 Correct 19 ms 2048 KB Output is correct
46 Runtime error 98 ms 42792 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 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 2 ms 1152 KB Output is correct
19 Correct 2 ms 1152 KB Output is correct
20 Correct 2 ms 1152 KB Output is correct
21 Correct 2 ms 1280 KB Output is correct
22 Correct 2 ms 1280 KB Output is correct
23 Correct 2 ms 1280 KB Output is correct
24 Correct 1 ms 1152 KB Output is correct
25 Correct 1 ms 1152 KB Output is correct
26 Correct 1 ms 1152 KB Output is correct
27 Correct 1 ms 1152 KB Output is correct
28 Correct 1 ms 1152 KB Output is correct
29 Correct 1 ms 1152 KB Output is correct
30 Correct 1 ms 1152 KB Output is correct
31 Correct 1 ms 1152 KB Output is correct
32 Correct 1 ms 1152 KB Output is correct
33 Correct 2 ms 1152 KB Output is correct
34 Correct 2 ms 1152 KB Output is correct
35 Correct 1 ms 1152 KB Output is correct
36 Correct 2 ms 1152 KB Output is correct
37 Correct 2 ms 1152 KB Output is correct
38 Correct 2 ms 1152 KB Output is correct
39 Correct 1 ms 1152 KB Output is correct
40 Correct 2 ms 1280 KB Output is correct
41 Correct 2 ms 1152 KB Output is correct
42 Correct 2 ms 1152 KB Output is correct
43 Correct 1 ms 1152 KB Output is correct
44 Correct 1 ms 1152 KB Output is correct
45 Correct 1 ms 1152 KB Output is correct
46 Correct 1 ms 1152 KB Output is correct
47 Correct 1 ms 1152 KB Output is correct
48 Correct 1 ms 1152 KB Output is correct
49 Correct 1 ms 1152 KB Output is correct
50 Correct 2 ms 1152 KB Output is correct
51 Correct 2 ms 1152 KB Output is correct
52 Correct 2 ms 1152 KB Output is correct
53 Correct 2 ms 1152 KB Output is correct
54 Correct 2 ms 1152 KB Output is correct
55 Correct 2 ms 1152 KB Output is correct
56 Correct 2 ms 1280 KB Output is correct
57 Correct 2 ms 1152 KB Output is correct
58 Correct 2 ms 1280 KB Output is correct
59 Correct 2 ms 1152 KB Output is correct
60 Correct 2 ms 1280 KB Output is correct
61 Correct 2 ms 1152 KB Output is correct

Subtask #3
13.0 / 13.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 2 ms 1152 KB Output is correct
19 Correct 2 ms 1152 KB Output is correct
20 Correct 2 ms 1152 KB Output is correct
21 Correct 2 ms 1280 KB Output is correct
22 Correct 2 ms 1280 KB Output is correct
23 Correct 2 ms 1280 KB Output is correct
24 Correct 35 ms 6044 KB Output is correct
25 Correct 37 ms 6052 KB Output is correct
26 Correct 36 ms 6044 KB Output is correct
27 Correct 4 ms 1280 KB Output is correct
28 Correct 4 ms 1280 KB Output is correct
29 Correct 4 ms 1280 KB Output is correct
30 Correct 5 ms 1280 KB Output is correct
31 Correct 5 ms 1280 KB Output is correct
32 Correct 5 ms 1280 KB Output is correct
33 Correct 270 ms 3064 KB Output is correct
34 Correct 261 ms 3072 KB Output is correct
35 Correct 265 ms 2944 KB Output is correct
36 Correct 264 ms 3064 KB Output is correct
37 Correct 261 ms 3072 KB Output is correct
38 Correct 264 ms 3064 KB Output is correct
39 Correct 311 ms 6812 KB Output is correct
40 Correct 306 ms 6812 KB Output is correct
41 Correct 313 ms 6812 KB Output is correct
42 Correct 1 ms 1152 KB Output is correct
43 Correct 1 ms 1152 KB Output is correct
44 Correct 1 ms 1152 KB Output is correct
45 Correct 1 ms 1152 KB Output is correct
46 Correct 1 ms 1152 KB Output is correct
47 Correct 1 ms 1152 KB Output is correct
48 Correct 1 ms 1152 KB Output is correct
49 Correct 1 ms 1152 KB Output is correct
50 Correct 1 ms 1152 KB Output is correct
51 Correct 2 ms 1152 KB Output is correct
52 Correct 2 ms 1152 KB Output is correct
53 Correct 1 ms 1152 KB Output is correct
54 Correct 2 ms 1152 KB Output is correct
55 Correct 2 ms 1152 KB Output is correct
56 Correct 2 ms 1152 KB Output is correct
57 Correct 1 ms 1152 KB Output is correct
58 Correct 2 ms 1280 KB Output is correct
59 Correct 2 ms 1152 KB Output is correct
60 Correct 2 ms 1152 KB Output is correct
61 Correct 1 ms 1152 KB Output is correct
62 Correct 1 ms 1152 KB Output is correct
63 Correct 1 ms 1152 KB Output is correct
64 Correct 1 ms 1152 KB Output is correct
65 Correct 1 ms 1152 KB Output is correct
66 Correct 1 ms 1152 KB Output is correct
67 Correct 1 ms 1152 KB Output is correct
68 Correct 2 ms 1152 KB Output is correct
69 Correct 2 ms 1152 KB Output is correct
70 Correct 2 ms 1152 KB Output is correct
71 Correct 2 ms 1152 KB Output is correct
72 Correct 2 ms 1152 KB Output is correct
73 Correct 2 ms 1152 KB Output is correct
74 Correct 2 ms 1280 KB Output is correct
75 Correct 2 ms 1152 KB Output is correct
76 Correct 2 ms 1280 KB Output is correct
77 Correct 2 ms 1152 KB Output is correct
78 Correct 2 ms 1280 KB Output is correct
79 Correct 2 ms 1152 KB Output is correct
80 Correct 1 ms 1152 KB Output is correct
81 Correct 1 ms 1152 KB Output is correct
82 Correct 2 ms 1152 KB Output is correct
83 Correct 1 ms 1152 KB Output is correct
84 Correct 2 ms 1152 KB Output is correct
85 Correct 4 ms 1280 KB Output is correct
86 Correct 4 ms 1280 KB Output is correct
87 Correct 5 ms 1280 KB Output is correct
88 Correct 2 ms 1152 KB Output is correct
89 Correct 4 ms 1280 KB Output is correct
90 Correct 3 ms 1280 KB Output is correct
91 Correct 34 ms 4228 KB Output is correct
92 Correct 34 ms 5516 KB Output is correct
93 Correct 42 ms 5636 KB Output is correct
94 Correct 2 ms 1152 KB Output is correct
95 Correct 2 ms 1152 KB Output is correct
96 Correct 2 ms 1152 KB Output is correct
97 Correct 2 ms 1152 KB Output is correct
98 Correct 2 ms 1152 KB Output is correct
99 Correct 5 ms 1280 KB Output is correct
100 Correct 5 ms 1280 KB Output is correct
101 Correct 5 ms 1280 KB Output is correct
102 Correct 5 ms 1280 KB Output is correct
103 Correct 5 ms 1280 KB Output is correct
104 Correct 5 ms 1280 KB Output is correct
105 Correct 50 ms 6044 KB Output is correct
106 Correct 49 ms 5916 KB Output is correct
107 Correct 48 ms 5916 KB Output is correct
108 Correct 4 ms 1280 KB Output is correct
109 Correct 60 ms 1408 KB Output is correct
110 Correct 92 ms 1636 KB Output is correct
111 Correct 95 ms 1408 KB Output is correct
112 Correct 130 ms 1536 KB Output is correct
113 Correct 98 ms 1536 KB Output is correct
114 Correct 89 ms 2432 KB Output is correct
115 Correct 23 ms 2168 KB Output is correct
116 Correct 111 ms 2984 KB Output is correct
117 Correct 66 ms 2304 KB Output is correct
118 Correct 27 ms 2304 KB Output is correct
119 Correct 149 ms 2688 KB Output is correct
120 Correct 186 ms 4612 KB Output is correct
121 Correct 159 ms 2176 KB Output is correct
122 Correct 86 ms 4356 KB Output is correct
123 Correct 49 ms 1792 KB Output is correct
124 Correct 74 ms 5772 KB Output is correct
125 Correct 33 ms 1920 KB Output is correct
126 Incorrect 13 ms 2304 KB Output isn't correct
127 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Correct 1 ms 1152 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct
16 Correct 2 ms 1152 KB Output is correct
17 Correct 2 ms 1152 KB Output is correct
18 Correct 2 ms 1152 KB Output is correct
19 Correct 2 ms 1152 KB Output is correct
20 Correct 2 ms 1152 KB Output is correct
21 Correct 2 ms 1280 KB Output is correct
22 Correct 2 ms 1280 KB Output is correct
23 Correct 2 ms 1280 KB Output is correct
24 Correct 35 ms 6044 KB Output is correct
25 Correct 37 ms 6052 KB Output is correct
26 Correct 36 ms 6044 KB Output is correct
27 Correct 4 ms 1280 KB Output is correct
28 Correct 4 ms 1280 KB Output is correct
29 Correct 4 ms 1280 KB Output is correct
30 Correct 5 ms 1280 KB Output is correct
31 Correct 5 ms 1280 KB Output is correct
32 Correct 5 ms 1280 KB Output is correct
33 Correct 270 ms 3064 KB Output is correct
34 Correct 261 ms 3072 KB Output is correct
35 Correct 265 ms 2944 KB Output is correct
36 Correct 264 ms 3064 KB Output is correct
37 Correct 261 ms 3072 KB Output is correct
38 Correct 264 ms 3064 KB Output is correct
39 Correct 311 ms 6812 KB Output is correct
40 Correct 306 ms 6812 KB Output is correct
41 Correct 313 ms 6812 KB Output is correct
42 Correct 13 ms 1920 KB Output is correct
43 Correct 8 ms 1664 KB Output is correct
44 Correct 17 ms 1920 KB Output is correct
45 Correct 12 ms 1664 KB Output is correct
46 Correct 12 ms 1664 KB Output is correct
47 Correct 19 ms 2048 KB Output is correct
48 Runtime error 98 ms 42792 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -