oj.uz

답안 #201489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201489 2020-02-10T18:06:45 Z georgerapeanu Dynamic Diameter (CEOI19_diameter) C++11
31 / 100
 5000 ms 234804 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

using namespace std;

const int NMAX = 1e5;

struct data_t{
    int tree_id;
    int st;
    int dr;
    int father;

    bool operator < (const data_t &other)const{
        if(tree_id != other.tree_id){
            return tree_id < other.tree_id;
        }
        if(st != other.st){
            return st < other.st;
        }
        if(dr != other.dr){
            return dr < other.dr;
        }
        return father < other.father;
    }
};

class SegTree{
   
    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];
    }
};

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

pair<int,int> edge[NMAX + 5];
long long cost[NMAX + 5];

class RootPathSolver{

    int lst;
    int root;

    vector< SegTree > trees;

    map<int,data_t> stuff;
    set<pair<long long,int> > answers;//(best path,tree id)

    void dfs(int nod,int tata,int id){
        stuff[nod] = {id,++lst,-1,tata};
        weight[nod] = 1;

        for(auto it:graph[nod]){
            if(it == tata || viz[it] == true){
                continue;
            }
            dfs(it,nod,id);
            weight[nod] += weight[it];
        }

        stuff[nod].dr = lst;
    }

public:

    RootPathSolver(){
    }

    RootPathSolver(int root){
        this->root = root;
        int lst_id = -1;
        for(auto it:graph[root]){
            if(viz[it] == false){
                lst = 0;
                dfs(it,root,++lst_id);
                trees.push_back(SegTree(weight[it]));
                answers.insert({0,it});
            }
        }
    }

    void update(pair<int,int> edge,long long delta){
        if(edge.second == root || stuff[edge.second].father != edge.first){
            swap(edge.second,edge.first);
        }
        answers.erase({trees[stuff[edge.second].tree_id].query(),stuff[edge.second].tree_id});
        trees[stuff[edge.second].tree_id].update(stuff[edge.second].st,stuff[edge.second].dr,delta);
        answers.insert({trees[stuff[edge.second].tree_id].query(),stuff[edge.second].tree_id});
    }

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

};

class Centroid{
    public:
    int root;

    vector<RootPathSolver> chestie;
    vector<vector<int> > history;
    set<pair<long long,int> > answers;

    void dfs(int nod,int tata){
        weight[nod] = 1;
        for(auto it:graph[nod]){
            if(it == tata || viz[it] == true){
                continue;
            }
            dfs(it,nod);
            weight[nod] += weight[it];
        }
    }

    void dfs_root(int nod,int tata,int root){
        if(root != nod){
            history[nod].push_back(root);
        }
        for(auto it:graph[nod]){
            if(viz[it] == true || it == tata){
                continue;
            }
            dfs_root(it,nod,root);
        }
    }

    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[it] == true || it == nod){
                    continue;
                }
                if(bst == -1 || weight[it] > weight[bst]){
                    bst = it;
                }
            }
            if(bst != -1 && weight[bst] * 2 > total_weight){
                nod = root;
                root = bst;
            }
            else{
                break;
            }
        }

        viz[root] = true;
        chestie[root] = RootPathSolver(root);
        dfs_root(root,0,root);

        answers.insert({0,root});

        for(auto it:graph[root]){
            if(viz[it] == false){
                int tmp = centroid(it);
            }
        }

        return root;
    }

public:

    Centroid(int n){
        this->chestie = vector<RootPathSolver>(n + 1,RootPathSolver());
        this->history = vector<vector<int>>(n + 1,vector<int>());;
        this->root = centroid(1);
    }

    void update(pair<int,int> edge,long long delta){
        if(history[edge.first].size() > history[edge.second].size()){
            swap(edge.first,edge.second);
        }
        for(auto it:history[edge.second]){
            answers.erase({chestie[it].query(),it});
            chestie[it].update(edge,delta);
            answers.insert({chestie[it].query(),it});
        }
    }

    long long query(){
        return answers.rbegin()->first;
    }
};

int main(){

    scanf("%d %d %lld",&n,&q,&w);

    for(int i = 1;i < n;i++){
        scanf("%d %d %lld",&edge[i].first,&edge[i].second,&cost[i]);
        graph[edge[i].first].push_back(edge[i].second);
        graph[edge[i].second].push_back(edge[i].first);
    }


    Centroid a(n);

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

    long long last = 0;

    while(q--){
        int d;
        long long e;
        
        scanf("%d %lld",&d,&e);

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

        a.update(edge[d],e - cost[d]);
        cost[d] = e;

        last = a.query();

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

    return 0;
}

Compilation message

diameter.cpp: In member function 'int Centroid::centroid(int)':
diameter.cpp:225:21: warning: unused variable 'tmp' [-Wunused-variable]
                 int tmp = centroid(it);
                     ^~~
diameter.cpp: In function 'int main()':
diameter.cpp:258:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %lld",&n,&q,&w);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:261:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld",&edge[i].first,&edge[i].second,&cost[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:279:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %lld",&d,&e);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 6 ms 2680 KB Output is correct
3 Correct 6 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 7 ms 2552 KB Output is correct
8 Correct 7 ms 2680 KB Output is correct
9 Correct 7 ms 2680 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 7 ms 2680 KB Output is correct
12 Correct 7 ms 2680 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2684 KB Output is correct
16 Correct 7 ms 2808 KB Output is correct
17 Correct 7 ms 2808 KB Output is correct
18 Correct 7 ms 2808 KB Output is correct
19 Correct 44 ms 3960 KB Output is correct
20 Correct 50 ms 3960 KB Output is correct
21 Correct 61 ms 4216 KB Output is correct
22 Correct 67 ms 4344 KB Output is correct
23 Correct 115 ms 9244 KB Output is correct
24 Correct 164 ms 10616 KB Output is correct
25 Correct 199 ms 11384 KB Output is correct
26 Correct 224 ms 12664 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 6 ms 2680 KB Output is correct
3 Correct 8 ms 2680 KB Output is correct
4 Correct 23 ms 2940 KB Output is correct
5 Correct 93 ms 3832 KB Output is correct
6 Correct 7 ms 2680 KB Output is correct
7 Correct 7 ms 2936 KB Output is correct
8 Correct 9 ms 2936 KB Output is correct
9 Correct 10 ms 2936 KB Output is correct
10 Correct 34 ms 3192 KB Output is correct
11 Correct 147 ms 4392 KB Output is correct
12 Correct 19 ms 5652 KB Output is correct
13 Correct 19 ms 5524 KB Output is correct
14 Correct 23 ms 5652 KB Output is correct
15 Correct 59 ms 5908 KB Output is correct
16 Correct 214 ms 7188 KB Output is correct
17 Correct 412 ms 61080 KB Output is correct
18 Correct 422 ms 61080 KB Output is correct
19 Correct 426 ms 61152 KB Output is correct
20 Correct 525 ms 61464 KB Output is correct
21 Correct 969 ms 62360 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 4088 KB Output is correct
2 Correct 69 ms 4280 KB Output is correct
3 Correct 278 ms 4728 KB Output is correct
4 Correct 549 ms 5624 KB Output is correct
5 Correct 176 ms 21368 KB Output is correct
6 Correct 274 ms 21624 KB Output is correct
7 Correct 707 ms 22404 KB Output is correct
8 Correct 1255 ms 23104 KB Output is correct
9 Correct 1091 ms 111608 KB Output is correct
10 Correct 1251 ms 111608 KB Output is correct
11 Correct 2012 ms 112448 KB Output is correct
12 Correct 2986 ms 113416 KB Output is correct
13 Correct 2439 ms 232776 KB Output is correct
14 Correct 2674 ms 233208 KB Output is correct
15 Correct 3574 ms 233592 KB Output is correct
16 Correct 4756 ms 234804 KB Output is correct
17 Execution timed out 5071 ms 233592 KB Time limit exceeded

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 6 ms 2680 KB Output is correct
3 Correct 6 ms 2680 KB Output is correct
4 Correct 6 ms 2680 KB Output is correct
5 Correct 6 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 7 ms 2552 KB Output is correct
8 Correct 7 ms 2680 KB Output is correct
9 Correct 7 ms 2680 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 7 ms 2680 KB Output is correct
12 Correct 7 ms 2680 KB Output is correct
13 Correct 7 ms 2680 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2684 KB Output is correct
16 Correct 7 ms 2808 KB Output is correct
17 Correct 7 ms 2808 KB Output is correct
18 Correct 7 ms 2808 KB Output is correct
19 Correct 44 ms 3960 KB Output is correct
20 Correct 50 ms 3960 KB Output is correct
21 Correct 61 ms 4216 KB Output is correct
22 Correct 67 ms 4344 KB Output is correct
23 Correct 115 ms 9244 KB Output is correct
24 Correct 164 ms 10616 KB Output is correct
25 Correct 199 ms 11384 KB Output is correct
26 Correct 224 ms 12664 KB Output is correct
27 Correct 6 ms 2680 KB Output is correct
28 Correct 6 ms 2680 KB Output is correct
29 Correct 8 ms 2680 KB Output is correct
30 Correct 23 ms 2940 KB Output is correct
31 Correct 93 ms 3832 KB Output is correct
32 Correct 7 ms 2680 KB Output is correct
33 Correct 7 ms 2936 KB Output is correct
34 Correct 9 ms 2936 KB Output is correct
35 Correct 10 ms 2936 KB Output is correct
36 Correct 34 ms 3192 KB Output is correct
37 Correct 147 ms 4392 KB Output is correct
38 Correct 19 ms 5652 KB Output is correct
39 Correct 19 ms 5524 KB Output is correct
40 Correct 23 ms 5652 KB Output is correct
41 Correct 59 ms 5908 KB Output is correct
42 Correct 214 ms 7188 KB Output is correct
43 Correct 412 ms 61080 KB Output is correct
44 Correct 422 ms 61080 KB Output is correct
45 Correct 426 ms 61152 KB Output is correct
46 Correct 525 ms 61464 KB Output is correct
47 Correct 969 ms 62360 KB Output is correct
48 Correct 20 ms 4088 KB Output is correct
49 Correct 69 ms 4280 KB Output is correct
50 Correct 278 ms 4728 KB Output is correct
51 Correct 549 ms 5624 KB Output is correct
52 Correct 176 ms 21368 KB Output is correct
53 Correct 274 ms 21624 KB Output is correct
54 Correct 707 ms 22404 KB Output is correct
55 Correct 1255 ms 23104 KB Output is correct
56 Correct 1091 ms 111608 KB Output is correct
57 Correct 1251 ms 111608 KB Output is correct
58 Correct 2012 ms 112448 KB Output is correct
59 Correct 2986 ms 113416 KB Output is correct
60 Correct 2439 ms 232776 KB Output is correct
61 Correct 2674 ms 233208 KB Output is correct
62 Correct 3574 ms 233592 KB Output is correct
63 Correct 4756 ms 234804 KB Output is correct
64 Execution timed out 5071 ms 233592 KB Time limit exceeded