oj.uz

Submission #658573

# Submission time Handle Problem Language Result Execution time Memory
658573 2022-11-13T14:51:09 Z Richem Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 506 ms 49828 KB 
#include <iostream>
#include <vector>
#include <map>
#define int long long

using namespace std;

const int MAX_SOMMET = 1e5+42, MAX_FEUILLE = (1 << 18), INF = 1e16;

int nbSommet, nbReq, limitePoids;

int ab[MAX_FEUILLE*2][5] = {0};
int aAdd[MAX_FEUILLE*2] = {0};

void unir(int id) {
    ab[id][0] = max(ab[id*2][0], ab[id*2+1][0]);
    ab[id][1] = min(ab[id*2][1], ab[id*2+1][1]);
    ab[id][2] = max(max(ab[id*2][2], ab[id*2+1][2]), ab[id*2][0] - 2 * ab[id*2+1][1]);
    ab[id][3] = max(max(ab[id*2][3], ab[id*2+1][3]), ab[id*2+1][0] - 2 * ab[id*2][1]);
    ab[id][4] = max(max(ab[id*2][4], ab[id*2+1][4]), max(ab[id*2][2] + ab[id*2+1][0], ab[id*2][0] + ab[id*2+1][3]));
}

void applyOp(int id, int add) {
    for(int type = 0; type < 4; type++) {
        ab[id][type] += add;
        if(type >= 2) 
            ab[id][type] -= (add * 2);
    }
    aAdd[id] += add;
}

int applyReq(int deb, int fin, int debReq, int finReq, int id, int val) {
    if(deb > finReq || fin < debReq) 
        return 0;

    if(debReq <= deb && fin <= finReq) {
        applyOp(id, val);
        return 0;
    }

    applyOp(id*2, aAdd[id]);
    applyOp(id*2+1, aAdd[id]);
    aAdd[id] = 0;

    int milieu = (deb + fin+1) / 2;

    applyReq(deb, milieu-1, debReq, finReq, id*2, val);
    applyReq(milieu, fin, debReq, finReq, id*2+1, val);

    unir(id);

    return ab[id][4];
}

int interTemps[MAX_SOMMET][2];

vector<pair<int, int>> adj[MAX_SOMMET];

int prof[MAX_SOMMET] = {0};

vector<int> eulerTour;

void dfs(int sommet, int pere) {
    interTemps[sommet][0] = eulerTour.size();
    eulerTour.push_back(sommet);

    for(auto voisin : adj[sommet]) {
        if(voisin.first == pere)
            continue;

        prof[voisin.first] = prof[sommet] + voisin.second;
        dfs(voisin.first, sommet);
        eulerTour.push_back(sommet);
    }

    interTemps[sommet][1] = eulerTour.size()-1;
}

struct Arete{
    int deb, fin, cost;
};

Arete listeArete[MAX_SOMMET];

void input() {
    cin >> nbSommet >> nbReq >> limitePoids;

    for(int arete = 0; arete < nbSommet-1; arete++) {
        int u,v,c;
        cin >> u >> v >> c;
        if(u > v)
            swap(u, v);

        adj[--u].push_back({--v, c});
        adj[v].push_back({u, c});

        listeArete[arete] = {u, v, c};
    }
}

int last = 0;

int calcReq(int d, int e) {
    Arete qui = listeArete[(d + last) % (nbSommet-1)];
    int poidsNouv = (e + last) % limitePoids;

    int u = qui.deb, v = qui.fin;

    if(interTemps[u][0] < interTemps[v][0])
        swap(u, v);

    int rep = applyReq(0, MAX_FEUILLE-1, interTemps[u][0], interTemps[u][1], 1, poidsNouv - qui.cost);
    listeArete[(d + last) % (nbSommet-1)] = {u, v, poidsNouv};

    last = rep;


    return rep;
}

void printAb() {
    for(int i = 1; i < MAX_FEUILLE*2; i++) {
        cout << i << " ";
        for(int j = 0; j < 5; j++) {
            cout << ab[i][j] << " ";
        }
        cout << endl;
    }
}

signed main() {
    input();
    dfs(0, -1);

    for(int i = 0; i < MAX_FEUILLE*2; i++) {
        for(int j = 0; j < 5; j++) {
            ab[i][j] = -INF;
            if(j == 1)
                ab[i][j] = INF;
        }
    }

    for(int id = 0; id < eulerTour.size(); id++) {
        int posAb = id + MAX_FEUILLE;

        ab[posAb][0] = ab[posAb][1] = prof[eulerTour[id]];
        ab[posAb][2] = ab[posAb][3] = -prof[eulerTour[id]];
    }

    for(int noeud = MAX_FEUILLE-1; noeud > 0; noeud--) {
        unir(noeud);
    }

    for(int req = 0; req < nbReq; req++) {
        int d,e;
        cin >> d >> e;

        cout << calcReq(d, e) << "\n";
    }
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:143:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |     for(int id = 0; id < eulerTour.size(); id++) {
      |                     ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23124 KB Output is correct
2 Correct 15 ms 23192 KB Output is correct
3 Correct 15 ms 23260 KB Output is correct
4 Correct 13 ms 23124 KB Output is correct
5 Correct 13 ms 23124 KB Output is correct
6 Correct 15 ms 23176 KB Output is correct
7 Correct 13 ms 23252 KB Output is correct
8 Correct 15 ms 23252 KB Output is correct
9 Correct 18 ms 23252 KB Output is correct
10 Correct 17 ms 23252 KB Output is correct
11 Correct 13 ms 23180 KB Output is correct
12 Correct 16 ms 23124 KB Output is correct
13 Correct 14 ms 23200 KB Output is correct
14 Correct 14 ms 23252 KB Output is correct
15 Correct 14 ms 23288 KB Output is correct
16 Correct 14 ms 23252 KB Output is correct
17 Correct 13 ms 23264 KB Output is correct
18 Correct 13 ms 23200 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23124 KB Output is correct
2 Correct 15 ms 23192 KB Output is correct
3 Correct 15 ms 23260 KB Output is correct
4 Correct 13 ms 23124 KB Output is correct
5 Correct 13 ms 23124 KB Output is correct
6 Correct 15 ms 23176 KB Output is correct
7 Correct 13 ms 23252 KB Output is correct
8 Correct 15 ms 23252 KB Output is correct
9 Correct 18 ms 23252 KB Output is correct
10 Correct 17 ms 23252 KB Output is correct
11 Correct 13 ms 23180 KB Output is correct
12 Correct 16 ms 23124 KB Output is correct
13 Correct 14 ms 23200 KB Output is correct
14 Correct 14 ms 23252 KB Output is correct
15 Correct 14 ms 23288 KB Output is correct
16 Correct 14 ms 23252 KB Output is correct
17 Correct 13 ms 23264 KB Output is correct
18 Correct 13 ms 23200 KB Output is correct
19 Correct 31 ms 23424 KB Output is correct
20 Correct 34 ms 23364 KB Output is correct
21 Correct 29 ms 23452 KB Output is correct
22 Correct 33 ms 23380 KB Output is correct
23 Correct 28 ms 24052 KB Output is correct
24 Correct 29 ms 24172 KB Output is correct
25 Correct 29 ms 24200 KB Output is correct
26 Correct 31 ms 24492 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23212 KB Output is correct
2 Correct 12 ms 23124 KB Output is correct
3 Correct 21 ms 23200 KB Output is correct
4 Correct 70 ms 23268 KB Output is correct
5 Correct 214 ms 23824 KB Output is correct
6 Correct 14 ms 23124 KB Output is correct
7 Correct 13 ms 23252 KB Output is correct
8 Correct 14 ms 23256 KB Output is correct
9 Correct 18 ms 23256 KB Output is correct
10 Correct 64 ms 23372 KB Output is correct
11 Correct 230 ms 23796 KB Output is correct
12 Correct 15 ms 24020 KB Output is correct
13 Correct 18 ms 24020 KB Output is correct
14 Correct 20 ms 24012 KB Output is correct
15 Correct 60 ms 24172 KB Output is correct
16 Correct 236 ms 24536 KB Output is correct
17 Correct 84 ms 34656 KB Output is correct
18 Correct 94 ms 35700 KB Output is correct
19 Correct 87 ms 37312 KB Output is correct
20 Correct 135 ms 37564 KB Output is correct
21 Correct 347 ms 38096 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23380 KB Output is correct
2 Correct 36 ms 23524 KB Output is correct
3 Correct 122 ms 23804 KB Output is correct
4 Correct 228 ms 23992 KB Output is correct
5 Correct 24 ms 24896 KB Output is correct
6 Correct 46 ms 25128 KB Output is correct
7 Correct 135 ms 25260 KB Output is correct
8 Correct 257 ms 26468 KB Output is correct
9 Correct 57 ms 31508 KB Output is correct
10 Correct 80 ms 31668 KB Output is correct
11 Correct 186 ms 32320 KB Output is correct
12 Correct 334 ms 33272 KB Output is correct
13 Correct 104 ms 39280 KB Output is correct
14 Correct 128 ms 39920 KB Output is correct
15 Correct 220 ms 40544 KB Output is correct
16 Correct 359 ms 41344 KB Output is correct
17 Correct 348 ms 41232 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 470 ms 41604 KB Output is correct
2 Correct 431 ms 43604 KB Output is correct
3 Correct 435 ms 43616 KB Output is correct
4 Correct 448 ms 43780 KB Output is correct
5 Correct 464 ms 43300 KB Output is correct
6 Correct 428 ms 41888 KB Output is correct
7 Correct 488 ms 46092 KB Output is correct
8 Correct 480 ms 46212 KB Output is correct
9 Correct 477 ms 46052 KB Output is correct
10 Correct 492 ms 46136 KB Output is correct
11 Correct 489 ms 45504 KB Output is correct
12 Correct 471 ms 43584 KB Output is correct
13 Correct 504 ms 49780 KB Output is correct
14 Correct 478 ms 49708 KB Output is correct
15 Correct 506 ms 49780 KB Output is correct
16 Correct 500 ms 49828 KB Output is correct
17 Correct 489 ms 48880 KB Output is correct
18 Correct 466 ms 44864 KB Output is correct
19 Correct 487 ms 49744 KB Output is correct
20 Correct 480 ms 49720 KB Output is correct
21 Correct 484 ms 49792 KB Output is correct
22 Correct 489 ms 49752 KB Output is correct
23 Correct 475 ms 49004 KB Output is correct
24 Correct 460 ms 44764 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23124 KB Output is correct
2 Correct 15 ms 23192 KB Output is correct
3 Correct 15 ms 23260 KB Output is correct
4 Correct 13 ms 23124 KB Output is correct
5 Correct 13 ms 23124 KB Output is correct
6 Correct 15 ms 23176 KB Output is correct
7 Correct 13 ms 23252 KB Output is correct
8 Correct 15 ms 23252 KB Output is correct
9 Correct 18 ms 23252 KB Output is correct
10 Correct 17 ms 23252 KB Output is correct
11 Correct 13 ms 23180 KB Output is correct
12 Correct 16 ms 23124 KB Output is correct
13 Correct 14 ms 23200 KB Output is correct
14 Correct 14 ms 23252 KB Output is correct
15 Correct 14 ms 23288 KB Output is correct
16 Correct 14 ms 23252 KB Output is correct
17 Correct 13 ms 23264 KB Output is correct
18 Correct 13 ms 23200 KB Output is correct
19 Correct 31 ms 23424 KB Output is correct
20 Correct 34 ms 23364 KB Output is correct
21 Correct 29 ms 23452 KB Output is correct
22 Correct 33 ms 23380 KB Output is correct
23 Correct 28 ms 24052 KB Output is correct
24 Correct 29 ms 24172 KB Output is correct
25 Correct 29 ms 24200 KB Output is correct
26 Correct 31 ms 24492 KB Output is correct
27 Correct 13 ms 23212 KB Output is correct
28 Correct 12 ms 23124 KB Output is correct
29 Correct 21 ms 23200 KB Output is correct
30 Correct 70 ms 23268 KB Output is correct
31 Correct 214 ms 23824 KB Output is correct
32 Correct 14 ms 23124 KB Output is correct
33 Correct 13 ms 23252 KB Output is correct
34 Correct 14 ms 23256 KB Output is correct
35 Correct 18 ms 23256 KB Output is correct
36 Correct 64 ms 23372 KB Output is correct
37 Correct 230 ms 23796 KB Output is correct
38 Correct 15 ms 24020 KB Output is correct
39 Correct 18 ms 24020 KB Output is correct
40 Correct 20 ms 24012 KB Output is correct
41 Correct 60 ms 24172 KB Output is correct
42 Correct 236 ms 24536 KB Output is correct
43 Correct 84 ms 34656 KB Output is correct
44 Correct 94 ms 35700 KB Output is correct
45 Correct 87 ms 37312 KB Output is correct
46 Correct 135 ms 37564 KB Output is correct
47 Correct 347 ms 38096 KB Output is correct
48 Correct 15 ms 23380 KB Output is correct
49 Correct 36 ms 23524 KB Output is correct
50 Correct 122 ms 23804 KB Output is correct
51 Correct 228 ms 23992 KB Output is correct
52 Correct 24 ms 24896 KB Output is correct
53 Correct 46 ms 25128 KB Output is correct
54 Correct 135 ms 25260 KB Output is correct
55 Correct 257 ms 26468 KB Output is correct
56 Correct 57 ms 31508 KB Output is correct
57 Correct 80 ms 31668 KB Output is correct
58 Correct 186 ms 32320 KB Output is correct
59 Correct 334 ms 33272 KB Output is correct
60 Correct 104 ms 39280 KB Output is correct
61 Correct 128 ms 39920 KB Output is correct
62 Correct 220 ms 40544 KB Output is correct
63 Correct 359 ms 41344 KB Output is correct
64 Correct 348 ms 41232 KB Output is correct
65 Correct 470 ms 41604 KB Output is correct
66 Correct 431 ms 43604 KB Output is correct
67 Correct 435 ms 43616 KB Output is correct
68 Correct 448 ms 43780 KB Output is correct
69 Correct 464 ms 43300 KB Output is correct
70 Correct 428 ms 41888 KB Output is correct
71 Correct 488 ms 46092 KB Output is correct
72 Correct 480 ms 46212 KB Output is correct
73 Correct 477 ms 46052 KB Output is correct
74 Correct 492 ms 46136 KB Output is correct
75 Correct 489 ms 45504 KB Output is correct
76 Correct 471 ms 43584 KB Output is correct
77 Correct 504 ms 49780 KB Output is correct
78 Correct 478 ms 49708 KB Output is correct
79 Correct 506 ms 49780 KB Output is correct
80 Correct 500 ms 49828 KB Output is correct
81 Correct 489 ms 48880 KB Output is correct
82 Correct 466 ms 44864 KB Output is correct
83 Correct 487 ms 49744 KB Output is correct
84 Correct 480 ms 49720 KB Output is correct
85 Correct 484 ms 49792 KB Output is correct
86 Correct 489 ms 49752 KB Output is correct
87 Correct 475 ms 49004 KB Output is correct
88 Correct 460 ms 44764 KB Output is correct
89 Correct 416 ms 42596 KB Output is correct
90 Correct 436 ms 43044 KB Output is correct
91 Correct 436 ms 44284 KB Output is correct
92 Correct 423 ms 44328 KB Output is correct
93 Correct 428 ms 46576 KB Output is correct
94 Correct 437 ms 45660 KB Output is correct
95 Correct 450 ms 47108 KB Output is correct
96 Correct 464 ms 46228 KB Output is correct
97 Correct 462 ms 47068 KB Output is correct
98 Correct 450 ms 48884 KB Output is correct
99 Correct 448 ms 46904 KB Output is correct
100 Correct 451 ms 46776 KB Output is correct