oj.uz

Submission #1086814

# Submission time Handle Problem Language Result Execution time Memory
1086814 2024-09-11T14:11:40 Z binminh01 Council (JOI23_council) C++17
6 / 100
 194 ms 47952 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

struct node {
    int m, n, i, j;
    node(int m = -1, int n = -1, int i = -1, int j = -1): m(m), n(n), i(i), j(j) {}
};
int a[300000][20], b[300000], c[20], n, m;
node f[1 << 20];
void upd(int i, pii v) {
    if (v.second == f[i].i || v.second == f[i].j) return;
    if (v.second != f[i].i && v.first > f[i].m) f[i].n = f[i].m, f[i].j = f[i].i, tie(f[i].m, f[i].i) = v;
    else if (v.second != f[i].j && v.first > f[i].n) tie(f[i].n, f[i].j) = v;
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    cin >> n >> m;
    For(i,0,n){
        For(j,0,m){
            cin >> a[i][j];
            if (a[i][j]) ++c[j];
            else b[i]^=1 << j;
        }
        upd(b[i], {popcount(b[i]), i});
    }
    Fore(i,(1<<m)-1,0){
        For(j,0,m){
            if ((i >> j) & 1) upd(i^(1 << j), {f[i].m - 1, f[i].i}), upd(i^(1 << j), {f[i].n - 1, f[i].j});
        }
    }
    For(i,0,1<<m){
        For(j,0,m){
            if ((i >> j) & 1) upd(i, {f[i^(1 << j)].m, f[i^(1 << j)].i}), upd(i, {f[i^(1 << j)].n, f[i^(1 << j)].j});
        }
    }
    int l = n >> 1;
    For(i,0,n){
        int x = 0, t = 0, w = 0;
        For(j,0,m){
            c[j]-=a[i][j];
            if (c[j] > l) ++x;
            if (c[j] == l) w^=1 << j;
        }
        if (f[w].i != i) t = f[w].m;
        else t = f[w].n;
        cout << x + t << '\n';
        For(j,0,m) c[j]+=a[i][j];
    }
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16732 KB Output is correct
2 Incorrect 8 ms 16732 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16732 KB Output is correct
2 Incorrect 8 ms 16732 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 55 ms 40812 KB Output is correct
3 Correct 50 ms 43060 KB Output is correct
4 Correct 43 ms 42580 KB Output is correct
5 Correct 56 ms 43236 KB Output is correct
6 Correct 45 ms 42580 KB Output is correct
7 Correct 56 ms 43084 KB Output is correct
8 Correct 7 ms 16732 KB Output is correct
9 Correct 8 ms 16804 KB Output is correct
10 Correct 7 ms 16768 KB Output is correct
11 Correct 8 ms 16860 KB Output is correct
12 Correct 9 ms 16732 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16728 KB Output is correct
15 Correct 7 ms 16732 KB Output is correct
16 Correct 8 ms 16884 KB Output is correct
17 Correct 9 ms 17140 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 55 ms 40812 KB Output is correct
3 Correct 50 ms 43060 KB Output is correct
4 Correct 43 ms 42580 KB Output is correct
5 Correct 56 ms 43236 KB Output is correct
6 Correct 45 ms 42580 KB Output is correct
7 Correct 56 ms 43084 KB Output is correct
8 Correct 7 ms 16732 KB Output is correct
9 Correct 8 ms 16804 KB Output is correct
10 Correct 7 ms 16768 KB Output is correct
11 Correct 8 ms 16860 KB Output is correct
12 Correct 9 ms 16732 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16728 KB Output is correct
15 Correct 7 ms 16732 KB Output is correct
16 Correct 8 ms 16884 KB Output is correct
17 Correct 9 ms 17140 KB Output is correct
18 Correct 8 ms 16668 KB Output is correct
19 Correct 8 ms 16732 KB Output is correct
20 Correct 149 ms 47764 KB Output is correct
21 Correct 139 ms 47188 KB Output is correct
22 Correct 149 ms 47184 KB Output is correct
23 Correct 148 ms 46892 KB Output is correct
24 Correct 159 ms 47788 KB Output is correct
25 Correct 148 ms 47952 KB Output is correct
26 Correct 194 ms 47948 KB Output is correct
27 Incorrect 8 ms 16792 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 55 ms 40812 KB Output is correct
3 Correct 50 ms 43060 KB Output is correct
4 Correct 43 ms 42580 KB Output is correct
5 Correct 56 ms 43236 KB Output is correct
6 Correct 45 ms 42580 KB Output is correct
7 Correct 56 ms 43084 KB Output is correct
8 Correct 7 ms 16732 KB Output is correct
9 Correct 8 ms 16804 KB Output is correct
10 Correct 7 ms 16768 KB Output is correct
11 Correct 8 ms 16860 KB Output is correct
12 Correct 9 ms 16732 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16728 KB Output is correct
15 Correct 7 ms 16732 KB Output is correct
16 Correct 8 ms 16884 KB Output is correct
17 Correct 9 ms 17140 KB Output is correct
18 Correct 8 ms 16668 KB Output is correct
19 Correct 8 ms 16732 KB Output is correct
20 Correct 149 ms 47764 KB Output is correct
21 Correct 139 ms 47188 KB Output is correct
22 Correct 149 ms 47184 KB Output is correct
23 Correct 148 ms 46892 KB Output is correct
24 Correct 159 ms 47788 KB Output is correct
25 Correct 148 ms 47952 KB Output is correct
26 Correct 194 ms 47948 KB Output is correct
27 Incorrect 8 ms 16792 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 55 ms 40812 KB Output is correct
3 Correct 50 ms 43060 KB Output is correct
4 Correct 43 ms 42580 KB Output is correct
5 Correct 56 ms 43236 KB Output is correct
6 Correct 45 ms 42580 KB Output is correct
7 Correct 56 ms 43084 KB Output is correct
8 Correct 7 ms 16732 KB Output is correct
9 Correct 8 ms 16804 KB Output is correct
10 Correct 7 ms 16768 KB Output is correct
11 Correct 8 ms 16860 KB Output is correct
12 Correct 9 ms 16732 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 8 ms 16728 KB Output is correct
15 Correct 7 ms 16732 KB Output is correct
16 Correct 8 ms 16884 KB Output is correct
17 Correct 9 ms 17140 KB Output is correct
18 Correct 8 ms 16668 KB Output is correct
19 Correct 8 ms 16732 KB Output is correct
20 Correct 149 ms 47764 KB Output is correct
21 Correct 139 ms 47188 KB Output is correct
22 Correct 149 ms 47184 KB Output is correct
23 Correct 148 ms 46892 KB Output is correct
24 Correct 159 ms 47788 KB Output is correct
25 Correct 148 ms 47952 KB Output is correct
26 Correct 194 ms 47948 KB Output is correct
27 Incorrect 8 ms 16792 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16732 KB Output is correct
2 Incorrect 8 ms 16732 KB Output isn't correct
3 Halted 0 ms 0 KB -