oj.uz

Submission #201690

# Submission time Handle Problem Language Result Execution time Memory
201690 2020-02-11T17:40:43 Z georgerapeanu Dynamic Diameter (CEOI19_diameter) C++11
49 / 100
 5000 ms 159648 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

const int NMAX = 1e5;

class SegTree{
public:
    int n;
    vector <long long> aint;
    vector <long long> lazy;

    void propag(int nod,int st,int dr){
        if(lazy[nod] == 0 || st == dr){
            return ;
        }
        aint[nod * 2] += lazy[nod];
        lazy[nod * 2] += lazy[nod];
        aint[nod * 2 + 1] += lazy[nod];
        lazy[nod * 2 + 1] += lazy[nod];
        lazy[nod] = 0;
    }

    void update(int nod,int st,int dr,int l,int r,long long delta){
        propag(nod,st,dr);
        if(dr < l || st > r){
            return ;
        }
        if(l <= st && dr <= r){
            aint[nod] += delta;
            lazy[nod] += delta;
            return ;
        }
        
        int mid = (st + dr) / 2;

        update(nod * 2,st,mid,l,r,delta);
        update(nod * 2 + 1,mid + 1,dr,l,r,delta);

        aint[nod] = max(aint[nod * 2],aint[nod * 2 + 1]);
    }

public:

    SegTree(int n){
        this->n = n;
        aint = vector<long long>(4 * n + 1,0);
        lazy = vector<long long>(4 * n + 1,0);
    }

    void update(int l,int r,long long val){
        update(1,1,n,l,r,val);
    }

    long long query(){
        return aint[1];
    }
};

struct edge_t{
    int u,v;
    long long cost;

    int other(int x){
        return u ^ v ^ x;
    }
};

struct data_t{
    int centroid;
    int tree_id;
    int st,dr;
};

int n,q;
long long w;
bool viz[NMAX + 5];
int weight[NMAX + 5];
vector<int> graph[NMAX + 5];

edge_t edge[NMAX + 5];

vector<data_t> stuff[NMAX + 5];


const int LEN = 1 << 12;
char buff[LEN];
int ind = LEN - 1;

int i32(){
    int ans = 0;

    while(buff[ind] < '0' || buff[ind] > '9'){
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    
    while(!(buff[ind] < '0' || buff[ind] > '9')){
        ans = ans * 10 + buff[ind] - '0';
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    return ans;
}

long long i64(){
    long long ans = 0;

    while(buff[ind] < '0' || buff[ind] > '9'){
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    
    while(!(buff[ind] < '0' || buff[ind] > '9')){
        ans = ans * 10 + buff[ind] - '0';
        if(++ind >= LEN){
            ind = 0;
            fread(buff,1,LEN,stdin);
        }
    }
    return ans;
}

class RootSolver{
public:
    vector<SegTree> trees;
    set<pair<long long,int> > answer;
    int lst;

    void dfs(int nod,int tata,int centroid,int id,int edge_id){
        weight[nod] = 1;
        data_t tmp;
        lst++;
        tmp.centroid = centroid;
        tmp.tree_id = id;
        tmp.st = lst;
        for(auto it:graph[nod]){
            if(viz[edge[it].other(nod)] == true || edge[it].other(nod) == tata){
                continue;
            }
            dfs(edge[it].other(nod),nod,centroid,id,it);
            weight[nod] += weight[edge[it].other(nod)];
        }
        tmp.dr = lst;
        stuff[edge_id].push_back(tmp);
    }

public:

    RootSolver(){
    }

    RootSolver(int root){
        for(auto it:graph[root]){
            if(viz[edge[it].other(root)] == false){
                lst = 0;
                dfs(edge[it].other(root),root,root,trees.size(),it);
                answer.insert({0,trees.size()});
                trees.push_back(SegTree(weight[edge[it].other(root)]));
            }
        }
    }

    void update(const data_t &tmp,long long delta){
        answer.erase({trees[tmp.tree_id].query(),tmp.tree_id});
        trees[tmp.tree_id].update(tmp.st,tmp.dr,delta);
        answer.insert({trees[tmp.tree_id].query(),tmp.tree_id});
    }

    long long query(){
        if((int)answer.size() == 0){
            return 0;
        }
        else if((int)answer.size() == 1){
            return answer.rbegin()->first;
        }
        else{
            return answer.rbegin()->first + (next(answer.rbegin())->first);
        }
    }
};

class Centroid{
public:
    int root;
 
    vector<RootSolver> chestie;
    set<pair<long long,int> > answers;
 
    void dfs(int nod,int tata){
        weight[nod] = 1;
        for(auto it:graph[nod]){
            if(edge[it].other(nod) == tata || viz[edge[it].other(nod)] == true){
                continue;
            }
            dfs(edge[it].other(nod),nod);
            weight[nod] += weight[edge[it].other(nod)];
        }
    }
 
    int centroid(int nod){
        dfs(nod,0);
        
        int total_weight = weight[nod];
 
        int root = nod;
 
        while(true){
            int bst = -1;
 
            for(auto it:graph[root]){
                if(viz[edge[it].other(root)] == true || edge[it].other(root) == nod){
                    continue;
                }
                if(bst == -1 || weight[edge[it].other(root)] > weight[bst]){
                    bst = edge[it].other(root);
                }
            }
            if(bst != -1 && weight[bst] * 2 > total_weight){
                nod = root;
                root = bst;
            }
            else{
                break;
            }
        }

        viz[root] = true;
        chestie[root] = RootSolver(root);
 
        answers.insert({0,root});
 
        for(auto it:graph[root]){
            if(viz[edge[it].other(root)] == false){
                int tmp = centroid(edge[it].other(root));
            }
        }
 
        return root;
    }
 
public:
 
    Centroid(int n){
        this->chestie = vector<RootSolver>(n + 1,RootSolver());
        this->root = centroid(1);
    }
 
    void update(const data_t &tmp,long long delta){
        answers.erase({chestie[tmp.centroid].query(),tmp.centroid});
        chestie[tmp.centroid].update(tmp,delta);
        answers.insert({chestie[tmp.centroid].query(),tmp.centroid});
    }
 
    long long query(){
        return answers.rbegin()->first;
    }
};

int main(){

    n = i32();
    q = i32();
    w = i64();

    for(int i = 1;i < n;i++){
        edge[i].u = i32();
        edge[i].v = i32();
        edge[i].cost = i64();
        graph[edge[i].u].push_back(i);
        graph[edge[i].v].push_back(i);
    }

    long long last = 0;

    Centroid a(n);

    for(int i = 1;i < n;i++){
        for(auto it:stuff[i]){
            a.update(it,edge[i].cost);
        }
    }

    while(q--){
        int d;
        long long e;
        
        d = i32();
        e = i64();

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

        for(auto it:stuff[d]){
            a.update(it,e - edge[d].cost);
        }
        edge[d].cost = e;

        last = a.query();

        printf("%lld\n",last);
    }

    return 0;
}

Compilation message

diameter.cpp: In member function 'int Centroid::centroid(int)':
diameter.cpp:244:21: warning: unused variable 'tmp' [-Wunused-variable]
                 int tmp = centroid(edge[it].other(root));
                     ^~~
diameter.cpp: In function 'int i32()':
diameter.cpp:99:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
diameter.cpp:107:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
diameter.cpp: In function 'long long int i64()':
diameter.cpp:119:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~
diameter.cpp:127:18: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
             fread(buff,1,LEN,stdin);
             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 7 ms 4988 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 9 ms 4984 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 9 ms 5240 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5116 KB Output is correct
19 Correct 27 ms 5884 KB Output is correct
20 Correct 29 ms 5880 KB Output is correct
21 Correct 34 ms 6008 KB Output is correct
22 Correct 36 ms 6264 KB Output is correct
23 Correct 60 ms 9464 KB Output is correct
24 Correct 78 ms 10360 KB Output is correct
25 Correct 94 ms 11000 KB Output is correct
26 Correct 96 ms 11768 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 9 ms 5112 KB Output is correct
4 Correct 18 ms 5240 KB Output is correct
5 Correct 61 ms 6136 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 8 ms 5240 KB Output is correct
8 Correct 9 ms 5240 KB Output is correct
9 Correct 9 ms 5240 KB Output is correct
10 Correct 20 ms 5496 KB Output is correct
11 Correct 63 ms 6520 KB Output is correct
12 Correct 16 ms 7316 KB Output is correct
13 Correct 16 ms 7316 KB Output is correct
14 Correct 16 ms 7272 KB Output is correct
15 Correct 32 ms 7572 KB Output is correct
16 Correct 98 ms 8724 KB Output is correct
17 Correct 263 ms 50228 KB Output is correct
18 Correct 251 ms 50324 KB Output is correct
19 Correct 247 ms 50200 KB Output is correct
20 Correct 286 ms 50588 KB Output is correct
21 Correct 502 ms 51860 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 6008 KB Output is correct
2 Correct 38 ms 6136 KB Output is correct
3 Correct 140 ms 6648 KB Output is correct
4 Correct 264 ms 7416 KB Output is correct
5 Correct 95 ms 17912 KB Output is correct
6 Correct 142 ms 17912 KB Output is correct
7 Correct 330 ms 18680 KB Output is correct
8 Correct 590 ms 19580 KB Output is correct
9 Correct 633 ms 77052 KB Output is correct
10 Correct 693 ms 76968 KB Output is correct
11 Correct 1066 ms 78072 KB Output is correct
12 Correct 1492 ms 78840 KB Output is correct
13 Correct 1379 ms 155128 KB Output is correct
14 Correct 1496 ms 155260 KB Output is correct
15 Correct 1983 ms 155900 KB Output is correct
16 Correct 2485 ms 157008 KB Output is correct
17 Correct 3781 ms 156576 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4011 ms 133112 KB Output is correct
2 Correct 4051 ms 136028 KB Output is correct
3 Correct 4041 ms 135160 KB Output is correct
4 Correct 4148 ms 135932 KB Output is correct
5 Correct 3859 ms 129616 KB Output is correct
6 Correct 2800 ms 96932 KB Output is correct
7 Execution timed out 5015 ms 159648 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 8 ms 4984 KB Output is correct
3 Correct 8 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 7 ms 4988 KB Output is correct
8 Correct 8 ms 4984 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 9 ms 4984 KB Output is correct
11 Correct 8 ms 5112 KB Output is correct
12 Correct 8 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 9 ms 5240 KB Output is correct
16 Correct 9 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5116 KB Output is correct
19 Correct 27 ms 5884 KB Output is correct
20 Correct 29 ms 5880 KB Output is correct
21 Correct 34 ms 6008 KB Output is correct
22 Correct 36 ms 6264 KB Output is correct
23 Correct 60 ms 9464 KB Output is correct
24 Correct 78 ms 10360 KB Output is correct
25 Correct 94 ms 11000 KB Output is correct
26 Correct 96 ms 11768 KB Output is correct
27 Correct 8 ms 4984 KB Output is correct
28 Correct 8 ms 4984 KB Output is correct
29 Correct 9 ms 5112 KB Output is correct
30 Correct 18 ms 5240 KB Output is correct
31 Correct 61 ms 6136 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 8 ms 5240 KB Output is correct
34 Correct 9 ms 5240 KB Output is correct
35 Correct 9 ms 5240 KB Output is correct
36 Correct 20 ms 5496 KB Output is correct
37 Correct 63 ms 6520 KB Output is correct
38 Correct 16 ms 7316 KB Output is correct
39 Correct 16 ms 7316 KB Output is correct
40 Correct 16 ms 7272 KB Output is correct
41 Correct 32 ms 7572 KB Output is correct
42 Correct 98 ms 8724 KB Output is correct
43 Correct 263 ms 50228 KB Output is correct
44 Correct 251 ms 50324 KB Output is correct
45 Correct 247 ms 50200 KB Output is correct
46 Correct 286 ms 50588 KB Output is correct
47 Correct 502 ms 51860 KB Output is correct
48 Correct 15 ms 6008 KB Output is correct
49 Correct 38 ms 6136 KB Output is correct
50 Correct 140 ms 6648 KB Output is correct
51 Correct 264 ms 7416 KB Output is correct
52 Correct 95 ms 17912 KB Output is correct
53 Correct 142 ms 17912 KB Output is correct
54 Correct 330 ms 18680 KB Output is correct
55 Correct 590 ms 19580 KB Output is correct
56 Correct 633 ms 77052 KB Output is correct
57 Correct 693 ms 76968 KB Output is correct
58 Correct 1066 ms 78072 KB Output is correct
59 Correct 1492 ms 78840 KB Output is correct
60 Correct 1379 ms 155128 KB Output is correct
61 Correct 1496 ms 155260 KB Output is correct
62 Correct 1983 ms 155900 KB Output is correct
63 Correct 2485 ms 157008 KB Output is correct
64 Correct 3781 ms 156576 KB Output is correct
65 Correct 4011 ms 133112 KB Output is correct
66 Correct 4051 ms 136028 KB Output is correct
67 Correct 4041 ms 135160 KB Output is correct
68 Correct 4148 ms 135932 KB Output is correct
69 Correct 3859 ms 129616 KB Output is correct
70 Correct 2800 ms 96932 KB Output is correct
71 Execution timed out 5015 ms 159648 KB Time limit exceeded
72 Halted 0 ms 0 KB -