oj.uz

답안 #741875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
741875 2023-05-15T03:16:53 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 c[4], d[4];
	c[0] = a[0];
	c[1] = a[1];
	c[2] = b[0];
	c[3] = b[1];
	for (int i = 0; i < 4; i++) {
		swap(c[i].first, c[i].second);
		d[i] = mp((int)1e9, -1);
	}
	sort(c, c + 4);
	for (int i = 0; i < 4; i++) {
		if (i == 0 || c[i - 1].first != c[i].first) d[i] = mp(c[i].second, c[i].first);
	}
	sort(d, d + 4);
	a[0] = d[0];
	a[1] = d[1];
}

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
			ii cpy[2];
			for (int i = 0; i < 2; i++) {
				cpy[i] = mp(vec[s ^ m][i].first + __builtin_popcount(s) - __builtin_popcount(m), vec[s ^ m][i].second);
			}
			merge(ans[s], cpy);
			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:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main() {
      | ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 50 ms 448 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 4083 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 50 ms 448 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 4083 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 74 ms 2012 KB Output is correct
3 Correct 62 ms 2012 KB Output is correct
4 Correct 44 ms 2092 KB Output is correct
5 Correct 70 ms 1996 KB Output is correct
6 Correct 46 ms 1984 KB Output is correct
7 Correct 74 ms 2128 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 304 KB Output is correct
16 Correct 0 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 74 ms 2012 KB Output is correct
3 Correct 62 ms 2012 KB Output is correct
4 Correct 44 ms 2092 KB Output is correct
5 Correct 70 ms 1996 KB Output is correct
6 Correct 46 ms 1984 KB Output is correct
7 Correct 74 ms 2128 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 304 KB Output is correct
16 Correct 0 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 212 KB Output is correct
20 Correct 260 ms 2208 KB Output is correct
21 Correct 256 ms 2124 KB Output is correct
22 Correct 236 ms 2112 KB Output is correct
23 Correct 216 ms 2348 KB Output is correct
24 Correct 213 ms 2120 KB Output is correct
25 Correct 251 ms 2112 KB Output is correct
26 Correct 264 ms 2156 KB Output is correct
27 Correct 5 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 2 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 0 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 0 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 2 ms 340 KB Output is correct
44 Correct 6 ms 340 KB Output is correct
45 Correct 6 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 74 ms 2012 KB Output is correct
3 Correct 62 ms 2012 KB Output is correct
4 Correct 44 ms 2092 KB Output is correct
5 Correct 70 ms 1996 KB Output is correct
6 Correct 46 ms 1984 KB Output is correct
7 Correct 74 ms 2128 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 304 KB Output is correct
16 Correct 0 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 212 KB Output is correct
20 Correct 260 ms 2208 KB Output is correct
21 Correct 256 ms 2124 KB Output is correct
22 Correct 236 ms 2112 KB Output is correct
23 Correct 216 ms 2348 KB Output is correct
24 Correct 213 ms 2120 KB Output is correct
25 Correct 251 ms 2112 KB Output is correct
26 Correct 264 ms 2156 KB Output is correct
27 Correct 5 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 2 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 0 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 0 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 2 ms 340 KB Output is correct
44 Correct 6 ms 340 KB Output is correct
45 Correct 6 ms 340 KB Output is correct
46 Correct 48 ms 340 KB Output is correct
47 Correct 733 ms 2508 KB Output is correct
48 Correct 455 ms 2444 KB Output is correct
49 Correct 467 ms 2236 KB Output is correct
50 Correct 597 ms 2988 KB Output is correct
51 Correct 622 ms 2648 KB Output is correct
52 Correct 677 ms 2628 KB Output is correct
53 Correct 704 ms 2908 KB Output is correct
54 Correct 331 ms 852 KB Output is correct
55 Correct 382 ms 856 KB Output is correct
56 Correct 420 ms 972 KB Output is correct
57 Correct 389 ms 852 KB Output is correct
58 Correct 416 ms 860 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 74 ms 2012 KB Output is correct
3 Correct 62 ms 2012 KB Output is correct
4 Correct 44 ms 2092 KB Output is correct
5 Correct 70 ms 1996 KB Output is correct
6 Correct 46 ms 1984 KB Output is correct
7 Correct 74 ms 2128 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 304 KB Output is correct
16 Correct 0 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 212 KB Output is correct
20 Correct 260 ms 2208 KB Output is correct
21 Correct 256 ms 2124 KB Output is correct
22 Correct 236 ms 2112 KB Output is correct
23 Correct 216 ms 2348 KB Output is correct
24 Correct 213 ms 2120 KB Output is correct
25 Correct 251 ms 2112 KB Output is correct
26 Correct 264 ms 2156 KB Output is correct
27 Correct 5 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 2 ms 340 KB Output is correct
35 Correct 7 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 0 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 0 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 2 ms 340 KB Output is correct
44 Correct 6 ms 340 KB Output is correct
45 Correct 6 ms 340 KB Output is correct
46 Correct 48 ms 340 KB Output is correct
47 Correct 733 ms 2508 KB Output is correct
48 Correct 455 ms 2444 KB Output is correct
49 Correct 467 ms 2236 KB Output is correct
50 Correct 597 ms 2988 KB Output is correct
51 Correct 622 ms 2648 KB Output is correct
52 Correct 677 ms 2628 KB Output is correct
53 Correct 704 ms 2908 KB Output is correct
54 Correct 331 ms 852 KB Output is correct
55 Correct 382 ms 856 KB Output is correct
56 Correct 420 ms 972 KB Output is correct
57 Correct 389 ms 852 KB Output is correct
58 Correct 416 ms 860 KB Output is correct
59 Correct 3590 ms 4452 KB Output is correct
60 Execution timed out 4051 ms 6920 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 50 ms 448 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 4083 ms 33108 KB Time limit exceeded
6 Halted 0 ms 0 KB -