# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795105 | vjudge1 | Council (JOI23_council) | C++17 | 4046 ms | 46152 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;
using ll = long long;
const int N = 300000;
const int M = 20;
int n, m;
int a[N];
int pr[(1 << M)][5];
vector<int> v[(1 << M)];
void add(int i) {
int x = (((1 << m) - 1) ^ a[i]);
if((int)v[x].size() == 2) return;
for(int msk = x; msk > 0; msk = ((msk - 1) & x)) {
if(v[msk].size() == 2) continue;
if(v[msk].empty() || v[msk].back() != i)
v[msk].push_back(i);
}
}
int func(int msk, int i) {
return __builtin_popcount((msk & a[i]));
}
int T = (1 << 0) + (1 << 3) + (1 << 6) + (1 << 7) + (1 << 8) + (1 << 10);
void add1(int msk, int i) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |