oj.uz

Submission #889987

# Submission time Handle Problem Language Result Execution time Memory
889987 2023-12-20T10:37:40 Z vjudge1 Council (JOI23_council) C++17
40 / 100
 4000 ms 271268 KB 
#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 3e5;
int ans[N+10];


vector< vector<int> > build(int n, int m, vector< vector<int> > &a){
	
	vector<int> cnt(m);
	for(int i = 0;i < n; i++){
		for(int j = 0;j < m; j++){
			cnt[j]+= a[i][j];
		}
	}
	vector< vector<int> > res(n);
	
	for(int i = 0;i < n; i++){
		for(int j = 0;j < m; j++){
			if(cnt[j] > (n / 2) + 1){
				ans[i]++;
			}
		}
	}
	for(int i = 0;i < n; i++){
		for(int j = 0;j < m; j++){
			if(cnt[j] == n / 2){
				res[i].push_back(a[i][j]);
			}else if(cnt[j] ==  (n / 2) + 1){
				res[i].push_back(a[i][j]);
			}
		}
	}
	return res;
}



pair<int, int> mnus(pair<int ,int> A, int bits){
	int fin = A.ff - (A.ff & bits);
	int fin1 = A.ss;
	int k = (A.ss & bits);
	fin|= k;
	fin1-= k;
	return {fin, fin1};
}


signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, m; cin >> n >> m;
	vector< vector<int> > a(n, vector<int>(m));
	for(int i = 0;i < n; i++){
		for(int j = 0;j < m; j++){
			cin >> a[i][j];
		}
	}
	a = build(n, m, a);
	n = a.size();
	m = a[0].size();
	vector<int> cnt(m);
	int col = 0, col1 = 0;
	for(int i = 0;i < n; i++){
		for(int j = 0;j < m; j++){
			cnt[j]+= a[i][j];
		}
	}
	
	for(int j = 0;j < m; j++){
		if(cnt[j] == n / 2) col+= (1<<j);
		else col1+= (1<<j);
	}
	vector<int> bits(n);
	vector<int> index[(1<<m) + 10];
	for(int i = 0;i < n; i++){
		int mask = 0;
		for(int j = 0;j < m; j++){
			if(a[i][j]){
				mask+= (1<<j);
			}
		}
		bits[i] = mask;
		index[mask].push_back(i);
	}
	
	 vector< vector<int> > mx_index(1<<m, vector<int>(22, -1));
	vector< vector<int> > mn_index(1<<m, vector<int>(22, -1));
	for(int bits = 0; bits < (1<<m); bits++){
		for(int mask = 0; mask < (1<<m); mask++){
			if(index[mask].empty() == false){
				int k = (bits & mask);
				k = __builtin_popcount(k);
				if(index[mask].size() >= 2){
					if(mx_index[bits][k] == -1) mx_index[bits][k] = index[mask][0];
					if(mn_index[bits][k] == -1) mn_index[bits][k] = index[mask].back();
				}else{
					if(mx_index[bits][k] == -1) mx_index[bits][k] = index[mask][0];
					else if(mn_index[bits][k] == -1) mn_index[bits][k] = index[mask][0];
				}
			}
		}
	}
	
		for(int i = 0;i < n; i++){
			pair<int, int> gt = mnus(make_pair(col, col1), bits[i]);
			int mx = 0;
			
			
			for(int bit = 0; bit < 22; bit++){
				if(mn_index[gt.ff][bit] != -1 && mn_index[gt.ff][bit] != i){
					mx = max(mx, __builtin_popcount(gt.ff) + __builtin_popcount(gt.ss) - bit);	
				}
				if(mx_index[gt.ff][bit] != -1 && mx_index[gt.ff][bit] != i){
					mx = max(mx, __builtin_popcount(gt.ff) + __builtin_popcount(gt.ss) - bit);	
				}
			}
			
			ans[i]+= mx;
		}
	
	
	
	for(int i = 0;i < n; i++) cout << ans[i] << '\n';
	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Execution timed out 4094 ms 271268 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Execution timed out 4094 ms 271268 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 69 ms 24984 KB Output is correct
3 Correct 68 ms 23816 KB Output is correct
4 Correct 60 ms 23968 KB Output is correct
5 Correct 82 ms 23892 KB Output is correct
6 Correct 76 ms 33240 KB Output is correct
7 Correct 97 ms 33248 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 69 ms 24984 KB Output is correct
3 Correct 68 ms 23816 KB Output is correct
4 Correct 60 ms 23968 KB Output is correct
5 Correct 82 ms 23892 KB Output is correct
6 Correct 76 ms 33240 KB Output is correct
7 Correct 97 ms 33248 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 260 ms 52060 KB Output is correct
21 Correct 238 ms 52056 KB Output is correct
22 Correct 237 ms 52056 KB Output is correct
23 Correct 155 ms 29780 KB Output is correct
24 Correct 151 ms 28756 KB Output is correct
25 Correct 179 ms 29780 KB Output is correct
26 Correct 268 ms 52052 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 432 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 3 ms 604 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 69 ms 24984 KB Output is correct
3 Correct 68 ms 23816 KB Output is correct
4 Correct 60 ms 23968 KB Output is correct
5 Correct 82 ms 23892 KB Output is correct
6 Correct 76 ms 33240 KB Output is correct
7 Correct 97 ms 33248 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 260 ms 52060 KB Output is correct
21 Correct 238 ms 52056 KB Output is correct
22 Correct 237 ms 52056 KB Output is correct
23 Correct 155 ms 29780 KB Output is correct
24 Correct 151 ms 28756 KB Output is correct
25 Correct 179 ms 29780 KB Output is correct
26 Correct 268 ms 52052 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 432 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 3 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 780 ms 56660 KB Output is correct
48 Correct 426 ms 56744 KB Output is correct
49 Correct 426 ms 56656 KB Output is correct
50 Correct 250 ms 34476 KB Output is correct
51 Correct 197 ms 33108 KB Output is correct
52 Correct 220 ms 34388 KB Output is correct
53 Correct 1343 ms 56764 KB Output is correct
54 Correct 253 ms 4696 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 261 ms 4676 KB Output is correct
58 Correct 257 ms 4696 KB Output is correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 69 ms 24984 KB Output is correct
3 Correct 68 ms 23816 KB Output is correct
4 Correct 60 ms 23968 KB Output is correct
5 Correct 82 ms 23892 KB Output is correct
6 Correct 76 ms 33240 KB Output is correct
7 Correct 97 ms 33248 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 260 ms 52060 KB Output is correct
21 Correct 238 ms 52056 KB Output is correct
22 Correct 237 ms 52056 KB Output is correct
23 Correct 155 ms 29780 KB Output is correct
24 Correct 151 ms 28756 KB Output is correct
25 Correct 179 ms 29780 KB Output is correct
26 Correct 268 ms 52052 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 432 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 3 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 780 ms 56660 KB Output is correct
48 Correct 426 ms 56744 KB Output is correct
49 Correct 426 ms 56656 KB Output is correct
50 Correct 250 ms 34476 KB Output is correct
51 Correct 197 ms 33108 KB Output is correct
52 Correct 220 ms 34388 KB Output is correct
53 Correct 1343 ms 56764 KB Output is correct
54 Correct 253 ms 4696 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 261 ms 4676 KB Output is correct
58 Correct 257 ms 4696 KB Output is correct
59 Correct 256 ms 39172 KB Output is correct
60 Execution timed out 4064 ms 57044 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Execution timed out 4094 ms 271268 KB Time limit exceeded
6 Halted 0 ms 0 KB -