# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727415 | model_code | Council (JOI23_council) | C++17 | 1373 ms | 104344 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 <array>
#include <bitset>
#include <iostream>
#include <vector>
using namespace std;
constexpr int N_MAX = 3e5, M_MAX = 20;
int popcnt(int x) { return bitset<32>(x).count(); }
int read() {
int x;
scanf("%d", &x);
return x;
}
int A[N_MAX], agree[M_MAX], sum[1 << M_MAX][M_MAX], mn[1 << M_MAX][2];
int main() {
const int N = read(), M = read();
// 入力・巄案㷫何票㷂る㷋数㷈る
for(int i = 0; i < N; i++) {
for(int j = 0; j < M; j++) {
const int x = read();
A[i] |= x << j;
agree[j] += x;
}
}
// 巯決㷫必覷㷪票数
const int need = N / 2;
// need + 0 票㷮集巈〷need + 1 票㷮集巈〷need + 2 票以上㷮案㷮数
int zero = 0, one = 0, two = 0;
Compilation message (stderr)
# | 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... |