oj.uz

답안 #201692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201692 2020-02-11T17:49:58 Z georgerapeanu Dynamic Diameter (CEOI19_diameter) C++11
49 / 100
 5000 ms 161784 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);
    }

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

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

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

    inline 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)]));
            }
        }
    }

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

    inline 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);
    }
 
    inline 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});
    }
 
    inline long long query(){
        return answers.rbegin()->first;
    }
};

int main(){

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

    for(int i = 1;i <= n;i++){
        stuff[i].reserve(20);
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 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 8 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 8 ms 4984 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 8 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 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 8 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 8 ms 4984 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 8 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 26 ms 6008 KB Output is correct
20 Correct 29 ms 6008 KB Output is correct
21 Correct 33 ms 6136 KB Output is correct
22 Correct 35 ms 6264 KB Output is correct
23 Correct 60 ms 10496 KB Output is correct
24 Correct 76 ms 11000 KB Output is correct
25 Correct 89 ms 11384 KB Output is correct
26 Correct 92 ms 11896 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 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 18 ms 5112 KB Output is correct
5 Correct 52 ms 5496 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 8 ms 5368 KB Output is correct
8 Correct 9 ms 5368 KB Output is correct
9 Correct 9 ms 5368 KB Output is correct
10 Correct 20 ms 5504 KB Output is correct
11 Correct 64 ms 5880 KB Output is correct
12 Correct 16 ms 8724 KB Output is correct
13 Correct 16 ms 8724 KB Output is correct
14 Correct 18 ms 8724 KB Output is correct
15 Correct 32 ms 8856 KB Output is correct
16 Correct 99 ms 9236 KB Output is correct
17 Correct 284 ms 78868 KB Output is correct
18 Correct 284 ms 78876 KB Output is correct
19 Correct 279 ms 78740 KB Output is correct
20 Correct 323 ms 78868 KB Output is correct
21 Correct 553 ms 79256 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 6136 KB Output is correct
2 Correct 38 ms 6136 KB Output is correct
3 Correct 142 ms 6392 KB Output is correct
4 Correct 266 ms 6776 KB Output is correct
5 Correct 93 ms 18424 KB Output is correct
6 Correct 141 ms 18424 KB Output is correct
7 Correct 329 ms 18680 KB Output is correct
8 Correct 578 ms 19064 KB Output is correct
9 Correct 626 ms 78968 KB Output is correct
10 Correct 699 ms 78968 KB Output is correct
11 Correct 1087 ms 79408 KB Output is correct
12 Correct 1597 ms 79728 KB Output is correct
13 Correct 1392 ms 159096 KB Output is correct
14 Correct 1507 ms 159072 KB Output is correct
15 Correct 1930 ms 159324 KB Output is correct
16 Correct 2551 ms 159608 KB Output is correct
17 Correct 3810 ms 159936 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3917 ms 136824 KB Output is correct
2 Correct 4038 ms 139512 KB Output is correct
3 Correct 3987 ms 138596 KB Output is correct
4 Correct 3979 ms 139752 KB Output is correct
5 Correct 3756 ms 134864 KB Output is correct
6 Correct 2790 ms 110916 KB Output is correct
7 Execution timed out 5081 ms 161784 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 7 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 8 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 5112 KB Output is correct
9 Correct 8 ms 5112 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 8 ms 4984 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 8 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 8 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 26 ms 6008 KB Output is correct
20 Correct 29 ms 6008 KB Output is correct
21 Correct 33 ms 6136 KB Output is correct
22 Correct 35 ms 6264 KB Output is correct
23 Correct 60 ms 10496 KB Output is correct
24 Correct 76 ms 11000 KB Output is correct
25 Correct 89 ms 11384 KB Output is correct
26 Correct 92 ms 11896 KB Output is correct
27 Correct 7 ms 4984 KB Output is correct
28 Correct 8 ms 4984 KB Output is correct
29 Correct 8 ms 4984 KB Output is correct
30 Correct 18 ms 5112 KB Output is correct
31 Correct 52 ms 5496 KB Output is correct
32 Correct 7 ms 4984 KB Output is correct
33 Correct 8 ms 5368 KB Output is correct
34 Correct 9 ms 5368 KB Output is correct
35 Correct 9 ms 5368 KB Output is correct
36 Correct 20 ms 5504 KB Output is correct
37 Correct 64 ms 5880 KB Output is correct
38 Correct 16 ms 8724 KB Output is correct
39 Correct 16 ms 8724 KB Output is correct
40 Correct 18 ms 8724 KB Output is correct
41 Correct 32 ms 8856 KB Output is correct
42 Correct 99 ms 9236 KB Output is correct
43 Correct 284 ms 78868 KB Output is correct
44 Correct 284 ms 78876 KB Output is correct
45 Correct 279 ms 78740 KB Output is correct
46 Correct 323 ms 78868 KB Output is correct
47 Correct 553 ms 79256 KB Output is correct
48 Correct 15 ms 6136 KB Output is correct
49 Correct 38 ms 6136 KB Output is correct
50 Correct 142 ms 6392 KB Output is correct
51 Correct 266 ms 6776 KB Output is correct
52 Correct 93 ms 18424 KB Output is correct
53 Correct 141 ms 18424 KB Output is correct
54 Correct 329 ms 18680 KB Output is correct
55 Correct 578 ms 19064 KB Output is correct
56 Correct 626 ms 78968 KB Output is correct
57 Correct 699 ms 78968 KB Output is correct
58 Correct 1087 ms 79408 KB Output is correct
59 Correct 1597 ms 79728 KB Output is correct
60 Correct 1392 ms 159096 KB Output is correct
61 Correct 1507 ms 159072 KB Output is correct
62 Correct 1930 ms 159324 KB Output is correct
63 Correct 2551 ms 159608 KB Output is correct
64 Correct 3810 ms 159936 KB Output is correct
65 Correct 3917 ms 136824 KB Output is correct
66 Correct 4038 ms 139512 KB Output is correct
67 Correct 3987 ms 138596 KB Output is correct
68 Correct 3979 ms 139752 KB Output is correct
69 Correct 3756 ms 134864 KB Output is correct
70 Correct 2790 ms 110916 KB Output is correct
71 Execution timed out 5081 ms 161784 KB Time limit exceeded
72 Halted 0 ms 0 KB -