oj.uz

Submission #689723

# Submission time Handle Problem Language Result Execution time Memory
689723 2023-01-29T07:30:52 Z overwatch9 Dynamic Diameter (CEOI19_diameter) C++17
11 / 100
 5000 ms 6364 KB 
// subtask12
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int MAX_N = 5000 + 1;
ll adj[MAX_N][MAX_N];
struct edge {
    int a, b;
    ll w;
};
edge edges[MAX_N];
int node;
ll max_dis;
int N, Q;
ll W;
void dfs(int s, int p, ll dis) {
    if (dis > max_dis) {
        node = s;
        max_dis = dis;
    }
    for (int i = 1; i <= N; i++) {
        if (i != s && adj[s][i] != 0 && i != p)
            dfs(i, s, dis + adj[i][s]);
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> Q >> W;
    for (int i = 0; i < N-1; i++) {
        int a, b;
        ll w;
        cin >> a >> b >> w;
        adj[a][b] = adj[b][a] = w;
        edge tp;
        tp.a = a;
        tp.b = b;
        tp.w = w;
        edges[i] = tp;
    }
    ll last = 0;
    while (Q--) {
        ll d;
        ll e;
        cin >> d >> e;
        d = (d + last) % (N-1);
        e = (e + last) % (W);
        int a = edges[d].a, b = edges[d].b;
        adj[a][b] = adj[b][a] = e;
        edges[d].w = e;
        max_dis = 0;
        dfs(1, 1, 0);
        max_dis = 0;
        dfs(node, node, 0);
        last = max_dis;
        cout << max_dis << '\n';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 3 ms 708 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 712 KB Output is correct
19 Execution timed out 5045 ms 6364 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 33 ms 616 KB Output is correct
5 Correct 164 ms 1504 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 11 ms 2388 KB Output is correct
8 Correct 90 ms 2388 KB Output is correct
9 Correct 962 ms 2396 KB Output is correct
10 Execution timed out 5042 ms 2836 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1682 ms 5752 KB Output is correct
2 Execution timed out 5049 ms 5840 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 704 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 3 ms 708 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 712 KB Output is correct
19 Execution timed out 5045 ms 6364 KB Time limit exceeded
20 Halted 0 ms 0 KB -