# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080043 | Faisal_Saqib | Stations (IOI20_stations) | C++17 | 641 ms | 944 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>
using namespace std;
const int N=1e3+100;
vector<int> ma[N];
vector<int> labels;
void dfs(int x,int v,int p)
{
labels[x]=v;
for(auto y:ma[x])
{
if(y==p)continue;
dfs(y,v+1,x);
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.resize(n,0);
for(int i=0;i<(n);i++)ma[i].clear(),labels[i]=i;
// for(int i=0;i<(n-1);i++)
// {
// ma[u[i]].push_back(v[i]);
// ma[v[i]].push_back(u[i]);
// }
// for(int i=0;i<n;i++)
// {
// if(ma[i].size()==1)
// {
// dfs(i,0,-1);
// }
// }
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
sort(begin(c),end(c));
vector<int> vip={t};
while(t>0)
{
t=(t-1)/2;
vip.push_back(t);
}
for(int j=1;j<vip.size();j++)
if(vip[j]==s)
return vip[j-1];
return (s-1)/2;
}
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... |