# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871399 | andrei_boaca | Stations (IOI20_stations) | C++17 | 541 ms | 952 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;
const int baza=1e8;
vector<int> muchii[1005];
int in[1005],out[1005],timp;
bool use[1005];
int n,k;
vector<int> ord;
vector<int> L;
int ch,ind;
void dfs(int nod)
{
timp++;
in[nod]=timp;
use[nod]=1;
for(int i:muchii[nod])
if(!use[i])
dfs(i);
out[nod]=timp;
}
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();
timp=0;
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);
}
dfs(0);
for(int i=0;i<n;i++)
{
L[i]=in[i]*1000+out[i];
}
return L;
}
int find_next_station(int s, int t, std::vector<int> c)
{
int l1=s/1000,r1=s%1000;
int l2=t/1000,r2=t%1000;
if(l1<=l2&&r1>=r2)
{
for(auto i:c)
{
int l3=i/1000,r3=i%1000;
if(l3>l1&&l3<=l2&&r3>=r2)
return i;
}
}
return c[0];
}
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... |