oj.uz

Submission #742274

# Submission time Handle Problem Language Result Execution time Memory
742274 2023-05-16T03:51:49 Z pavement Council (JOI23_council) C++17
62 / 100
 4000 ms 33108 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//~ #define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

int N, M, X[300005], cnt[25];
bool b;
ii vec[(1 << 20) + 5][2], ans[(1 << 20) + 5][2];

inline void merge(ii a[], ii b[]) {
	ii best = mp((int)1e9, -1), sndbest = mp((int)1e9, -1);
	best = min(best, a[0]);
	best = min(best, a[1]);
	best = min(best, b[0]);
	best = min(best, b[1]);
	if (a[0].second != best.second) sndbest = min(sndbest, a[0]);
	if (a[1].second != best.second) sndbest = min(sndbest, a[1]);
	if (b[0].second != best.second) sndbest = min(sndbest, b[0]);
	if (b[1].second != best.second) sndbest = min(sndbest, b[1]);
	a[0] = best;
	a[1] = sndbest;
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 0; i < (1 << M); i++) {
		for (int j = 0; j < 2; j++) {
			vec[i][j] = ans[i][j] = mp((int)1e9, -1);
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int j = 0; j < M; j++) {
			cin >> b;
			X[i] |= (1 << j) * b;
			cnt[j] += b;
		}
		if (vec[X[i]][0].first == (int)1e9) {
			vec[X[i]][0] = mp(__builtin_popcount(X[i]), i);
		} else if (vec[X[i]][1].first == (int)1e9) {
			vec[X[i]][1] = mp(__builtin_popcount(X[i]), i);
		}
	}
	int all = (1 << M) - 1;
	for (int i = 0; i < M; i++) {
		for (int m = 0; m < (1 << M); m++) {
			if (m & (1 << i)) {
				merge(vec[m ^ all], vec[m ^ (1 << i) ^ all]);
			}
		}
	}
	for (int m = 0; m < (1 << M); m++) {
		for (int s = m; s; s = (s - 1) & m) {
			// bm = s, k = m
			int off = __builtin_popcount(s) - __builtin_popcount(m);
			vec[s ^ m][0].first += off;
			vec[s ^ m][1].first += off;
			merge(ans[s], vec[s ^ m]);
			vec[s ^ m][0].first -= off;
			vec[s ^ m][1].first -= off;
		}
	}
	for (int i = 1; i <= N; i++) {
		int cur = 0, bm = 0;
		for (int j = 0; j < M; j++) {
			if (X[i] & (1 << j)) cnt[j]--;
		}
		for (int j = 0; j < M; j++) {
			if (cnt[j] > N / 2) cur++;
			else if (cnt[j] == N / 2) cur++, bm |= (1 << j);
		}
		if (bm) {
			for (auto el : ans[bm]) {
				if (el.second != i) {
					cur -= el.first;
					break;
				}
			}
		}
		cout << cur << '\n';
		for (int j = 0; j < M; j++) {
			if (X[i] & (1 << j)) cnt[j]++;
		}
	}
}

Compilation message

council.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main() {
      | ^~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 4057 ms 33108 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 212 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 4057 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2620 KB Output is correct
3 Correct 73 ms 2620 KB Output is correct
4 Correct 47 ms 2380 KB Output is correct
5 Correct 85 ms 2776 KB Output is correct
6 Correct 64 ms 2352 KB Output is correct
7 Correct 69 ms 2592 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2620 KB Output is correct
3 Correct 73 ms 2620 KB Output is correct
4 Correct 47 ms 2380 KB Output is correct
5 Correct 85 ms 2776 KB Output is correct
6 Correct 64 ms 2352 KB Output is correct
7 Correct 69 ms 2592 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 247 ms 3480 KB Output is correct
21 Correct 221 ms 3404 KB Output is correct
22 Correct 208 ms 3560 KB Output is correct
23 Correct 228 ms 3772 KB Output is correct
24 Correct 192 ms 3404 KB Output is correct
25 Correct 224 ms 3452 KB Output is correct
26 Correct 255 ms 3512 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 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 340 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 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 352 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 2 ms 336 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2620 KB Output is correct
3 Correct 73 ms 2620 KB Output is correct
4 Correct 47 ms 2380 KB Output is correct
5 Correct 85 ms 2776 KB Output is correct
6 Correct 64 ms 2352 KB Output is correct
7 Correct 69 ms 2592 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 247 ms 3480 KB Output is correct
21 Correct 221 ms 3404 KB Output is correct
22 Correct 208 ms 3560 KB Output is correct
23 Correct 228 ms 3772 KB Output is correct
24 Correct 192 ms 3404 KB Output is correct
25 Correct 224 ms 3452 KB Output is correct
26 Correct 255 ms 3512 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 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 340 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 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 352 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 2 ms 336 KB Output is correct
46 Correct 7 ms 468 KB Output is correct
47 Correct 379 ms 3972 KB Output is correct
48 Correct 320 ms 3668 KB Output is correct
49 Correct 310 ms 3608 KB Output is correct
50 Correct 333 ms 4172 KB Output is correct
51 Correct 351 ms 3856 KB Output is correct
52 Correct 363 ms 3876 KB Output is correct
53 Correct 397 ms 4180 KB Output is correct
54 Correct 48 ms 852 KB Output is correct
55 Correct 52 ms 852 KB Output is correct
56 Correct 50 ms 848 KB Output is correct
57 Correct 51 ms 852 KB Output is correct
58 Correct 51 ms 852 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 76 ms 2620 KB Output is correct
3 Correct 73 ms 2620 KB Output is correct
4 Correct 47 ms 2380 KB Output is correct
5 Correct 85 ms 2776 KB Output is correct
6 Correct 64 ms 2352 KB Output is correct
7 Correct 69 ms 2592 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 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 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 247 ms 3480 KB Output is correct
21 Correct 221 ms 3404 KB Output is correct
22 Correct 208 ms 3560 KB Output is correct
23 Correct 228 ms 3772 KB Output is correct
24 Correct 192 ms 3404 KB Output is correct
25 Correct 224 ms 3452 KB Output is correct
26 Correct 255 ms 3512 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 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 340 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 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 352 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 2 ms 336 KB Output is correct
46 Correct 7 ms 468 KB Output is correct
47 Correct 379 ms 3972 KB Output is correct
48 Correct 320 ms 3668 KB Output is correct
49 Correct 310 ms 3608 KB Output is correct
50 Correct 333 ms 4172 KB Output is correct
51 Correct 351 ms 3856 KB Output is correct
52 Correct 363 ms 3876 KB Output is correct
53 Correct 397 ms 4180 KB Output is correct
54 Correct 48 ms 852 KB Output is correct
55 Correct 52 ms 852 KB Output is correct
56 Correct 50 ms 848 KB Output is correct
57 Correct 51 ms 852 KB Output is correct
58 Correct 51 ms 852 KB Output is correct
59 Correct 865 ms 5868 KB Output is correct
60 Correct 1558 ms 6860 KB Output is correct
61 Correct 1532 ms 7276 KB Output is correct
62 Correct 1548 ms 7756 KB Output is correct
63 Correct 919 ms 9320 KB Output is correct
64 Correct 1839 ms 11132 KB Output is correct
65 Correct 1828 ms 11432 KB Output is correct
66 Correct 1605 ms 11552 KB Output is correct
67 Correct 1605 ms 11380 KB Output is correct
68 Correct 2399 ms 11592 KB Output is correct
69 Correct 2357 ms 10912 KB Output is correct
70 Correct 1361 ms 4436 KB Output is correct
71 Correct 1410 ms 4436 KB Output is correct
72 Correct 1338 ms 4424 KB Output is correct
73 Correct 1392 ms 4436 KB Output is correct
74 Correct 1399 ms 4436 KB Output is correct
75 Correct 1381 ms 4516 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Execution timed out 4057 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -