oj.uz

답안 #419266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419266 2021-06-06T17:03:18 Z JeanBombeur Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 148 ms 24484 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include "railroad.h"
using namespace std;

//   <|°_°|>

const int INFINI = (1000 * 1000 * 1000);
const int MAX_COORD = (400 * 1000 + 2);

int Dsu[MAX_COORD];

pair <long long, int> Evenements[MAX_COORD];

long long Sommes[MAX_COORD];

long long Correspondances[MAX_COORD];

pair <long long, int> Aretes[MAX_COORD];
int nbAretes = 0;

long long coutTotal = 0;

int nbSections;

int Find(int a) {
    if (Dsu[a] < 0)
        return a;
    return Dsu[a] = Find(Dsu[a]);
}

void Union(int a, int b) {
    int rA = Find(a), rB = Find(b);
    if (rA == rB)
        return;
    if (Dsu[rA] > Dsu[rB])
        swap(rA, rB);
    Dsu[rA] += Dsu[rB];
    Dsu[rB] = rA;
    return;
}

long long plan_roller_coaster(vector<int> Entrees, vector<int> Sorties) {
    Entrees.push_back(INFINI);
    Sorties.push_back(1LL);
    nbSections = Entrees.size();
    for (int i = 0; i < nbSections; i ++)
    {
        Evenements[2 * i] = {(long long)Entrees[i], i + 1};
        Evenements[2 * i + 1] = {(long long)Sorties[i], - (i + 1)};
    }
    sort(Evenements, Evenements + 2 * nbSections);
    
    int nbDiff = 0;
    
    for (int i = 0; i < 2 * nbSections; i ++)
    {
        int dep = i;
        while (i < 2 * nbSections && Evenements[i].first == Evenements[i + 1].first)
            i ++;
        for (int j = dep; j <= i; j ++)
        {
            int id = Evenements[j].second;
            if (id > 0)
            {
                Entrees[id - 1] = nbDiff;
                Sommes[nbDiff] ++;
            }
            else
            {
                Sorties[- id - 1] = nbDiff;
                Sommes[nbDiff] --;
            }
        }
        Correspondances[nbDiff ++] = Evenements[i].first;
    }
    
    for (int i = 0; i < nbDiff; i ++)
    {
        Dsu[i] = -1;
    }
    
    for (int i = 0; i < nbSections; i ++)
    {
        Union(Entrees[i], Sorties[i]);
    }
    
    long long nbOuverts = 0;
    
    for (int i = 0; i < nbDiff - 1; i ++)
    {
        nbOuverts += Sommes[i];
        coutTotal += max(0LL, nbOuverts) * (Correspondances[i + 1] - Correspondances[i]);
        if (nbOuverts != 0)
        {
            Union(i, i + 1);
        }
        else if (Find(i) != Find(i + 1))
        {
            Aretes[nbAretes ++] = {Correspondances[i + 1] - Correspondances[i], i};
        }
    }
    sort(Aretes, Aretes + nbAretes);
    
    for (int i = 0; i < nbAretes; i ++)
    {
        int id = Aretes[i].second;
        if (Find(id) != Find(id + 1))
        {
            coutTotal += Correspondances[id + 1] - Correspondances[id];
            Union(id, id + 1);
        }
    }
    
    return coutTotal;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 0 ms 332 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 332 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 0 ms 332 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 332 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 1 ms 204 KB n = 8
28 Correct 1 ms 204 KB n = 8
29 Correct 1 ms 204 KB n = 16
30 Correct 0 ms 332 KB n = 16
31 Correct 1 ms 204 KB n = 16
32 Correct 1 ms 204 KB n = 16
33 Correct 1 ms 332 KB n = 16
34 Correct 1 ms 204 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 0 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 1 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 0 ms 204 KB n = 9
41 Correct 0 ms 332 KB n = 16
42 Correct 0 ms 204 KB n = 16
43 Correct 1 ms 332 KB n = 16
44 Correct 1 ms 204 KB n = 9
45 Correct 1 ms 204 KB n = 15
46 Correct 1 ms 332 KB n = 16
47 Correct 1 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 17452 KB n = 199999
2 Correct 114 ms 17456 KB n = 199991
3 Correct 104 ms 17444 KB n = 199993
4 Correct 78 ms 13356 KB n = 152076
5 Correct 52 ms 8292 KB n = 93249
6 Correct 104 ms 16104 KB n = 199910
7 Correct 106 ms 17360 KB n = 199999
8 Correct 102 ms 16044 KB n = 199997
9 Correct 96 ms 15012 KB n = 171294
10 Correct 76 ms 12328 KB n = 140872
11 Correct 101 ms 16176 KB n = 199886
12 Correct 111 ms 17588 KB n = 199996
13 Correct 120 ms 16564 KB n = 200000
14 Correct 116 ms 18664 KB n = 199998
15 Correct 117 ms 18664 KB n = 200000
16 Correct 128 ms 18980 KB n = 199998
17 Correct 123 ms 17444 KB n = 200000
18 Correct 103 ms 16652 KB n = 190000
19 Correct 92 ms 15524 KB n = 177777
20 Correct 53 ms 8884 KB n = 100000
21 Correct 110 ms 17452 KB n = 200000
22 Correct 148 ms 20632 KB n = 200000
23 Correct 136 ms 20652 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 0 ms 332 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 0 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 332 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 1 ms 204 KB n = 8
28 Correct 1 ms 204 KB n = 8
29 Correct 1 ms 204 KB n = 16
30 Correct 0 ms 332 KB n = 16
31 Correct 1 ms 204 KB n = 16
32 Correct 1 ms 204 KB n = 16
33 Correct 1 ms 332 KB n = 16
34 Correct 1 ms 204 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 0 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 1 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 0 ms 204 KB n = 9
41 Correct 0 ms 332 KB n = 16
42 Correct 0 ms 204 KB n = 16
43 Correct 1 ms 332 KB n = 16
44 Correct 1 ms 204 KB n = 9
45 Correct 1 ms 204 KB n = 15
46 Correct 1 ms 332 KB n = 16
47 Correct 1 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16
49 Correct 132 ms 17452 KB n = 199999
50 Correct 114 ms 17456 KB n = 199991
51 Correct 104 ms 17444 KB n = 199993
52 Correct 78 ms 13356 KB n = 152076
53 Correct 52 ms 8292 KB n = 93249
54 Correct 104 ms 16104 KB n = 199910
55 Correct 106 ms 17360 KB n = 199999
56 Correct 102 ms 16044 KB n = 199997
57 Correct 96 ms 15012 KB n = 171294
58 Correct 76 ms 12328 KB n = 140872
59 Correct 101 ms 16176 KB n = 199886
60 Correct 111 ms 17588 KB n = 199996
61 Correct 120 ms 16564 KB n = 200000
62 Correct 116 ms 18664 KB n = 199998
63 Correct 117 ms 18664 KB n = 200000
64 Correct 128 ms 18980 KB n = 199998
65 Correct 123 ms 17444 KB n = 200000
66 Correct 103 ms 16652 KB n = 190000
67 Correct 92 ms 15524 KB n = 177777
68 Correct 53 ms 8884 KB n = 100000
69 Correct 110 ms 17452 KB n = 200000
70 Correct 148 ms 20632 KB n = 200000
71 Correct 136 ms 20652 KB n = 200000
72 Correct 108 ms 17508 KB n = 200000
73 Correct 112 ms 17452 KB n = 200000
74 Correct 118 ms 17444 KB n = 200000
75 Correct 125 ms 21396 KB n = 200000
76 Correct 110 ms 21408 KB n = 200000
77 Correct 101 ms 17444 KB n = 200000
78 Correct 138 ms 20636 KB n = 200000
79 Correct 104 ms 19560 KB n = 184307
80 Correct 45 ms 8288 KB n = 76040
81 Correct 103 ms 18968 KB n = 199981
82 Correct 121 ms 20764 KB n = 199994
83 Correct 131 ms 19364 KB n = 199996
84 Correct 114 ms 21668 KB n = 199998
85 Correct 123 ms 21624 KB n = 200000
86 Correct 131 ms 22436 KB n = 199998
87 Correct 104 ms 21408 KB n = 200000
88 Correct 114 ms 21284 KB n = 200000
89 Correct 102 ms 21284 KB n = 200000
90 Correct 111 ms 21392 KB n = 200000
91 Correct 143 ms 24484 KB n = 200000
92 Correct 141 ms 24480 KB n = 200000