Submission #306752

#TimeUsernameProblemLanguageResultExecution timeMemory
306752VEGAnnStations (IOI20_stations)C++14
0 / 100
3073 ms2097156 KiB
#include "stations.h" #include <bits/stdc++.h> #define PB push_back #define sz(x) ((int)x.size()) using namespace std; const int N = 1000; vector<int> g[N]; int tin[N], tout[N], tt = 0; void dfs(int v, int p){ tin[v] = tt++; for (int u : g[v]){ if (u == p) continue; dfs(u, v); } tout[v] = tt - 1; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { for (int i = 0; i < sz(u); i++){ g[u[i]].PB(v[i]); g[v[i]].PB(u[i]); } dfs(0, -1); vector<int> labels; labels.resize(n); for (int i = 0; i < n; i++) { labels[i] = tin[i] * N + tout[i]; // cerr << labels[i] << '\n'; } return labels; } int find_next_station(int s, int t, std::vector<int> c) { int tin_s = s / N; int tout_s = s % N; int tin_t = t / N; int tout_t = t % N; if (tin_s <= tin_t && tout_s >= tout_t){ for (int v : c) { int tin_v = v / N; int tout_v = v % N; if (tin_v > tin_s && tin_v <= tin_t && tout_v >= tout_t) return v; } } else { for (int v : c) if (v / N < tin_s) return v; } }

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
   61 | }
      | ^
#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...