# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62654 | aome | Saveit (IOI10_saveit) | C++17 | 438 ms | 12520 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 const int M = 36;
static const int N = 1000;
static int par[N];
static int dis[M][N];
static vector<int> G[N];
static void dfs(int u) {
for (auto v : G[u]) {
if (par[v] == -1) par[v] = u, dfs(v);
}
}
static void bfs(int r) {
queue<int> qu;
qu.push(r), dis[r][r] = 0;
while (qu.size()) {
int u = qu.front(); qu.pop();
for (auto v : G[u]) {
if (dis[r][v] == -1) {
dis[r][v] = dis[r][u] + 1, qu.push(v);
}
}
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... |