Submission #354622

#TimeUsernameProblemLanguageResultExecution timeMemory
354622Dilshod_ImomovStations (IOI20_stations)C++17
0 / 100
995 ms736 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7; vector < int > lb, adj[N], used(N); int num; void dfs( int v ) { used[v] = 1; lb[v] = num++; for ( auto u: adj[v] ) { if ( !used[u] ) { dfs(u); } } } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { for ( int i = 0; i < n - 1; i++ ) { int x = u[i], y = v[i]; adj[x].push_back(y); adj[y].push_back(x); } lb.assign(n, 0); dfs(0); return lb; } int find_next_station(int s, int t, std::vector<int> c) { int pr = c[0]; for ( auto x: c ) { if ( x == pr ) { continue; } if ( x > t ) { break; } pr = x; } return pr; }
#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...