# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
618868 | 2022-08-02T08:03:15 Z | Zanite | Dynamic Diameter (CEOI19_diameter) | C++17 | 181 ms | 7936 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; using Edge = pair<ll, pll>; #define fi first #define se second const int maxN = 1e5 + 5; ll n, q, w; ll id[maxN], dist[maxN]; multiset<ll> dpq; int main() { scanf("%lld %lld %lld", &n, &q, &w); dpq.insert(0); for (ll a, b, c, i = 1; i < n; i++) { scanf("%lld %lld %lld", &a, &b, &c); if (b == 1) swap(a, b); id[i-1] = b; dist[b] = c; dpq.insert(c); } ll last = 0; for (ll d, e, i = 1; i <= q; i++) { scanf("%lld %lld", &d, &e); d = (d + last) % (n - 1); e = (e + last) % w; ll change = id[d]; dpq.erase(dpq.lower_bound(dist[change])); dist[change] = e; dpq.insert(e); auto it = dpq.rbegin(); last = *it; it++; last += *it; printf("%lld\n", last); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 11 ms | 340 KB | Output is correct |
5 | Correct | 53 ms | 720 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 1 ms | 340 KB | Output is correct |
9 | Correct | 2 ms | 340 KB | Output is correct |
10 | Correct | 12 ms | 388 KB | Output is correct |
11 | Correct | 48 ms | 756 KB | Output is correct |
12 | Correct | 4 ms | 596 KB | Output is correct |
13 | Correct | 3 ms | 596 KB | Output is correct |
14 | Correct | 4 ms | 596 KB | Output is correct |
15 | Correct | 13 ms | 708 KB | Output is correct |
16 | Correct | 55 ms | 1008 KB | Output is correct |
17 | Correct | 60 ms | 6516 KB | Output is correct |
18 | Correct | 64 ms | 6488 KB | Output is correct |
19 | Correct | 71 ms | 6460 KB | Output is correct |
20 | Correct | 79 ms | 6620 KB | Output is correct |
21 | Correct | 153 ms | 7116 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 181 ms | 7936 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |