# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784557 | thimote75 | Council (JOI23_council) | C++14 | 1443 ms | 68648 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 idata = vector<int>;
using igrid = vector<idata>;
using pii = pair<int, int>;
int N, M;
void show_mask (int mask) {
for (int i = 0; i < M; i ++)
cout << (((1 << i) & mask) >> i);
}
struct MaskData {
int maxsize = 0;
pii n1 = { 0, - 1 };
pii n2 = { 0, - 1 };
void setMask (int i) {
maxsize = 0;
for (int u = 0; u < M; u ++)
if ((1 << u) & i)
maxsize ++;
}
int get (int node) {
if (n1.second == node) return n2.first;
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... |