| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 23149 | kdh9949 | Saveit (IOI10_saveit) | C++14 | 275 ms | 11608 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"
#include <bits/stdc++.h>
using namespace std;
static int n, h, p[1010], md[1010], v[1010];
static vector<int> e[1010], t[1010];
static queue<int> q;
void dfs(int x){
for(auto &i : e[x]){
if(p[i] != -1) continue;
p[i] = x;
dfs(i);
}
}
void fil(int x, int p){
for(auto &i : t[x]){
if(i == p) continue;
v[i] = md[i] - md[x] + 1;
fil(i, x);
}
}
void bfs(int x){
fill(md, md + n, 1e9);
md[x] = 0;
q.push(x);
while(!q.empty()){
| # | 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... | ||||