oj.uz

Submission #578793

# Submission time Handle Problem Language Result Execution time Memory
578793 2022-06-18T03:42:18 Z talant117408 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 2447 ms 21308 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

const int N = 1e5+7;
set <pair <int, ll>> graph[N];
vector <pair <pii, ll>> edges;
ll df, vf;

void find_furthest(int v, int p, ll dist = 0) {
    if (dist > df) {
        df = dist;
        vf = v;
    }
    for (auto to : graph[v]) {
        if (to.first == p) continue;
        find_furthest(to.first, v, dist+to.second);
    }
}

void solve() {
    int n, q;
    ll w;
    cin >> n >> q >> w;
    for (int i = 0; i < n-1; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        edges.pb(mp(mp(a, b), c));
        graph[a].insert(mp(b, c));
        graph[b].insert(mp(a, c));
    }
    
    if (n <= 5000) {
        ll last = 0;
        while (q--) {
            ll d, e;
            cin >> d >> e;
            d = (d + last) % (n - 1);
            e = (e + last) % w;
            auto a = edges[d].first.first, b = edges[d].first.second;
            auto &c = edges[d].second;
            graph[a].erase(graph[a].find(mp(b, c)));
            graph[b].erase(graph[b].find(mp(a, c)));
            c = e;
            graph[a].insert(mp(b, c));
            graph[b].insert(mp(a, c));
            df = vf = 0;
            find_furthest(1, 1);
            df = 0;
            find_furthest(vf, vf);
            cout << df << endl;
            last = df;
        }
    }
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}
/*

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 5020 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5016 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5020 KB Output is correct
13 Correct 3 ms 5020 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5016 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 5020 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5016 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5020 KB Output is correct
13 Correct 3 ms 5020 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5016 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 230 ms 5212 KB Output is correct
20 Correct 223 ms 5220 KB Output is correct
21 Correct 234 ms 5280 KB Output is correct
22 Correct 277 ms 5204 KB Output is correct
23 Correct 1725 ms 5972 KB Output is correct
24 Correct 1846 ms 6120 KB Output is correct
25 Correct 1945 ms 6024 KB Output is correct
26 Correct 2447 ms 6332 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 21 ms 5152 KB Output is correct
5 Correct 89 ms 6068 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5076 KB Output is correct
8 Correct 5 ms 5020 KB Output is correct
9 Correct 38 ms 5116 KB Output is correct
10 Correct 317 ms 5344 KB Output is correct
11 Correct 1459 ms 6544 KB Output is correct
12 Incorrect 6 ms 5716 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5076 KB Output is correct
2 Correct 247 ms 5376 KB Output is correct
3 Correct 1189 ms 5772 KB Output is correct
4 Correct 2360 ms 6688 KB Output is correct
5 Incorrect 7 ms 6500 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 21308 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 5020 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5016 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 5020 KB Output is correct
13 Correct 3 ms 5020 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 5016 KB Output is correct
17 Correct 3 ms 5012 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 230 ms 5212 KB Output is correct
20 Correct 223 ms 5220 KB Output is correct
21 Correct 234 ms 5280 KB Output is correct
22 Correct 277 ms 5204 KB Output is correct
23 Correct 1725 ms 5972 KB Output is correct
24 Correct 1846 ms 6120 KB Output is correct
25 Correct 1945 ms 6024 KB Output is correct
26 Correct 2447 ms 6332 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 5 ms 4948 KB Output is correct
30 Correct 21 ms 5152 KB Output is correct
31 Correct 89 ms 6068 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 5 ms 5020 KB Output is correct
35 Correct 38 ms 5116 KB Output is correct
36 Correct 317 ms 5344 KB Output is correct
37 Correct 1459 ms 6544 KB Output is correct
38 Incorrect 6 ms 5716 KB Output isn't correct
39 Halted 0 ms 0 KB -