oj.uz

답안 #741879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741879 2023-05-15T03:24:23 Z pavement Council (JOI23_council) C++17
40 / 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>;

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

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);
		}
	}
	for (int m = 0; m < (1 << M); m++) {
		for (int s = m; ; s = (s - 1) & m) {
			merge(vec[s], vec[m]);
			if (s == 0) break;
		}
	}
	for (int m = 0; m < (1 << M); m++) {
		for (int s = m; ; 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;
			if (s == 0) break;
		}
	}
	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);
		}
		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:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main() {
      | ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 15 ms 476 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Execution timed out 4070 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 15 ms 476 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Execution timed out 4070 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 77 ms 2044 KB Output is correct
3 Correct 72 ms 2100 KB Output is correct
4 Correct 41 ms 2032 KB Output is correct
5 Correct 67 ms 1980 KB Output is correct
6 Correct 54 ms 2068 KB Output is correct
7 Correct 79 ms 2080 KB Output is correct
8 Correct 1 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 0 ms 248 KB Output is correct
12 Correct 0 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 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 77 ms 2044 KB Output is correct
3 Correct 72 ms 2100 KB Output is correct
4 Correct 41 ms 2032 KB Output is correct
5 Correct 67 ms 1980 KB Output is correct
6 Correct 54 ms 2068 KB Output is correct
7 Correct 79 ms 2080 KB Output is correct
8 Correct 1 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 0 ms 248 KB Output is correct
12 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 257 ms 2128 KB Output is correct
21 Correct 223 ms 2064 KB Output is correct
22 Correct 216 ms 2016 KB Output is correct
23 Correct 218 ms 2384 KB Output is correct
24 Correct 199 ms 2020 KB Output is correct
25 Correct 251 ms 2012 KB Output is correct
26 Correct 240 ms 2156 KB Output is correct
27 Correct 2 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 0 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 2 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 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 2 ms 340 KB Output is correct
45 Correct 2 ms 340 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 77 ms 2044 KB Output is correct
3 Correct 72 ms 2100 KB Output is correct
4 Correct 41 ms 2032 KB Output is correct
5 Correct 67 ms 1980 KB Output is correct
6 Correct 54 ms 2068 KB Output is correct
7 Correct 79 ms 2080 KB Output is correct
8 Correct 1 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 0 ms 248 KB Output is correct
12 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 257 ms 2128 KB Output is correct
21 Correct 223 ms 2064 KB Output is correct
22 Correct 216 ms 2016 KB Output is correct
23 Correct 218 ms 2384 KB Output is correct
24 Correct 199 ms 2020 KB Output is correct
25 Correct 251 ms 2012 KB Output is correct
26 Correct 240 ms 2156 KB Output is correct
27 Correct 2 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 0 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 2 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 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 2 ms 340 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 17 ms 468 KB Output is correct
47 Correct 458 ms 2592 KB Output is correct
48 Correct 343 ms 2264 KB Output is correct
49 Correct 339 ms 2296 KB Output is correct
50 Correct 363 ms 2884 KB Output is correct
51 Correct 379 ms 2544 KB Output is correct
52 Correct 430 ms 2508 KB Output is correct
53 Correct 514 ms 2892 KB Output is correct
54 Correct 103 ms 852 KB Output is correct
55 Correct 144 ms 852 KB Output is correct
56 Correct 133 ms 852 KB Output is correct
57 Correct 121 ms 852 KB Output is correct
58 Correct 124 ms 852 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 77 ms 2044 KB Output is correct
3 Correct 72 ms 2100 KB Output is correct
4 Correct 41 ms 2032 KB Output is correct
5 Correct 67 ms 1980 KB Output is correct
6 Correct 54 ms 2068 KB Output is correct
7 Correct 79 ms 2080 KB Output is correct
8 Correct 1 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 0 ms 248 KB Output is correct
12 Correct 0 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 0 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 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 257 ms 2128 KB Output is correct
21 Correct 223 ms 2064 KB Output is correct
22 Correct 216 ms 2016 KB Output is correct
23 Correct 218 ms 2384 KB Output is correct
24 Correct 199 ms 2020 KB Output is correct
25 Correct 251 ms 2012 KB Output is correct
26 Correct 240 ms 2156 KB Output is correct
27 Correct 2 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 0 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 2 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 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 2 ms 340 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 17 ms 468 KB Output is correct
47 Correct 458 ms 2592 KB Output is correct
48 Correct 343 ms 2264 KB Output is correct
49 Correct 339 ms 2296 KB Output is correct
50 Correct 363 ms 2884 KB Output is correct
51 Correct 379 ms 2544 KB Output is correct
52 Correct 430 ms 2508 KB Output is correct
53 Correct 514 ms 2892 KB Output is correct
54 Correct 103 ms 852 KB Output is correct
55 Correct 144 ms 852 KB Output is correct
56 Correct 133 ms 852 KB Output is correct
57 Correct 121 ms 852 KB Output is correct
58 Correct 124 ms 852 KB Output is correct
59 Correct 1345 ms 4456 KB Output is correct
60 Correct 2834 ms 5232 KB Output is correct
61 Correct 2862 ms 5168 KB Output is correct
62 Correct 2845 ms 5312 KB Output is correct
63 Correct 1404 ms 4088 KB Output is correct
64 Correct 3424 ms 6172 KB Output is correct
65 Correct 3387 ms 6112 KB Output is correct
66 Correct 2678 ms 6496 KB Output is correct
67 Correct 2893 ms 6112 KB Output is correct
68 Correct 3886 ms 6168 KB Output is correct
69 Execution timed out 4013 ms 10988 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 15 ms 476 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Execution timed out 4070 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -