# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758888 | ProtonDecay314 | Voting Cities (NOI22_votingcity) | C++17 | 350 ms | 93796 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;
typedef long long ll;
typedef pair<ll, ll> pll;
struct node {
ll i;
ll S;
ll ind() {
return (i << 5ll) | S;
}
};
node node_from_ind(ll ind) {
node e = {ind >> 5ll, ind & 0b11111};
return e;
}
int main() {
ll n, e, k;
cin >> n >> e >> k;
const ll num_tickets = 5ll;
const ll ticket_combs = 1ll << num_tickets;
vector<vector<pll>> out_adj;
vector<vector<pll>> in_adj;
out_adj.reserve(n * ticket_combs);
in_adj.reserve(n * ticket_combs);
for(ll i = 0ll; i < n * ticket_combs; i++) {
vector<pll> out_row;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |