| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 60481 | aquablitz11 | Saveit (IOI10_saveit) | C++14 | 292 ms | 11592 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>
#include "grader.h"
#include "encoder.h"
using namespace std;
static const int N = 1000;
static vector<int> G[N];
static bool vis[N];
static int par[N], dist[N];
void build_tree(int u, int p)
{
vis[u] = true;
par[u] = p;
for (auto v : G[u]) if (v != p && !vis[v])
build_tree(v, u);
}
void bfs(int s)
{
dist[s] = 0;
vis[s] = true;
queue<int> Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (auto v : G[u]) if (!vis[v]) {
vis[v] = true;
dist[v] = dist[u]+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... | ||||