제출 #853411

#제출 시각아이디문제언어결과실행 시간메모리
853411nnin기지국 (IOI20_stations)C++14
0 / 100
3129 ms2097152 KiB
#include "stations.h" #include <vector> #include<bits/stdc++.h> using namespace std; vector<int> adj[1005]; void dfs(int cur, int prev, int num, vector<int>& l) { l[cur] = num; for(int next:adj[cur]) { if(next==prev) continue; dfs(next, cur, num+1, l); } } vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> labels(n); for(int i=0;i<n-1;i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } for(int i=0;i<n;i++) { if(adj[i].size()==1) { dfs(i, -1, 0, labels); break; } } return labels; } int find_next_station(int s, int t, std::vector<int> c) { if(t>s) return s+1; else return s-1; }
#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...