oj.uz

Submission #889659

# Submission time Handle Problem Language Result Execution time Memory
889659 2023-12-20T04:39:21 Z vjudge1 Council (JOI23_council) C++17
41 / 100
 4000 ms 67224 KB 
/*

author : abushbandit
contest : ---

*/

#include "bits/stdc++.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

using namespace std;

#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back
#define rep(i,s,f) for(int i = s;i < f;i++)

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

#pragma GCC optimize("Ofast,no-stack-protector,fast-math",3)

template <class type1>
	using ordered_multiset = tree <type1, null_type, less_equal <type1>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef pair<int,int> pii;

const ll INF = 1e18;
const ll MOD7 = 1e9 + 7;
const ll MOD9 = 998244353;
const ld PI = acos(-1.0);
const int N = 1e5 + 6;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
    
}

int binpow (int a, int n) {
	int res = 1;
	while (n) {
		if (n & 1)
			res *= a;
		a *= a;
		n >>= 1;
	}
	return res;
}

void start_file(string file){
	freopen((file + ".in").c_str(),"r",stdin);
	freopen((file + ".out").c_str(),"w",stdout);
}


void solve(int tc){
	
	int n,m;
	cin >> n >> m;
	int a[n][m],s[m],b[n][m];
	rep(i,0,n){
		rep(j,0,m){
			cin >> a[i][j];
			b[i][j] = a[i][j];
		}
	}
	rep(j,0,m){
		int cnt = 0;
		rep(i,0,n){
			cnt += a[i][j] > 0;
		}
		s[j] = cnt;
//		cout << s[j] << "\n";
	}
	if(n <= 3000){
		
		rep(i,0,n){
			rep(j,0,m){
				a[i][j] = b[i][j];
			}
		}
		for(int i = 0;i < n;i++){
			int ans = 0;
			for(int j = 0;j < n;j++){
				if(i != j){
					int cnt = 0;
					for(int k = 0;k < m;k++){
	//					cout << s[k] << " ";
						if(s[k] - ((a[i][k] == 1) + (a[j][k] == 1)) >= (n) / 2){
							cnt++;
						}
					}
	//				cout << "\n";
					ans = max(ans,cnt);
				}
			}
			cout << ans << "\n";
		}
	} else {
		
		int mp[N] {};
		
		rep(i,0,n){
			int mask = 0;
			for(int j = 0;j < m;j++){
				mask += (1 << j) * a[i][j];
			}
			mp[mask]++;
		}	
		rep(i,0,n){
			int msk = 0;
			for(int j = 0;j < m;j++){
				msk += (1 << j) * a[i][j];
			}
			int ans = 0;
			for(int mask = 0;mask < (1 << m);mask++){
				if((mask == msk && mp[mask] < 2) || mp[mask] == 0){
					continue;
				}
				int cnt = 0;
				for(int k = 0;k < m;k++){
					int h = msk >> k & 1;
					int z = mask >> k & 1;
					if(s[k] - (h + z) >= n / 2){
						cnt++;
					}
				}
				ans = max(ans,cnt);
			}
			cout << ans << "\n"; 
		}
		
		
	}
	
		
}

signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);                      
    
    //	start_file("");

	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);

	int test_cases = 1;
//	cin >> test_cases ;
	for(int tc = 1;tc <= test_cases;++ tc){
		solve(tc);
	}
    
}

Compilation message

council.cpp: In function 'void start_file(std::string)':
council.cpp:75:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  freopen((file + ".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:76:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |  freopen((file + ".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1192 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 1 ms 1116 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1116 KB Output is correct
45 Correct 1 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 1 ms 1116 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct
51 Correct 251 ms 2152 KB Output is correct
52 Correct 247 ms 2160 KB Output is correct
53 Correct 247 ms 2140 KB Output is correct
54 Correct 254 ms 2384 KB Output is correct
55 Correct 32 ms 1112 KB Output is correct
56 Correct 210 ms 1880 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 47 ms 11044 KB Output is correct
3 Correct 47 ms 11200 KB Output is correct
4 Correct 34 ms 6408 KB Output is correct
5 Correct 52 ms 11088 KB Output is correct
6 Correct 34 ms 6480 KB Output is correct
7 Correct 53 ms 11096 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 33 ms 1116 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 47 ms 11044 KB Output is correct
3 Correct 47 ms 11200 KB Output is correct
4 Correct 34 ms 6408 KB Output is correct
5 Correct 52 ms 11088 KB Output is correct
6 Correct 34 ms 6480 KB Output is correct
7 Correct 53 ms 11096 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 33 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1237 ms 48952 KB Output is correct
21 Correct 683 ms 43992 KB Output is correct
22 Correct 683 ms 44072 KB Output is correct
23 Correct 380 ms 48980 KB Output is correct
24 Correct 364 ms 48604 KB Output is correct
25 Correct 3620 ms 48784 KB Output is correct
26 Correct 3692 ms 48940 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1116 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1232 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 47 ms 11044 KB Output is correct
3 Correct 47 ms 11200 KB Output is correct
4 Correct 34 ms 6408 KB Output is correct
5 Correct 52 ms 11088 KB Output is correct
6 Correct 34 ms 6480 KB Output is correct
7 Correct 53 ms 11096 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 33 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1237 ms 48952 KB Output is correct
21 Correct 683 ms 43992 KB Output is correct
22 Correct 683 ms 44072 KB Output is correct
23 Correct 380 ms 48980 KB Output is correct
24 Correct 364 ms 48604 KB Output is correct
25 Correct 3620 ms 48784 KB Output is correct
26 Correct 3692 ms 48940 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1116 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1232 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Execution timed out 4059 ms 67224 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 1116 KB Output is correct
2 Correct 47 ms 11044 KB Output is correct
3 Correct 47 ms 11200 KB Output is correct
4 Correct 34 ms 6408 KB Output is correct
5 Correct 52 ms 11088 KB Output is correct
6 Correct 34 ms 6480 KB Output is correct
7 Correct 53 ms 11096 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 33 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1237 ms 48952 KB Output is correct
21 Correct 683 ms 43992 KB Output is correct
22 Correct 683 ms 44072 KB Output is correct
23 Correct 380 ms 48980 KB Output is correct
24 Correct 364 ms 48604 KB Output is correct
25 Correct 3620 ms 48784 KB Output is correct
26 Correct 3692 ms 48940 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 2 ms 1116 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1116 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1232 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Execution timed out 4059 ms 67224 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 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1192 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1112 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1116 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 1112 KB Output is correct
27 Correct 1 ms 1116 KB Output is correct
28 Correct 1 ms 1116 KB Output is correct
29 Correct 1 ms 1116 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 2 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1116 KB Output is correct
36 Correct 1 ms 1116 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1112 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 1 ms 1116 KB Output is correct
42 Correct 1 ms 1116 KB Output is correct
43 Correct 1 ms 1116 KB Output is correct
44 Correct 1 ms 1116 KB Output is correct
45 Correct 1 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 1 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 1 ms 1116 KB Output is correct
50 Correct 1 ms 1112 KB Output is correct
51 Correct 251 ms 2152 KB Output is correct
52 Correct 247 ms 2160 KB Output is correct
53 Correct 247 ms 2140 KB Output is correct
54 Correct 254 ms 2384 KB Output is correct
55 Correct 32 ms 1112 KB Output is correct
56 Correct 210 ms 1880 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 47 ms 11044 KB Output is correct
59 Correct 47 ms 11200 KB Output is correct
60 Correct 34 ms 6408 KB Output is correct
61 Correct 52 ms 11088 KB Output is correct
62 Correct 34 ms 6480 KB Output is correct
63 Correct 53 ms 11096 KB Output is correct
64 Correct 1 ms 1116 KB Output is correct
65 Correct 1 ms 1116 KB Output is correct
66 Correct 1 ms 1116 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 1 ms 1116 KB Output is correct
69 Correct 1 ms 1116 KB Output is correct
70 Correct 1 ms 1116 KB Output is correct
71 Correct 1 ms 1116 KB Output is correct
72 Correct 1 ms 1116 KB Output is correct
73 Correct 33 ms 1116 KB Output is correct
74 Correct 1 ms 1116 KB Output is correct
75 Correct 1 ms 1116 KB Output is correct
76 Correct 1237 ms 48952 KB Output is correct
77 Correct 683 ms 43992 KB Output is correct
78 Correct 683 ms 44072 KB Output is correct
79 Correct 380 ms 48980 KB Output is correct
80 Correct 364 ms 48604 KB Output is correct
81 Correct 3620 ms 48784 KB Output is correct
82 Correct 3692 ms 48940 KB Output is correct
83 Correct 1 ms 1116 KB Output is correct
84 Correct 1 ms 1116 KB Output is correct
85 Correct 1 ms 1116 KB Output is correct
86 Correct 1 ms 1116 KB Output is correct
87 Correct 1 ms 1116 KB Output is correct
88 Correct 1 ms 1116 KB Output is correct
89 Correct 1 ms 1116 KB Output is correct
90 Correct 1 ms 1116 KB Output is correct
91 Correct 1 ms 1116 KB Output is correct
92 Correct 2 ms 1116 KB Output is correct
93 Correct 1 ms 1116 KB Output is correct
94 Correct 1 ms 1116 KB Output is correct
95 Correct 1 ms 1116 KB Output is correct
96 Correct 1 ms 1116 KB Output is correct
97 Correct 1 ms 1116 KB Output is correct
98 Correct 1 ms 1116 KB Output is correct
99 Correct 1 ms 1116 KB Output is correct
100 Correct 1 ms 1232 KB Output is correct
101 Correct 2 ms 1116 KB Output is correct
102 Correct 1 ms 1116 KB Output is correct
103 Execution timed out 4059 ms 67224 KB Time limit exceeded
104 Halted 0 ms 0 KB -