oj.uz

답안 #447029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447029 2021-07-24T09:02:40 Z yungyao Dynamic Diameter (CEOI19_diameter) C++17
42 / 100
 5000 ms 13836 KB 
using namespace std;
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <utility>
#include <memory.h>
#include <vector>
#include <bitset>

typedef pair<int,int> pii;
typedef long long LL;

#define iter(x) x.begin(),x.end()
#define F first
#define S second
#define pb push_back
#define mkp make_pair

#include <climits>
const int maxn = 1e5+10,mod = 0;

struct EDGE{
    int u,v;
    LL w;
    int con_to(int e){
        return u == e ? v : u;
    }
}edge[maxn];

vector <int> adj[maxn];
vector <pii> son[maxn];
int father[maxn];
pair<LL,LL> dp[maxn];
LL ans[maxn];

void update(pair <LL,LL> &onto,LL fr){
    if (fr > onto.F){
        onto.S = onto.F;
        onto.F = fr;
    }
    else if (fr > onto.S){
        onto.S = fr;
    }
}

void dfs(int x,int fr){
    father[x] = fr;
    for (auto i:adj[x]) if (edge[i].con_to(x) != fr){
        son[x].pb(mkp(edge[i].con_to(x),i));
        dfs(edge[i].con_to(x),x);
        ans[x] = max(ans[x],ans[edge[i].con_to(x)]);
        update(dp[x], dp[edge[i].con_to(x)].F + edge[i].w);
    }
    ans[x] = max(ans[x],dp[x].F + dp[x].S);
}

void upd(int x){
    ans[x] = 0;
    dp[x] = {};
    for (auto [i,ed]:son[x]){
        ans[x] = max(ans[x],ans[i]);
        update(dp[x], dp[i].F + edge[ed].w);
    }
    ans[x] = max(ans[x],dp[x].F + dp[x].S);
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n,q,w;

    cin >> n >> q >> w;
    for (int i=0;i<n-1;++i){
        int u,v; LL c;

        cin >> u >> v >> c;
        edge[i] = {u,v,c};
        adj[u].pb(i);
        adj[v].pb(i);
    }
    dfs(1,0);

    LL last = 0;
    while (q--){
        LL d,e;

        cin >> d >> e;
        d = (d + last) % (n-1);
        e = (e + last) % w;

        edge[d].w = e;
        int u = father[edge[d].u] == edge[d].v ? edge[d].v : edge[d].u;
        while (u){
            upd(u);
            u = father[u];
        }

        last = ans[1];
        cout /*<< d << ' ' << e << ' ' */<< last << '\n';
    }

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 8 ms 5068 KB Output is correct
20 Correct 9 ms 5068 KB Output is correct
21 Correct 16 ms 5176 KB Output is correct
22 Correct 21 ms 5228 KB Output is correct
23 Correct 11 ms 5524 KB Output is correct
24 Correct 19 ms 5452 KB Output is correct
25 Correct 44 ms 5604 KB Output is correct
26 Correct 208 ms 6116 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 6 ms 4940 KB Output is correct
4 Correct 10 ms 5068 KB Output is correct
5 Correct 54 ms 5396 KB Output is correct
6 Correct 4 ms 4928 KB Output is correct
7 Correct 4 ms 5068 KB Output is correct
8 Correct 5 ms 5068 KB Output is correct
9 Correct 7 ms 5068 KB Output is correct
10 Correct 33 ms 5068 KB Output is correct
11 Correct 159 ms 5620 KB Output is correct
12 Correct 6 ms 5452 KB Output is correct
13 Correct 7 ms 5384 KB Output is correct
14 Correct 28 ms 5468 KB Output is correct
15 Correct 217 ms 5468 KB Output is correct
16 Correct 1077 ms 5940 KB Output is correct
17 Correct 44 ms 12092 KB Output is correct
18 Correct 83 ms 12156 KB Output is correct
19 Correct 459 ms 12172 KB Output is correct
20 Correct 4270 ms 12368 KB Output is correct
21 Execution timed out 5086 ms 12396 KB Time limit exceeded

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5068 KB Output is correct
2 Correct 8 ms 5068 KB Output is correct
3 Correct 23 ms 5372 KB Output is correct
4 Correct 43 ms 5568 KB Output is correct
5 Correct 9 ms 5836 KB Output is correct
6 Correct 13 ms 5836 KB Output is correct
7 Correct 36 ms 6168 KB Output is correct
8 Correct 51 ms 6440 KB Output is correct
9 Correct 30 ms 9088 KB Output is correct
10 Correct 33 ms 9120 KB Output is correct
11 Correct 54 ms 9352 KB Output is correct
12 Correct 80 ms 9616 KB Output is correct
13 Correct 68 ms 13184 KB Output is correct
14 Correct 59 ms 13240 KB Output is correct
15 Correct 81 ms 13520 KB Output is correct
16 Correct 109 ms 13836 KB Output is correct
17 Correct 195 ms 13740 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 7744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 8 ms 5068 KB Output is correct
20 Correct 9 ms 5068 KB Output is correct
21 Correct 16 ms 5176 KB Output is correct
22 Correct 21 ms 5228 KB Output is correct
23 Correct 11 ms 5524 KB Output is correct
24 Correct 19 ms 5452 KB Output is correct
25 Correct 44 ms 5604 KB Output is correct
26 Correct 208 ms 6116 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 4 ms 4940 KB Output is correct
29 Correct 6 ms 4940 KB Output is correct
30 Correct 10 ms 5068 KB Output is correct
31 Correct 54 ms 5396 KB Output is correct
32 Correct 4 ms 4928 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 5 ms 5068 KB Output is correct
35 Correct 7 ms 5068 KB Output is correct
36 Correct 33 ms 5068 KB Output is correct
37 Correct 159 ms 5620 KB Output is correct
38 Correct 6 ms 5452 KB Output is correct
39 Correct 7 ms 5384 KB Output is correct
40 Correct 28 ms 5468 KB Output is correct
41 Correct 217 ms 5468 KB Output is correct
42 Correct 1077 ms 5940 KB Output is correct
43 Correct 44 ms 12092 KB Output is correct
44 Correct 83 ms 12156 KB Output is correct
45 Correct 459 ms 12172 KB Output is correct
46 Correct 4270 ms 12368 KB Output is correct
47 Execution timed out 5086 ms 12396 KB Time limit exceeded