oj.uz

답안 #971663

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971663 2024-04-29T07:05:56 Z efedmrlr Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 17772 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n,q,w;
vector<vector<array<int, 2> > > adj(N, vector<array<int, 2> >());
vector<array<int, 3> > edg(N);
vector<int> dist(N);
void dfs(int node, int par) {
    for(auto c : adj[node]) {
        if(c[0] == par) continue;
        dist[c[0]] = dist[node] + edg[c[1]][2];
        dfs(c[0], node);
    }
}

int get_diam() {
    dist[1] = 0;
    dfs(1, 0);
    int ind = 1;
    for(int i = 1; i <= n; i++) {
        if(dist[i] > dist[ind]) ind = i;
    }
    dist[ind] = 0;
    dfs(ind, 0);
    return *max_element(dist.begin(), dist.begin() + n + 1);
}

inline void solve() {
    cin >> n >> q >> w;
    edg.resize(n - 1);
    REP(i, n - 1) {
        cin >> edg[i][0] >> edg[i][1] >> edg[i][2];
        adj[edg[i][0]].pb({edg[i][1], i});
        adj[edg[i][1]].pb({edg[i][0], i});
    }
    int last = 0;
    REP(z, q) {
        int d, e;
        cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        edg[d][2] = e;
        last = get_diam();
        cout << last << "\n";
    }
}
 
signed main() {

    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 5 ms 12124 KB Output is correct
4 Correct 4 ms 12124 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 4 ms 12156 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 5 ms 12376 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 4 ms 12036 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 5 ms 12120 KB Output is correct
13 Correct 4 ms 12124 KB Output is correct
14 Correct 5 ms 12124 KB Output is correct
15 Correct 4 ms 12120 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 11976 KB Output is correct
18 Correct 5 ms 12124 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 5 ms 12124 KB Output is correct
4 Correct 4 ms 12124 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 4 ms 12156 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 5 ms 12376 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 4 ms 12036 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 5 ms 12120 KB Output is correct
13 Correct 4 ms 12124 KB Output is correct
14 Correct 5 ms 12124 KB Output is correct
15 Correct 4 ms 12120 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 11976 KB Output is correct
18 Correct 5 ms 12124 KB Output is correct
19 Correct 80 ms 12308 KB Output is correct
20 Correct 89 ms 12124 KB Output is correct
21 Correct 87 ms 12120 KB Output is correct
22 Correct 143 ms 12356 KB Output is correct
23 Correct 872 ms 12508 KB Output is correct
24 Correct 1010 ms 12760 KB Output is correct
25 Correct 1153 ms 12568 KB Output is correct
26 Correct 1139 ms 12984 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12120 KB Output is correct
2 Correct 5 ms 12120 KB Output is correct
3 Correct 5 ms 12232 KB Output is correct
4 Correct 12 ms 12380 KB Output is correct
5 Correct 43 ms 13320 KB Output is correct
6 Correct 4 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 5 ms 12124 KB Output is correct
9 Correct 14 ms 12124 KB Output is correct
10 Correct 99 ms 12368 KB Output is correct
11 Correct 492 ms 13532 KB Output is correct
12 Correct 7 ms 12380 KB Output is correct
13 Correct 15 ms 12380 KB Output is correct
14 Correct 101 ms 12348 KB Output is correct
15 Correct 974 ms 12716 KB Output is correct
16 Correct 4638 ms 14212 KB Output is correct
17 Correct 44 ms 17208 KB Output is correct
18 Correct 225 ms 17324 KB Output is correct
19 Correct 1925 ms 17604 KB Output is correct
20 Execution timed out 5037 ms 17772 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 12124 KB Output is correct
2 Correct 122 ms 12376 KB Output is correct
3 Correct 593 ms 13128 KB Output is correct
4 Correct 1224 ms 13392 KB Output is correct
5 Correct 125 ms 12632 KB Output is correct
6 Correct 1205 ms 13104 KB Output is correct
7 Execution timed out 5005 ms 13576 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5021 ms 14296 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 4 ms 12124 KB Output is correct
3 Correct 5 ms 12124 KB Output is correct
4 Correct 4 ms 12124 KB Output is correct
5 Correct 5 ms 12124 KB Output is correct
6 Correct 4 ms 12156 KB Output is correct
7 Correct 4 ms 12124 KB Output is correct
8 Correct 5 ms 12376 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 4 ms 12036 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 5 ms 12120 KB Output is correct
13 Correct 4 ms 12124 KB Output is correct
14 Correct 5 ms 12124 KB Output is correct
15 Correct 4 ms 12120 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 11976 KB Output is correct
18 Correct 5 ms 12124 KB Output is correct
19 Correct 80 ms 12308 KB Output is correct
20 Correct 89 ms 12124 KB Output is correct
21 Correct 87 ms 12120 KB Output is correct
22 Correct 143 ms 12356 KB Output is correct
23 Correct 872 ms 12508 KB Output is correct
24 Correct 1010 ms 12760 KB Output is correct
25 Correct 1153 ms 12568 KB Output is correct
26 Correct 1139 ms 12984 KB Output is correct
27 Correct 5 ms 12120 KB Output is correct
28 Correct 5 ms 12120 KB Output is correct
29 Correct 5 ms 12232 KB Output is correct
30 Correct 12 ms 12380 KB Output is correct
31 Correct 43 ms 13320 KB Output is correct
32 Correct 4 ms 12124 KB Output is correct
33 Correct 5 ms 12124 KB Output is correct
34 Correct 5 ms 12124 KB Output is correct
35 Correct 14 ms 12124 KB Output is correct
36 Correct 99 ms 12368 KB Output is correct
37 Correct 492 ms 13532 KB Output is correct
38 Correct 7 ms 12380 KB Output is correct
39 Correct 15 ms 12380 KB Output is correct
40 Correct 101 ms 12348 KB Output is correct
41 Correct 974 ms 12716 KB Output is correct
42 Correct 4638 ms 14212 KB Output is correct
43 Correct 44 ms 17208 KB Output is correct
44 Correct 225 ms 17324 KB Output is correct
45 Correct 1925 ms 17604 KB Output is correct
46 Execution timed out 5037 ms 17772 KB Time limit exceeded
47 Halted 0 ms 0 KB -