Submission #842253

#TimeUsernameProblemLanguageResultExecution timeMemory
842253omeganotClosing Time (IOI23_closing)C++17
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int MOD = 1E9 + 7; const int INF = 1E9; const ll INFLL = 1E18; const int MAX = 2E5; int N; int X; int Y; int K; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int C; cin >> C; for(int test = 1; test <= C; test++) { cin >> N >> X >> Y >> K; vector<ll> dist(N, INFLL); vector<vector<array<int, 2>>> adj(N); for(int i = 0; i + 1 < N; i++) { int U; int V; int W; cin >> U >> V >> W; U--; V--; adj[U].push_back({V, W}); adj[V].push_back({U, W}); } dist[X] = 0; dist[Y] = 0; priority_queue<array<ll, 2>, vector<array<ll, 2>>, greater<array<ll, 2>>> pq; pq.push({0, X}); pq.push({0, Y}); while(pq.size()) { array<ll, 2> x = pq.top(); if(x[0] != dist[x[1]]) { continue; } for(array<int, 2> i : adj[x[1]]) { if(dist[i[0]] > dist[x[1]] + i[1]) { dist[i[0]] = dist[x[1]] + i[1]; pq.push({dist[i[0]], i[0]}); } } } sort(dist.begin(), dist.end()); int ans = 0; ll sum = 0; for(ll i : dist) { if(sum + i <= K) { sum += i; ans++; } } cout << ans << "\n"; } }

Compilation message (stderr)

/usr/bin/ld: /tmp/ccps60J3.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cc4Axy73.o:closing.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccps60J3.o: in function `main':
grader.cpp:(.text.startup+0x6a1): undefined reference to `max_score(int, int, int, long long, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status