oj.uz

Submission #889699

# Submission time Handle Problem Language Result Execution time Memory
889699 2023-12-20T05:42:22 Z vjudge1 Council (JOI23_council) C++17
41 / 100
 4000 ms 66388 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 3e5 + 5, inf = 1e18, M = 1e4;

int a[N][25];
int cnt[25];
int ans[N];
int was[N], in[N], calc[M][M],q, mx[M];
int m, n;
int get(int bit, int bit2){
	int res = 0;
	for(int l = 1; l <= m; l++){
			cnt[l] -= min(1ll, (bit2 & (1 << (l - 1))));
		}
	for(int l = 1; l <= m; l++){
		cnt[l] -= min(1ll, (bit & (1 << (l - 1))));
		res += (cnt[l] >= n / 2);
	}
	for(int l = 1; l <= m; l++){
		cnt[l] += min(1ll, (bit & (1 << (l - 1))));
	}
	for(int l = 1; l <= m; l++){
			cnt[l] += min(1ll, (bit2 & (1 << (l - 1))));
		}
	return res;
}
	
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
		int x = 0;
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			x += (a[i][j] * (1ll << (j - 1)));
			cnt[j] += (a[i][j] == 1);
		}
		in[i] = x;
	}
if(n <= 3000){
		for(int i = 1 ; i <= n; i++){
			for(int j = i + 1; j <= n; j++){
				int res = 0 ;
				for(int l = 1; l <= m; l++){
					cnt[l] -= (a[i][l] == 1) + (a[j][l] == 1);
					res += (cnt[l] >= n / 2);
				}
				ans[i] = max(ans[i], res);
				ans[j] = max(ans[j], res);
				for(int l = 1; l <= m; l++){
					cnt[l] += (a[i][l] == 1) + (a[j][l] == 1);
					//res += (cnt[j] >= n / 2);
				}
			}
		}
		for(int i = 1; i <= n; i++)
			cout << ans[i] <<"\n";
		return 0;
	}
	for(int i = 1; i <= n; i++){
		ans[i] = max(mx[in[i]], ans[i]);
		
		if(!was[in[i]]){
			for(int bit = 0; bit < (1 << m); bit++){
				mx[bit] = max(mx[bit], get(in[i],bit));
			}
			was[in[i]] = 1;
		}
	}
	for(int bit = 0; bit < (1 << m); bit++){
		mx[bit] = 0;
		was[bit] = 0;
	}
	
	for(int i = n; i >= 1; i--){
		ans[i] = max(mx[in[i]], ans[i]);
		
		if(!was[in[i]]){
			for(int bit = 0; bit < (1 << m); bit++){
				mx[bit] = max(mx[bit], get(in[i],bit));
			}
			was[in[i]] = 1;
		}
	}
	for(int i = 1; i <= n; i++)
		cout << ans[i] <<"\n";
}

/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

council.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main(){
      | ^~~~
council.cpp: In function 'void fp(std::string)':
council.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 3 ms 4580 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 4 ms 4576 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4568 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4444 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 3 ms 4580 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 4 ms 4576 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4568 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4444 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 222 ms 6632 KB Output is correct
52 Correct 220 ms 6492 KB Output is correct
53 Correct 227 ms 6632 KB Output is correct
54 Correct 220 ms 6636 KB Output is correct
55 Correct 30 ms 6492 KB Output is correct
56 Correct 188 ms 6492 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 50 ms 66120 KB Output is correct
3 Correct 41 ms 66140 KB Output is correct
4 Correct 34 ms 66136 KB Output is correct
5 Correct 45 ms 66076 KB Output is correct
6 Correct 36 ms 66128 KB Output is correct
7 Correct 48 ms 66208 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 31 ms 6660 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 50 ms 66120 KB Output is correct
3 Correct 41 ms 66140 KB Output is correct
4 Correct 34 ms 66136 KB Output is correct
5 Correct 45 ms 66076 KB Output is correct
6 Correct 36 ms 66128 KB Output is correct
7 Correct 48 ms 66208 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 31 ms 6660 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 159 ms 66152 KB Output is correct
21 Correct 131 ms 66040 KB Output is correct
22 Correct 134 ms 66032 KB Output is correct
23 Correct 131 ms 66388 KB Output is correct
24 Correct 118 ms 66128 KB Output is correct
25 Correct 211 ms 65996 KB Output is correct
26 Correct 216 ms 66132 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 2 ms 4580 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 1 ms 4696 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4696 KB Output is correct
42 Correct 1 ms 4600 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 2 ms 4444 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 50 ms 66120 KB Output is correct
3 Correct 41 ms 66140 KB Output is correct
4 Correct 34 ms 66136 KB Output is correct
5 Correct 45 ms 66076 KB Output is correct
6 Correct 36 ms 66128 KB Output is correct
7 Correct 48 ms 66208 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 31 ms 6660 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 159 ms 66152 KB Output is correct
21 Correct 131 ms 66040 KB Output is correct
22 Correct 134 ms 66032 KB Output is correct
23 Correct 131 ms 66388 KB Output is correct
24 Correct 118 ms 66128 KB Output is correct
25 Correct 211 ms 65996 KB Output is correct
26 Correct 216 ms 66132 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 2 ms 4580 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 1 ms 4696 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4696 KB Output is correct
42 Correct 1 ms 4600 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 2 ms 4444 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Execution timed out 4049 ms 65708 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 50 ms 66120 KB Output is correct
3 Correct 41 ms 66140 KB Output is correct
4 Correct 34 ms 66136 KB Output is correct
5 Correct 45 ms 66076 KB Output is correct
6 Correct 36 ms 66128 KB Output is correct
7 Correct 48 ms 66208 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 31 ms 6660 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 159 ms 66152 KB Output is correct
21 Correct 131 ms 66040 KB Output is correct
22 Correct 134 ms 66032 KB Output is correct
23 Correct 131 ms 66388 KB Output is correct
24 Correct 118 ms 66128 KB Output is correct
25 Correct 211 ms 65996 KB Output is correct
26 Correct 216 ms 66132 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 2 ms 4580 KB Output is correct
37 Correct 1 ms 4440 KB Output is correct
38 Correct 1 ms 4696 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4696 KB Output is correct
42 Correct 1 ms 4600 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 2 ms 4444 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Execution timed out 4049 ms 65708 KB Time limit exceeded
48 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 3 ms 4580 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 4 ms 4576 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4568 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4444 KB Output is correct
41 Correct 1 ms 4440 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 1 ms 4444 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4444 KB Output is correct
48 Correct 1 ms 4444 KB Output is correct
49 Correct 1 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 222 ms 6632 KB Output is correct
52 Correct 220 ms 6492 KB Output is correct
53 Correct 227 ms 6632 KB Output is correct
54 Correct 220 ms 6636 KB Output is correct
55 Correct 30 ms 6492 KB Output is correct
56 Correct 188 ms 6492 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct
58 Correct 50 ms 66120 KB Output is correct
59 Correct 41 ms 66140 KB Output is correct
60 Correct 34 ms 66136 KB Output is correct
61 Correct 45 ms 66076 KB Output is correct
62 Correct 36 ms 66128 KB Output is correct
63 Correct 48 ms 66208 KB Output is correct
64 Correct 1 ms 4444 KB Output is correct
65 Correct 1 ms 4444 KB Output is correct
66 Correct 1 ms 4444 KB Output is correct
67 Correct 1 ms 4444 KB Output is correct
68 Correct 1 ms 4444 KB Output is correct
69 Correct 1 ms 4444 KB Output is correct
70 Correct 1 ms 4444 KB Output is correct
71 Correct 1 ms 4444 KB Output is correct
72 Correct 1 ms 4444 KB Output is correct
73 Correct 31 ms 6660 KB Output is correct
74 Correct 1 ms 4444 KB Output is correct
75 Correct 1 ms 4444 KB Output is correct
76 Correct 159 ms 66152 KB Output is correct
77 Correct 131 ms 66040 KB Output is correct
78 Correct 134 ms 66032 KB Output is correct
79 Correct 131 ms 66388 KB Output is correct
80 Correct 118 ms 66128 KB Output is correct
81 Correct 211 ms 65996 KB Output is correct
82 Correct 216 ms 66132 KB Output is correct
83 Correct 1 ms 4444 KB Output is correct
84 Correct 1 ms 4444 KB Output is correct
85 Correct 1 ms 4444 KB Output is correct
86 Correct 1 ms 4444 KB Output is correct
87 Correct 1 ms 4444 KB Output is correct
88 Correct 1 ms 4444 KB Output is correct
89 Correct 1 ms 4444 KB Output is correct
90 Correct 1 ms 4444 KB Output is correct
91 Correct 1 ms 4444 KB Output is correct
92 Correct 2 ms 4580 KB Output is correct
93 Correct 1 ms 4440 KB Output is correct
94 Correct 1 ms 4696 KB Output is correct
95 Correct 1 ms 4444 KB Output is correct
96 Correct 1 ms 4444 KB Output is correct
97 Correct 1 ms 4696 KB Output is correct
98 Correct 1 ms 4600 KB Output is correct
99 Correct 1 ms 4444 KB Output is correct
100 Correct 1 ms 4444 KB Output is correct
101 Correct 2 ms 4444 KB Output is correct
102 Correct 1 ms 4440 KB Output is correct
103 Execution timed out 4049 ms 65708 KB Time limit exceeded
104 Halted 0 ms 0 KB -