Submission #556749

#TimeUsernameProblemLanguageResultExecution timeMemory
556749jeroenodbTeleporters (IOI08_teleporters)C++14
Compilation error
0 ms0 KiB
#include <iostream> #include <vector> #include <algorithm> #include <deque> #include <set> #include <string> #include <numeric> #include <cmath> #include <cassert> #include <array> #include <numeric> using namespace std; using ll = long long; const ll INF = 1e18; int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; vector<pair<int, int>> we(n); vector<pair<int, int>> closest; for (int i = 0; i < n; ++i) { cin >> we[i].first >> we[i].second; closest.push_back({we[i].first, i * 2}); closest.push_back({we[i].second, i * 2 + 1}); } sort(closest.begin(), closest.end()); vector<int> adj(2 * n, -1); for (int i = 0; i < n; ++i) { auto it = upper_bound(closest.begin(), closest.end(), pair(we[i].second, (int)1e9)); if (it != closest.end()) adj[2 * i] = it->second; it = upper_bound(closest.begin(), closest.end(), pair(we[i].first, (int)1e9)); if (it != closest.end()) adj[2 * i + 1] = it->second; } int start = closest.front().second; vector<bool> used(2 * n); auto dfs = [&adj, &used](auto self, int v) -> int { int res=0; while(v!=-1 and !used[v]) { used[v]=true; v = adj[v]; res+=1; } return res; }; int res = dfs(dfs, start); vector<int> comps; for (int i = 0; i < 2 * n; ++i) if (!used[i]) comps.push_back(dfs(dfs, i)); sort(comps.rbegin(), comps.rend()); for (int i = 0; i < min(m, (int)comps.size()); ++i) res += comps[i] + 2; m -= (int)comps.size(); m = max(m, 0); res += 2 * (m - m % 2); res += m % 2; cout << res; return 0; }

Compilation message (stderr)

teleporters.cpp: In function 'int main()':
teleporters.cpp:36:67: error: missing template arguments before '(' token
   36 |         auto it = upper_bound(closest.begin(), closest.end(), pair(we[i].second, (int)1e9));
      |                                                                   ^
teleporters.cpp:38:62: error: missing template arguments before '(' token
   38 |         it = upper_bound(closest.begin(), closest.end(), pair(we[i].first, (int)1e9));
      |                                                              ^