| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 31566 | ngkan146 | Senior Postmen (BOI14_postmen) | C++11 | 392 ms | 26300 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 <stdio.h>
int ctrl[500005];
int nxt[1000005], prv[1000005], id[1000005];
int head[500005], en[500005];
bool visited[500005];
int n,m;
int euler[1000005], eulersize;
int q[1000005], qsize;
int read_int(){
char c;
bool check = 0;
int res = 0;
while(1){
c = getchar();
if (c == '-') {check = 1; continue;}
if (c == ' ' || c == '\n') break;
res = res*10 + c - '0';
}
if (check) return -res;
return res;
}
void dfs(){
q[qsize++] = 1;
while(qsize){
int u = q[qsize-1];
bool mjk = 0;
for(;ctrl[u];ctrl[u] = nxt[ctrl[u]]){
int v = (u ^ head[id[ctrl[u]]] ^ en[id[ctrl[u]]]);
if (visited[id[ctrl[u]]]) continue;
mjk = 1;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||