| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 815563 | happypotato | Council (JOI23_council) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (dpf[dpb[ncur].ff] == dpf[conf]) continue;
} else if (cur == 0) {
cur = dpb[ncur].ff;
} else if (dpf[cur] != dpf[dpb[ncur].ff]) {
if (dpf[conf] == 0) {
// take larger one
if (comp(cur, dpb[ncur].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[ncur].ff;
}
} else {
// take smaller one
if (comp(cur, dpb[ncur].ff)) {
if (comp(cur, dpb[conf].ss)) {
dpb[conf].ss = cur;
}
} else {
if (comp(dpb[ncur].ff, dpb[conf].ss)) {
dpb[conf].ss = dpb[ncur].ff;
}
cur = dpb[ncur].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();
}