Submission #1080071

#TimeUsernameProblemLanguageResultExecution timeMemory
1080071Faisal_Saqib기지국 (IOI20_stations)C++17
10 / 100
602 ms1020 KiB
#include "stations.h" #include <vector> #include <bits/stdc++.h> using namespace std; // #define int long long 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*8ll)+y,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]); } dfs(0,0,-1); return labels; } int find_next_station(int s, int t, std::vector<int> c) { int last=t; while(t>0) { t=t/8; if(t==s) return last; last=t; } return (s/8); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...