oj.uz

Submission #501012

# Submission time Handle Problem Language Result Execution time Memory
501012 2022-01-02T07:17:05 Z InternetPerson10 Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 13380 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector<vector<pair<int, ll>>> adj;
vector<pair<int, int>> pa;
vector<pair<int, ll>> dist;
bool isStar = false;
multiset<ll> s;

void init(int n, int q, ll l, vector<int> u, vector<int> v, vector<ll> w) {
    pa.resize(n-1);
    adj.resize(n);
    s.insert(0);
    for(int i = 0; i < n-1; i++) {
        u[i]--; v[i]--;
        pa[i] = {u[i], v[i]};
        adj[u[i]].push_back({v[i], w[i]});
        adj[v[i]].push_back({u[i], w[i]});
    }
    if(adj[0].size() == n-1) { // subtask 3
        isStar = true;
        s.insert(0);
        for(int i = 0; i < n-1; i++) {
            s.insert(w[i]);
        }
    }
    for(int i = 0; i < n; i++) sort(adj[i].begin(), adj[i].end());
    dist.resize(n);
}

void dfs(int n, ll dis = 0, int par = -1) {
    dist[n] = {dis, n};
    for(auto ch : adj[n]) {
        if(ch.first == par) continue;
        dfs(ch.first, dis + ch.second, n);
    }
}

ll get_diameter(int d, ll e) {
    int x, y;
    tie(x, y) = pa[d];
    int l = 0, r = adj[x].size();
    while(l != r-1) {
        int mid = (l+r)/2;
        if(adj[x][mid].first <= y) l = mid;
        else r = mid; 
    }
    adj[x][l].second = e;
    l = 0; r = adj[y].size();
    while(l != r-1) {
        int mid = (l+r)/2;
        if(adj[y][mid].first <= x) l = mid;
        else r = mid; 
    }
    if(isStar) {
        auto it = s.find(adj[y][l].second);
        s.erase(it);
        s.insert(e);
        it = s.end();
        it--;
        ll ans = *it;
        it--;
        return ans + (*it);
    }
    adj[y][l].second = e;
    dfs(0);
    sort(dist.rbegin(), dist.rend());
    dfs(dist[0].second);
    sort(dist.rbegin(), dist.rend());
    return dist[0].first;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    ll l;
    cin >> n >> q >> l;
    vector<int> u(n-1), v(n-1);
    vector<ll> w(n-1);
    for(int i = 0; i < n-1; i++) {
        cin >> u[i] >> v[i] >> w[i];
    }
    init(n, q, l, u, v, w);
    ll last = 0;
    for(int i = 0; i < q; i++) {
        ll d, e;
        cin >> d >> e;
        d += last;
        d %= n-1;
        e += last;
        e %= l;
        last = get_diameter(d, e);
        cout << last << '\n';
    }
}

Compilation message

diameter.cpp: In function 'void init(int, int, ll, std::vector<int>, std::vector<int>, std::vector<long long int>)':
diameter.cpp:22:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |     if(adj[0].size() == n-1) { // subtask 3
      |        ~~~~~~~~~~~~~~^~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 612 ms 444 KB Output is correct
20 Correct 610 ms 456 KB Output is correct
21 Correct 613 ms 456 KB Output is correct
22 Correct 591 ms 488 KB Output is correct
23 Correct 4002 ms 972 KB Output is correct
24 Correct 4218 ms 988 KB Output is correct
25 Correct 4104 ms 1136 KB Output is correct
26 Correct 4130 ms 1312 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 424 KB Output is correct
2 Correct 1018 ms 420 KB Output is correct
3 Execution timed out 5063 ms 776 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5049 ms 13380 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 612 ms 444 KB Output is correct
20 Correct 610 ms 456 KB Output is correct
21 Correct 613 ms 456 KB Output is correct
22 Correct 591 ms 488 KB Output is correct
23 Correct 4002 ms 972 KB Output is correct
24 Correct 4218 ms 988 KB Output is correct
25 Correct 4104 ms 1136 KB Output is correct
26 Correct 4130 ms 1312 KB Output is correct
27 Runtime error 1 ms 460 KB Execution killed with signal 6
28 Halted 0 ms 0 KB -