# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313003 | DanerZein | Stations (IOI20_stations) | C++14 | 933 ms | 900 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 "stations.h"
#include <vector>
#include <bits/stdc++.h>
#define MAX 1000000000
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
vector<int> labels;
vector<vi>G;
int vis[1010];
// task 3
/*void dfs(int u,int ns,int d){
vis[u]=1;
labels[u]=(1000*d+ns);
for(auto &v:G[u]){
if(!vis[v]){
dfs(v,ns,d+1);
}
}
}
void asignar(int u){
int ns=1;
labels[u]=0;
memset(vis,0,sizeof vis);
vis[u]=1;
for(auto &v:G[u]){
dfs(v,ns,0);
ns++;
}
}*/
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |