Submission #308351

#TimeUsernameProblemLanguageResultExecution timeMemory
308351chubyxdxd기지국 (IOI20_stations)C++17
5 / 100
1168 ms1024 KiB
#include "stations.h" #include <bits/stdc++.h> #include <vector> using namespace std; vector<vector<int>> G; vector<int> gg; vector<int> labels; int id=0; void dfs(int node,int pad){ labels[node]=id; id++; for(auto i:G[node]){ if(i==pad)continue; dfs(i,node); } } vector<int> label(int n, int k,vector<int> u,vector<int> v) { G.clear(); id=0; G.assign(n+10,vector<int>()); for(int i=0;i<int(u.size());i++){ G[u[i]].push_back(v[i]); G[v[i]].push_back(u[i]); } int piv=0; labels.assign(n,0); for(int i=0;i<n;i++){ if(G[i].size()==1){ dfs(i,-1); break; } } return labels; } int find_next_station(int s, int t,vector<int> c) { if(int(c.size())==1)return c[0]; if(s<t)return max(c[0],c[1]); else return min(c[0],c[1]); }

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:25:7: warning: unused variable 'piv' [-Wunused-variable]
   25 |   int piv=0;
      |       ^~~
#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...