Submission #604951

#TimeUsernameProblemLanguageResultExecution timeMemory
604951lcjStations (IOI20_stations)C++17
0 / 100
419 ms59428 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; #include "stations.h" #define fi first #define se second int cnt = -1; void dfs(int cn, vector<int> &tin, vector<int> tout, vector<vector<int>> neighbours) { tin[cn] = ++cnt; for (int nn : neighbours[cn]) { if (tin[nn] != -1) continue; dfs(nn, tin, tout, neighbours); } tout[cn] = cnt; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> labels(n, -1); vector<vector<int>> adj(n); for (int i = 0; i < u.size(); i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } vector<int> tin(n, -1); vector<int> tout(n, -1); dfs(0, tin, tout, adj); for (int i = 0; i < n; i++) { labels[i] = tin[i]*1000+tout[i]; } return labels; } int find_next_station(int s, int t, vector<int> c) { pii m = {s / 1000, s % 1000}; pii o = {t / 1000, t % 1000}; vector<pii> vals; for (int i : c) { vals.push_back({i/1000, i % 1000}); } sort(vals.begin(), vals.end()); if (o.fi < m.fi || o.fi > vals.back().se) { return vals[0].fi*1000+vals[0].se; } for (int i = 1; i < vals.size(); i++) { if (vals[i].fi <= o.fi && o.fi <= vals[i].se) { return vals[i].fi*1000+vals[i].se; } } assert(false); return c[0]; }

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = 0; i < u.size(); i++)
      |                     ~~^~~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:53:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for (int i = 1; i < vals.size(); i++)
      |                     ~~^~~~~~~~~~~~~
#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...