# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839984 | 2023-08-31T00:09:39 Z | math_rabbit_1028 | Closing Time (IOI23_closing) | C++17 | 72 ms | 21240 KB |
#include "closing.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> pll; int n, x, y, ch[202020], ans; ll k; vector<pll> adj[202020]; priority_queue<pll> pq; void add(int v, int w) { ch[x] = 1; for (int i = 0; i < adj[x].size(); i++) { if (ch[adj[x][i].first] == 1) continue; pq.push({-adj[x][i].second - w, adj[x][i].first}); } } int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) { n = N, x = X, y = Y, k = K; ans = 0; for (int i = 0; i < n; i++) ch[i] = 0; for (int i = 0; i < n; i++) adj[i].clear(); for (int i = 0; i < U.size(); i++) { adj[U[i]].push_back({V[i], W[i]}); adj[V[i]].push_back({U[i], W[i]}); } add(x, 0); add(y, 0); while (!pq.empty()) { int v = pq.top().second; ll w = -pq.top().first; pq.pop(); //cout << v << " " << w << "\n"; if (k - w >= 0) { ans++; k -= w; } else break; add(v, w); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 72 ms | 21240 KB | 1st lines differ - on the 1st token, expected: '451', found: '11275' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '3', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '3', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '3', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 4948 KB | 1st lines differ - on the 1st token, expected: '6', found: '4' |
2 | Halted | 0 ms | 0 KB | - |