| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 45129 | tjd229 | Saveit (IOI10_saveit) | C++11 | 276 ms | 13656 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 "grader.h"
#include "encoder.h"
int p[1000];
int visit[1000];
int edge[1000][1000];
int tail[1000];
int dist[36][1000];
int q[1000];
int front;
int back;
void bfs(int nv, int src){
visit[src] = src + 1;
dist[src][src] = 0;
front = back = 0;
q[back++] = src;
int i;
while (front != back){
int curr = q[front++];
for (i = 0; i < tail[curr]; i++){
int nxt = edge[curr][i];
if (visit[nxt] != src + 1){
visit[nxt] = src + 1;
q[back++] = nxt;
p[nxt] = curr;
dist[src][nxt] = dist[src][curr] + 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||