#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
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:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
46 | main() {
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
15 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 |
4030 ms |
33148 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
15 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 |
4030 ms |
33148 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
60 ms |
2012 KB |
Output is correct |
3 |
Correct |
81 ms |
2064 KB |
Output is correct |
4 |
Correct |
48 ms |
1992 KB |
Output is correct |
5 |
Correct |
68 ms |
2068 KB |
Output is correct |
6 |
Correct |
46 ms |
2044 KB |
Output is correct |
7 |
Correct |
74 ms |
2068 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 |
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 |
0 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
60 ms |
2012 KB |
Output is correct |
3 |
Correct |
81 ms |
2064 KB |
Output is correct |
4 |
Correct |
48 ms |
1992 KB |
Output is correct |
5 |
Correct |
68 ms |
2068 KB |
Output is correct |
6 |
Correct |
46 ms |
2044 KB |
Output is correct |
7 |
Correct |
74 ms |
2068 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 |
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 |
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 |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
244 ms |
2124 KB |
Output is correct |
21 |
Correct |
216 ms |
2108 KB |
Output is correct |
22 |
Correct |
222 ms |
2044 KB |
Output is correct |
23 |
Correct |
200 ms |
2420 KB |
Output is correct |
24 |
Correct |
228 ms |
2112 KB |
Output is correct |
25 |
Correct |
237 ms |
2120 KB |
Output is correct |
26 |
Correct |
261 ms |
2060 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
1 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 |
3 ms |
340 KB |
Output is correct |
37 |
Correct |
0 ms |
340 KB |
Output is correct |
38 |
Correct |
1 ms |
344 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 |
3 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
60 ms |
2012 KB |
Output is correct |
3 |
Correct |
81 ms |
2064 KB |
Output is correct |
4 |
Correct |
48 ms |
1992 KB |
Output is correct |
5 |
Correct |
68 ms |
2068 KB |
Output is correct |
6 |
Correct |
46 ms |
2044 KB |
Output is correct |
7 |
Correct |
74 ms |
2068 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 |
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 |
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 |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
244 ms |
2124 KB |
Output is correct |
21 |
Correct |
216 ms |
2108 KB |
Output is correct |
22 |
Correct |
222 ms |
2044 KB |
Output is correct |
23 |
Correct |
200 ms |
2420 KB |
Output is correct |
24 |
Correct |
228 ms |
2112 KB |
Output is correct |
25 |
Correct |
237 ms |
2120 KB |
Output is correct |
26 |
Correct |
261 ms |
2060 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
1 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 |
3 ms |
340 KB |
Output is correct |
37 |
Correct |
0 ms |
340 KB |
Output is correct |
38 |
Correct |
1 ms |
344 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 |
3 ms |
340 KB |
Output is correct |
46 |
Correct |
15 ms |
472 KB |
Output is correct |
47 |
Correct |
434 ms |
2532 KB |
Output is correct |
48 |
Correct |
347 ms |
2308 KB |
Output is correct |
49 |
Correct |
351 ms |
2308 KB |
Output is correct |
50 |
Correct |
356 ms |
2916 KB |
Output is correct |
51 |
Correct |
352 ms |
2536 KB |
Output is correct |
52 |
Correct |
441 ms |
2584 KB |
Output is correct |
53 |
Correct |
438 ms |
2900 KB |
Output is correct |
54 |
Correct |
99 ms |
852 KB |
Output is correct |
55 |
Correct |
118 ms |
852 KB |
Output is correct |
56 |
Correct |
128 ms |
852 KB |
Output is correct |
57 |
Correct |
131 ms |
852 KB |
Output is correct |
58 |
Correct |
126 ms |
852 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
60 ms |
2012 KB |
Output is correct |
3 |
Correct |
81 ms |
2064 KB |
Output is correct |
4 |
Correct |
48 ms |
1992 KB |
Output is correct |
5 |
Correct |
68 ms |
2068 KB |
Output is correct |
6 |
Correct |
46 ms |
2044 KB |
Output is correct |
7 |
Correct |
74 ms |
2068 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 |
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 |
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 |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
244 ms |
2124 KB |
Output is correct |
21 |
Correct |
216 ms |
2108 KB |
Output is correct |
22 |
Correct |
222 ms |
2044 KB |
Output is correct |
23 |
Correct |
200 ms |
2420 KB |
Output is correct |
24 |
Correct |
228 ms |
2112 KB |
Output is correct |
25 |
Correct |
237 ms |
2120 KB |
Output is correct |
26 |
Correct |
261 ms |
2060 KB |
Output is correct |
27 |
Correct |
2 ms |
340 KB |
Output is correct |
28 |
Correct |
1 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 |
3 ms |
340 KB |
Output is correct |
37 |
Correct |
0 ms |
340 KB |
Output is correct |
38 |
Correct |
1 ms |
344 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 |
3 ms |
340 KB |
Output is correct |
46 |
Correct |
15 ms |
472 KB |
Output is correct |
47 |
Correct |
434 ms |
2532 KB |
Output is correct |
48 |
Correct |
347 ms |
2308 KB |
Output is correct |
49 |
Correct |
351 ms |
2308 KB |
Output is correct |
50 |
Correct |
356 ms |
2916 KB |
Output is correct |
51 |
Correct |
352 ms |
2536 KB |
Output is correct |
52 |
Correct |
441 ms |
2584 KB |
Output is correct |
53 |
Correct |
438 ms |
2900 KB |
Output is correct |
54 |
Correct |
99 ms |
852 KB |
Output is correct |
55 |
Correct |
118 ms |
852 KB |
Output is correct |
56 |
Correct |
128 ms |
852 KB |
Output is correct |
57 |
Correct |
131 ms |
852 KB |
Output is correct |
58 |
Correct |
126 ms |
852 KB |
Output is correct |
59 |
Correct |
1268 ms |
4360 KB |
Output is correct |
60 |
Correct |
2642 ms |
5132 KB |
Output is correct |
61 |
Correct |
2701 ms |
7272 KB |
Output is correct |
62 |
Correct |
2694 ms |
7672 KB |
Output is correct |
63 |
Correct |
1348 ms |
9124 KB |
Output is correct |
64 |
Correct |
3226 ms |
11080 KB |
Output is correct |
65 |
Correct |
3255 ms |
11508 KB |
Output is correct |
66 |
Correct |
2749 ms |
11468 KB |
Output is correct |
67 |
Correct |
2844 ms |
11376 KB |
Output is correct |
68 |
Execution timed out |
4006 ms |
11588 KB |
Time limit exceeded |
69 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
15 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 |
4030 ms |
33148 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |