oj.uz

답안 #201500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201500 2020-02-10T19:06:52 Z georgerapeanu Dynamic Diameter (CEOI19_diameter) C++11
49 / 100
 5000 ms 226940 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_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;

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

    void dfs(int nod,int tata,int id){
        data_t tmp = {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];
        }
        
        tmp.dr = lst;
        stuff[nod] = tmp;
    }

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){
        data_t tmp = stuff[edge.second];
        if(edge.second == root || tmp.father != edge.first){
            swap(edge.second,edge.first);
            tmp = stuff[edge.second];
        }
        answers.erase({trees[tmp.tree_id].query(),tmp.tree_id});
        trees[tmp.tree_id].update(tmp.st,tmp.dr,delta);
        answers.insert({trees[tmp.tree_id].query(),tmp.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;
    }
};

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;
}

int main(){

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

    for(int i = 1;i < n;i++){
        edge[i].first = i32();
        edge[i].second = i32();
        cost[i] = i64();
        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;
        
        d = i32();
        e = i64();

        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:228:21: warning: unused variable 'tmp' [-Wunused-variable]
                 int tmp = centroid(it);
                     ^~~
diameter.cpp: In function 'int i32()':
diameter.cpp:269: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:277: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:289: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:297: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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 7 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 7 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 6 ms 2680 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 7 ms 2812 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 7 ms 2808 KB Output is correct
17 Correct 7 ms 2808 KB Output is correct
18 Correct 8 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 7 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 7 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 6 ms 2680 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 7 ms 2812 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 7 ms 2808 KB Output is correct
17 Correct 7 ms 2808 KB Output is correct
18 Correct 8 ms 2808 KB Output is correct
19 Correct 30 ms 3836 KB Output is correct
20 Correct 32 ms 3960 KB Output is correct
21 Correct 38 ms 4088 KB Output is correct
22 Correct 41 ms 4348 KB Output is correct
23 Correct 82 ms 9080 KB Output is correct
24 Correct 111 ms 10360 KB Output is correct
25 Correct 127 ms 11128 KB Output is correct
26 Correct 143 ms 12408 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 7 ms 2680 KB Output is correct
4 Correct 16 ms 2808 KB Output is correct
5 Correct 55 ms 3064 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 7 ms 2936 KB Output is correct
8 Correct 7 ms 2936 KB Output is correct
9 Correct 10 ms 2936 KB Output is correct
10 Correct 19 ms 3192 KB Output is correct
11 Correct 68 ms 3448 KB Output is correct
12 Correct 14 ms 5524 KB Output is correct
13 Correct 14 ms 5524 KB Output is correct
14 Correct 16 ms 5524 KB Output is correct
15 Correct 31 ms 5656 KB Output is correct
16 Correct 107 ms 6164 KB Output is correct
17 Correct 286 ms 60028 KB Output is correct
18 Correct 285 ms 60056 KB Output is correct
19 Correct 293 ms 60048 KB Output is correct
20 Correct 330 ms 60056 KB Output is correct
21 Correct 648 ms 60568 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 4088 KB Output is correct
2 Correct 42 ms 4088 KB Output is correct
3 Correct 170 ms 4472 KB Output is correct
4 Correct 309 ms 4600 KB Output is correct
5 Correct 120 ms 20984 KB Output is correct
6 Correct 180 ms 21112 KB Output is correct
7 Correct 447 ms 21240 KB Output is correct
8 Correct 753 ms 21756 KB Output is correct
9 Correct 734 ms 108200 KB Output is correct
10 Correct 837 ms 108344 KB Output is correct
11 Correct 1276 ms 108456 KB Output is correct
12 Correct 1814 ms 108840 KB Output is correct
13 Correct 1611 ms 226056 KB Output is correct
14 Correct 1736 ms 226056 KB Output is correct
15 Correct 2282 ms 226312 KB Output is correct
16 Correct 2958 ms 226696 KB Output is correct
17 Correct 4413 ms 226940 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5054 ms 183192 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 7 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 7 ms 2680 KB Output is correct
6 Correct 6 ms 2680 KB Output is correct
7 Correct 6 ms 2680 KB Output is correct
8 Correct 6 ms 2680 KB Output is correct
9 Correct 6 ms 2680 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 6 ms 2680 KB Output is correct
12 Correct 7 ms 2812 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 7 ms 2808 KB Output is correct
17 Correct 7 ms 2808 KB Output is correct
18 Correct 8 ms 2808 KB Output is correct
19 Correct 30 ms 3836 KB Output is correct
20 Correct 32 ms 3960 KB Output is correct
21 Correct 38 ms 4088 KB Output is correct
22 Correct 41 ms 4348 KB Output is correct
23 Correct 82 ms 9080 KB Output is correct
24 Correct 111 ms 10360 KB Output is correct
25 Correct 127 ms 11128 KB Output is correct
26 Correct 143 ms 12408 KB Output is correct
27 Correct 6 ms 2680 KB Output is correct
28 Correct 6 ms 2680 KB Output is correct
29 Correct 7 ms 2680 KB Output is correct
30 Correct 16 ms 2808 KB Output is correct
31 Correct 55 ms 3064 KB Output is correct
32 Correct 6 ms 2680 KB Output is correct
33 Correct 7 ms 2936 KB Output is correct
34 Correct 7 ms 2936 KB Output is correct
35 Correct 10 ms 2936 KB Output is correct
36 Correct 19 ms 3192 KB Output is correct
37 Correct 68 ms 3448 KB Output is correct
38 Correct 14 ms 5524 KB Output is correct
39 Correct 14 ms 5524 KB Output is correct
40 Correct 16 ms 5524 KB Output is correct
41 Correct 31 ms 5656 KB Output is correct
42 Correct 107 ms 6164 KB Output is correct
43 Correct 286 ms 60028 KB Output is correct
44 Correct 285 ms 60056 KB Output is correct
45 Correct 293 ms 60048 KB Output is correct
46 Correct 330 ms 60056 KB Output is correct
47 Correct 648 ms 60568 KB Output is correct
48 Correct 14 ms 4088 KB Output is correct
49 Correct 42 ms 4088 KB Output is correct
50 Correct 170 ms 4472 KB Output is correct
51 Correct 309 ms 4600 KB Output is correct
52 Correct 120 ms 20984 KB Output is correct
53 Correct 180 ms 21112 KB Output is correct
54 Correct 447 ms 21240 KB Output is correct
55 Correct 753 ms 21756 KB Output is correct
56 Correct 734 ms 108200 KB Output is correct
57 Correct 837 ms 108344 KB Output is correct
58 Correct 1276 ms 108456 KB Output is correct
59 Correct 1814 ms 108840 KB Output is correct
60 Correct 1611 ms 226056 KB Output is correct
61 Correct 1736 ms 226056 KB Output is correct
62 Correct 2282 ms 226312 KB Output is correct
63 Correct 2958 ms 226696 KB Output is correct
64 Correct 4413 ms 226940 KB Output is correct
65 Execution timed out 5054 ms 183192 KB Time limit exceeded
66 Halted 0 ms 0 KB -