# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218626 | MKopchev | Political Development (BOI17_politicaldevelopment) | C++14 | 545 ms | 28932 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 nmax=5e4+42,kmax=20;
int n,k;
set<int> adj[nmax];
priority_queue< pair<int/*size*/,int/*node*/> > pq;
int output;
int active[kmax],pointer=0;
int bitmasks[nmax];
void solve(int node)
{
active[0]=node;
pointer=1;
for(auto k:adj[node])
{
active[pointer]=k;
pointer++;
}
for(int i=0;i<pointer;i++)
bitmasks[i]=0;
for(int i=0;i<pointer;i++)
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... |