# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871333 | andrei_boaca | 기지국 (IOI20_stations) | C++17 | 487 ms | 940 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 <bits/stdc++.h>
#include <vector>
//#include "stub.cpp"
using namespace std;
vector<int> muchii[1005];
bool use[1005];
int n,k;
vector<int> ord;
vector<int> L;
int ch,ind;
void dfs(int nod)
{
ind++;
use[nod]=1;
L[nod]=ch*1000+ind;
for(int i:muchii[nod])
if(!use[i])
dfs(i);
}
std::vector<int> label(int N, int K, std::vector<int> u, std::vector<int> v)
{
n=N;
k=K;
L.clear();
L.resize(n);
ord.clear();
for(int i=0;i<n;i++)
{
use[i]=0;
muchii[i].clear();
}
for(int i=0;i<u.size();i++)
{
int a=u[i];
int b=v[i];
muchii[a].push_back(b);
muchii[b].push_back(a);
}
int root=-1;
for(int i=0;i<n;i++)
if(muchii[i].size()>2)
{
root=i;
break;
}
for(int i=0;i<n;i++)
if(muchii[i].size()==1)
{
root=i;
break;
}
L[root]=0;
use[root]=1;
ch=0;
ind=0;
for(int i:muchii[root])
{
ch++;
ind=0;
dfs(i);
}
return L;
}
int find_next_station(int s, int t, std::vector<int> c)
{
if(s==0)
{
for(int i:c)
if(i/1000==t/1000)
return i;
}
if(s/1000!=t/1000||(s/1000==t/1000&&s>t))
return min(c[0],c[1]);
return max(c[0],c[1]);
}
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... |