# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205227 | stefdasca | Saveit (IOI10_saveit) | C++14 | 263 ms | 11496 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;
vector<int> v[1002];
int dist[40][1002], tt[1002], state[1002];
bool viz[1002];
void dfs(int dad, int nod)
{
viz[nod] = 1;
tt[nod] = dad;
for(int i = 0; i < v[nod].size(); ++i)
if(!viz[v[nod][i]])
dfs(nod, v[nod][i]);
}
void encode(int n, int h, int m, int *a, int *b)
{
for(int i = 0; i < m; ++i)
{
v[a[i]].push_back(b[i]);
v[b[i]].push_back(a[i]);
}
dfs(0, 0);
for(int i = 0; i < n; ++i)
for(int j = 0; j <= 9; ++j)
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... |