oj.uz

Submission #815509

# Submission time Handle Problem Language Result Execution time Memory
815509 2023-08-08T16:12:13 Z happypotato Council (JOI23_council) C++17
25 / 100
 623 ms 59092 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
// global
int a[300001];
int n, m;
int dpf[(1 << 20)]; // 0: 0, -1: 2+, x: position x
pii dpb[(1 << 20)]; // {which level != 0, which level -1}
bool vis[(1 << 20)];
int ps[300001][20];
void init() {
	// init

}
void PrecompDPF() {
	for (int i = 1; i <= n; i++) {
		if (dpf[a[i]] == 0) dpf[a[i]] = i;
		else dpf[a[i]] = -1;
	}
	for (int bit = 0; bit < m; bit++) {
		for (int conf = 0; conf < (1 << m); conf++) {
			if (conf & (1 << bit)) {
				int prev = (conf ^ (1 << bit));
				// cerr << "ADD " << prev << " TO " << conf << endl;
				if (dpf[prev] == -1) {
					dpf[conf] = -1;
				} else if (dpf[prev] != 0) {
					if (dpf[conf] == 0) {
						dpf[conf] = dpf[prev];
					} else {
						dpf[conf] = -1;
					}
				}
			}
		}
	}
}
bool comp(int &lhs, int &rhs) {
	return __builtin_popcount(lhs) < __builtin_popcount(rhs);
}
void PrecompDPB() {
	for (int conf = 0; conf < (1 << m); conf++) {
		if (dpf[conf] == -1) {
			dpb[conf] = {conf, conf};
		} else if (dpf[conf] != 0) {
			dpb[conf] = {conf, -1};
		} else {
			dpb[conf] = {-1, -1};
		}
		vis[conf] = false;
		// cerr << conf << ' ' << dpb[conf].ff << ' ' << dpb[conf].ss << endl;
	}
	for (int bits = m - 1; bits >= 0; bits--) {
		for (int conf = 0; conf < (1 << m); conf++) {
			if (__builtin_popcount(conf) != bits) continue;
			int ncur;
			int cur = 0;
			for (int i = 0; i < m; i++) {
				if (!bool(conf & (1 << i))) {
					ncur = (conf ^ (1 << i));
					if (dpb[ncur].ff != -1) {
						if (comp(dpb[ncur].ff, dpb[conf].ff)) {
							dpb[conf].ff = dpb[ncur].ff;
						}
						if (dpf[dpb[ncur].ff] == -1) {
							if (comp(dpb[ncur].ff, dpb[conf].ss)) {
								dpb[conf].ss = dpb[ncur].ff;
							}
						} else if (cur == 0) {
							cur = dpb[ncur].ff;
						} else if (dpf[cur] != dpf[dpb[ncur].ff]) {
							// take larger one
							if (comp(cur, dpb[cur].ff)) {
								if (comp(dpb[ncur].ff, dpb[conf].ss)) {
									dpb[conf].ss = dpb[ncur].ff;
								}
							} else {
								if (comp(cur, dpb[conf].ss)) {
									dpb[conf].ss = cur;
								}
								cur = dpb[cur].ff;
							}
						}
					}
					if (dpb[ncur].ss != -1) {
						if (comp(dpb[ncur].ss, dpb[conf].ss)) {
							dpb[conf].ss = dpb[ncur].ss;
						}
				// 		if (comp(dpb[ncur].ss, dpb[conf].ff)) {
				// 			dpb[conf].ff = dpb[ncur].ss;
				// 		}
					}
				}
			}
		}
	}
}
void PrecompPS() {
	for (int j = 0; j < m; j++) {
		ps[0][j] = 0;
		for (int i = 1; i <= n; i++) {
			ps[i][j] = ps[i - 1][j] + bool(a[i] & (1 << j));
		}
	}
}
void st7() {
	PrecompDPF();
	// cerr << "DPF:\n";
	// for (int i = 0; i < (1 << m); i++) cerr << dpf[i] << ' '; cerr << endl;
	// cerr << "END\n";
	PrecompDPB();
	// cerr << "DPB:\n";
	// for (int i = 0; i < (1 << m); i++) {
	// 	cerr << i << ": " << dpb[i].ff << ' ' << dpb[i].ss << endl;
	// }
	// cerr << "END\n";
	PrecompPS();
	for (int i = 1; i <= n; i++) {
		int ans = 0, tar = 0;
		for (int j = 0; j < m; j++) {
			if ((ps[n][j] - bool(a[i] & (1 << j))) > (n >> 1)) {
				ans++;
			} else if ((ps[n][j] - bool(a[i] & (1 << j))) == (n >> 1)) {
				tar |= (1 << j);
			}
		}
		tar ^= ((1 << m) - 1);
		// cerr << ans << ' ' << tar << endl;
		// cerr << dpb[tar].ff << ' ' << dpb[tar].ss << endl;
		int buff = 0;
		if (dpb[tar].ff != -1) {
			if (dpf[dpb[tar].ff] != i) {
				buff = max(buff, m - __builtin_popcount(dpb[tar].ff));
			}
		}
		if (dpb[tar].ss != -1) {
			buff = max(buff, m - __builtin_popcount(dpb[tar].ss));
		}
		// cerr << ans << ' ' << buff << endl;
		ans += buff;
		cout << ans << endl;
	}
}
void st6() {
	return st7();
}
void st5() {
	return st7();
}
void st4() {
	return st7();
}
void st3() {
	return st7();
}
void st2() {
	return st7();
	PrecompPS();
	for (int i = 1; i <= n; i++) {
		int ans = 0;
		int cur;
		for (int j = 1; j <= n; j++) {
			if (i == j) continue;
			cur = 0;
			for (int k = 0; k < m; k++) {
				cur += ((ps[n][k] - bool(a[i] & (1 << k)) - bool(a[j] & (1 << k))) >= (n >> 1));
			}
			ans = max(ans, cur);
		}
		cout << ans << endl;
	}
}
void st1() {
	return st2();
}
void solve() {
	// solve
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		a[i] = 0;
		bool temp;
		for (int j = 0; j < m; j++) {
			cin >> temp;
			if (temp) {
				a[i] |= (1 << j);
			}
		}
	}
	if (n <= 300) return st1();
	if (n <= 3000) return st2();
	if (m <= 2) return st3();
	if (m <= 10) return st4();
	if (m <= 14) return st5();
	if (m <= 17) return st6();
	return st7();
}
int32_t main() {
	ios::sync_with_stdio(0); cin.tie(0);
	init(); solve();
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 281 ms 21876 KB Output is correct
6 Correct 260 ms 17800 KB Output is correct
7 Correct 297 ms 20532 KB Output is correct
8 Correct 352 ms 20912 KB Output is correct
9 Correct 347 ms 25568 KB Output is correct
10 Incorrect 297 ms 19784 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 281 ms 21876 KB Output is correct
6 Correct 260 ms 17800 KB Output is correct
7 Correct 297 ms 20532 KB Output is correct
8 Correct 352 ms 20912 KB Output is correct
9 Correct 347 ms 25568 KB Output is correct
10 Incorrect 297 ms 19784 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 356 ms 51364 KB Output is correct
3 Correct 333 ms 51336 KB Output is correct
4 Correct 368 ms 50900 KB Output is correct
5 Correct 363 ms 51360 KB Output is correct
6 Correct 340 ms 50756 KB Output is correct
7 Correct 351 ms 51332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 4 ms 852 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 356 ms 51364 KB Output is correct
3 Correct 333 ms 51336 KB Output is correct
4 Correct 368 ms 50900 KB Output is correct
5 Correct 363 ms 51360 KB Output is correct
6 Correct 340 ms 50756 KB Output is correct
7 Correct 351 ms 51332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 4 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 491 ms 56064 KB Output is correct
21 Correct 461 ms 55520 KB Output is correct
22 Correct 469 ms 55648 KB Output is correct
23 Correct 488 ms 56344 KB Output is correct
24 Correct 499 ms 56024 KB Output is correct
25 Correct 489 ms 56168 KB Output is correct
26 Correct 495 ms 56140 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 356 ms 51364 KB Output is correct
3 Correct 333 ms 51336 KB Output is correct
4 Correct 368 ms 50900 KB Output is correct
5 Correct 363 ms 51360 KB Output is correct
6 Correct 340 ms 50756 KB Output is correct
7 Correct 351 ms 51332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 4 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 491 ms 56064 KB Output is correct
21 Correct 461 ms 55520 KB Output is correct
22 Correct 469 ms 55648 KB Output is correct
23 Correct 488 ms 56344 KB Output is correct
24 Correct 499 ms 56024 KB Output is correct
25 Correct 489 ms 56168 KB Output is correct
26 Correct 495 ms 56140 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 563 ms 58832 KB Output is correct
48 Correct 552 ms 58060 KB Output is correct
49 Correct 544 ms 57980 KB Output is correct
50 Correct 550 ms 58968 KB Output is correct
51 Correct 572 ms 58828 KB Output is correct
52 Correct 623 ms 58932 KB Output is correct
53 Correct 569 ms 59092 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 4 ms 580 KB Output is correct
56 Correct 4 ms 724 KB Output is correct
57 Incorrect 4 ms 724 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 356 ms 51364 KB Output is correct
3 Correct 333 ms 51336 KB Output is correct
4 Correct 368 ms 50900 KB Output is correct
5 Correct 363 ms 51360 KB Output is correct
6 Correct 340 ms 50756 KB Output is correct
7 Correct 351 ms 51332 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 4 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 491 ms 56064 KB Output is correct
21 Correct 461 ms 55520 KB Output is correct
22 Correct 469 ms 55648 KB Output is correct
23 Correct 488 ms 56344 KB Output is correct
24 Correct 499 ms 56024 KB Output is correct
25 Correct 489 ms 56168 KB Output is correct
26 Correct 495 ms 56140 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 563 ms 58832 KB Output is correct
48 Correct 552 ms 58060 KB Output is correct
49 Correct 544 ms 57980 KB Output is correct
50 Correct 550 ms 58968 KB Output is correct
51 Correct 572 ms 58828 KB Output is correct
52 Correct 623 ms 58932 KB Output is correct
53 Correct 569 ms 59092 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 4 ms 580 KB Output is correct
56 Correct 4 ms 724 KB Output is correct
57 Incorrect 4 ms 724 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 281 ms 21876 KB Output is correct
6 Correct 260 ms 17800 KB Output is correct
7 Correct 297 ms 20532 KB Output is correct
8 Correct 352 ms 20912 KB Output is correct
9 Correct 347 ms 25568 KB Output is correct
10 Incorrect 297 ms 19784 KB Output isn't correct
11 Halted 0 ms 0 KB -