# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
776255 | Arturgo | Council (JOI23_council) | C++14 | 2288 ms | 186324 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;
const int MAX_M = 20;
using bits = bitset<MAX_M>;
vector<bits> votes;
list<int> submasks[(1 << MAX_M)];
vector<pair<int, int>> surmasks[(1 << MAX_M)];
void add(list<int> l[], bits mask, int sl) {
list<int>& lst = l[mask.to_ulong()];
if(lst.size() >= 2) return;
if(lst.empty()) {
lst.push_back(sl);
return;
}
if(lst.back() != sl) {
lst.push_back(sl);
return;
}
}
void add(vector<pair<int, int>> l[], bits mask, pair<int, int> sl) {
vector<pair<int, int>>& lst = l[mask.to_ulong()];
# | 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... |