oj.uz

Submission #369119

# Submission time Handle Problem Language Result Execution time Memory
369119 2021-02-20T11:51:01 Z BartolM Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 408 ms 43208 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const ll MAX=(ll)INF*INF;
const int N=4e5+50;

int n, maxi;
vector <int> ls[N];
vector <int> saz;
int desaz[N], val[N];
int P[N];
vector <pip> v;
#define DEBUG 0

int name(int x) {
    if (x==P[x]) return x;
    P[x]=name(P[x]);
    return P[x];
}
int mrg(int x, int y) {
    x=name(x); y=name(y);
    if (x==y) return 0;
    P[x]=y;
    return 1;
}

int sazmi(int x) {
    int ret=lower_bound(saz.begin(), saz.end(), x)-saz.begin();
    desaz[ret]=x;
    return ret;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    s.pb(INF); t.pb(1);
    n=s.size();
    ll sol=0;

    for (int i=0; i<n; ++i) saz.pb(s[i]), saz.pb(t[i]);
    sort(saz.begin(), saz.end());
    saz.erase(unique(saz.begin(), saz.end()), saz.end());
    maxi=saz.size();

    for (int i=0; i<n; ++i) {
        s[i]=sazmi(s[i]);
        t[i]=sazmi(t[i]);
        ls[s[i]].pb(t[i]);

        val[s[i]]++, val[t[i]]--;
    }
    for (int i=0; i<maxi; ++i) {
        if (i) val[i]+=val[i-1];
//        printf("i: %d, desaz[i]: %d, val: %d\n", i, desaz[i], val[i]);
        if (val[i]<0) ls[i].pb(i+1);
        if (val[i]>0) {
            sol+=(ll)val[i]*(desaz[i+1]-desaz[i]);
            ls[i+1].pb(i);
        }
        P[i]=i;
    }
    #if DEBUG
        printf("stabilizacija: %lld\n", sol);
    #endif // DEBUG

    for (int i=0; i<maxi; ++i) {
        for (int sus:ls[i]) mrg(i, sus);
    }
    for (int i=0; i<maxi-1; ++i) {
        if (name(i)==name(i+1)) continue;
        v.pb(mp(desaz[i+1]-desaz[i], mp(name(i), name(i+1))));
    }
    sort(v.begin(), v.end());
    for (pip pp:v) sol+=(ll)pp.X*mrg(pp.Y.X, pp.Y.Y);
    return sol;

}

/*
4
1 7
4 3
5 8
6 6

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9708 KB n = 2
2 Correct 8 ms 9708 KB n = 2
3 Correct 7 ms 9708 KB n = 2
4 Correct 6 ms 9708 KB n = 2
5 Correct 6 ms 9708 KB n = 2
6 Correct 7 ms 9708 KB n = 2
7 Correct 6 ms 9708 KB n = 3
8 Correct 8 ms 9708 KB n = 3
9 Correct 7 ms 9708 KB n = 3
10 Correct 7 ms 9708 KB n = 8
11 Correct 9 ms 9708 KB n = 8
12 Correct 8 ms 9708 KB n = 8
13 Correct 7 ms 9708 KB n = 8
14 Correct 7 ms 9836 KB n = 8
15 Correct 6 ms 9708 KB n = 8
16 Correct 8 ms 9708 KB n = 8
17 Correct 7 ms 9708 KB n = 8
18 Correct 7 ms 9708 KB n = 8
19 Correct 7 ms 9708 KB n = 3
20 Correct 8 ms 9676 KB n = 7
21 Correct 7 ms 9708 KB n = 8
22 Correct 7 ms 9836 KB n = 8
23 Correct 8 ms 9708 KB n = 8
24 Correct 7 ms 9708 KB n = 8
25 Correct 8 ms 9708 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9708 KB n = 2
2 Correct 8 ms 9708 KB n = 2
3 Correct 7 ms 9708 KB n = 2
4 Correct 6 ms 9708 KB n = 2
5 Correct 6 ms 9708 KB n = 2
6 Correct 7 ms 9708 KB n = 2
7 Correct 6 ms 9708 KB n = 3
8 Correct 8 ms 9708 KB n = 3
9 Correct 7 ms 9708 KB n = 3
10 Correct 7 ms 9708 KB n = 8
11 Correct 9 ms 9708 KB n = 8
12 Correct 8 ms 9708 KB n = 8
13 Correct 7 ms 9708 KB n = 8
14 Correct 7 ms 9836 KB n = 8
15 Correct 6 ms 9708 KB n = 8
16 Correct 8 ms 9708 KB n = 8
17 Correct 7 ms 9708 KB n = 8
18 Correct 7 ms 9708 KB n = 8
19 Correct 7 ms 9708 KB n = 3
20 Correct 8 ms 9676 KB n = 7
21 Correct 7 ms 9708 KB n = 8
22 Correct 7 ms 9836 KB n = 8
23 Correct 8 ms 9708 KB n = 8
24 Correct 7 ms 9708 KB n = 8
25 Correct 8 ms 9708 KB n = 8
26 Correct 7 ms 9708 KB n = 8
27 Correct 10 ms 9708 KB n = 8
28 Correct 7 ms 9708 KB n = 8
29 Correct 7 ms 9708 KB n = 16
30 Correct 6 ms 9708 KB n = 16
31 Correct 8 ms 9708 KB n = 16
32 Correct 7 ms 9708 KB n = 16
33 Correct 9 ms 9708 KB n = 16
34 Correct 6 ms 9708 KB n = 16
35 Correct 6 ms 9708 KB n = 16
36 Correct 6 ms 9708 KB n = 15
37 Correct 8 ms 9708 KB n = 8
38 Correct 6 ms 9708 KB n = 16
39 Correct 6 ms 9708 KB n = 16
40 Correct 7 ms 9708 KB n = 9
41 Correct 8 ms 9708 KB n = 16
42 Correct 8 ms 9708 KB n = 16
43 Correct 7 ms 9708 KB n = 16
44 Correct 7 ms 9708 KB n = 9
45 Correct 6 ms 9708 KB n = 15
46 Correct 8 ms 9708 KB n = 16
47 Correct 7 ms 9708 KB n = 16
48 Correct 6 ms 9708 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 31688 KB n = 199999
2 Correct 347 ms 31944 KB n = 199991
3 Correct 315 ms 31688 KB n = 199993
4 Correct 264 ms 26432 KB n = 152076
5 Correct 147 ms 19976 KB n = 93249
6 Correct 294 ms 28744 KB n = 199910
7 Correct 311 ms 32712 KB n = 199999
8 Correct 280 ms 30024 KB n = 199997
9 Correct 284 ms 28584 KB n = 171294
10 Correct 223 ms 25240 KB n = 140872
11 Correct 288 ms 29000 KB n = 199886
12 Correct 300 ms 36552 KB n = 199996
13 Correct 275 ms 34060 KB n = 200000
14 Correct 307 ms 43080 KB n = 199998
15 Correct 281 ms 40260 KB n = 200000
16 Correct 298 ms 40700 KB n = 199998
17 Correct 296 ms 35528 KB n = 200000
18 Correct 282 ms 34840 KB n = 190000
19 Correct 268 ms 38392 KB n = 177777
20 Correct 142 ms 22744 KB n = 100000
21 Correct 312 ms 35528 KB n = 200000
22 Correct 314 ms 40136 KB n = 200000
23 Correct 285 ms 35528 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9708 KB n = 2
2 Correct 8 ms 9708 KB n = 2
3 Correct 7 ms 9708 KB n = 2
4 Correct 6 ms 9708 KB n = 2
5 Correct 6 ms 9708 KB n = 2
6 Correct 7 ms 9708 KB n = 2
7 Correct 6 ms 9708 KB n = 3
8 Correct 8 ms 9708 KB n = 3
9 Correct 7 ms 9708 KB n = 3
10 Correct 7 ms 9708 KB n = 8
11 Correct 9 ms 9708 KB n = 8
12 Correct 8 ms 9708 KB n = 8
13 Correct 7 ms 9708 KB n = 8
14 Correct 7 ms 9836 KB n = 8
15 Correct 6 ms 9708 KB n = 8
16 Correct 8 ms 9708 KB n = 8
17 Correct 7 ms 9708 KB n = 8
18 Correct 7 ms 9708 KB n = 8
19 Correct 7 ms 9708 KB n = 3
20 Correct 8 ms 9676 KB n = 7
21 Correct 7 ms 9708 KB n = 8
22 Correct 7 ms 9836 KB n = 8
23 Correct 8 ms 9708 KB n = 8
24 Correct 7 ms 9708 KB n = 8
25 Correct 8 ms 9708 KB n = 8
26 Correct 7 ms 9708 KB n = 8
27 Correct 10 ms 9708 KB n = 8
28 Correct 7 ms 9708 KB n = 8
29 Correct 7 ms 9708 KB n = 16
30 Correct 6 ms 9708 KB n = 16
31 Correct 8 ms 9708 KB n = 16
32 Correct 7 ms 9708 KB n = 16
33 Correct 9 ms 9708 KB n = 16
34 Correct 6 ms 9708 KB n = 16
35 Correct 6 ms 9708 KB n = 16
36 Correct 6 ms 9708 KB n = 15
37 Correct 8 ms 9708 KB n = 8
38 Correct 6 ms 9708 KB n = 16
39 Correct 6 ms 9708 KB n = 16
40 Correct 7 ms 9708 KB n = 9
41 Correct 8 ms 9708 KB n = 16
42 Correct 8 ms 9708 KB n = 16
43 Correct 7 ms 9708 KB n = 16
44 Correct 7 ms 9708 KB n = 9
45 Correct 6 ms 9708 KB n = 15
46 Correct 8 ms 9708 KB n = 16
47 Correct 7 ms 9708 KB n = 16
48 Correct 6 ms 9708 KB n = 16
49 Correct 343 ms 31688 KB n = 199999
50 Correct 347 ms 31944 KB n = 199991
51 Correct 315 ms 31688 KB n = 199993
52 Correct 264 ms 26432 KB n = 152076
53 Correct 147 ms 19976 KB n = 93249
54 Correct 294 ms 28744 KB n = 199910
55 Correct 311 ms 32712 KB n = 199999
56 Correct 280 ms 30024 KB n = 199997
57 Correct 284 ms 28584 KB n = 171294
58 Correct 223 ms 25240 KB n = 140872
59 Correct 288 ms 29000 KB n = 199886
60 Correct 300 ms 36552 KB n = 199996
61 Correct 275 ms 34060 KB n = 200000
62 Correct 307 ms 43080 KB n = 199998
63 Correct 281 ms 40260 KB n = 200000
64 Correct 298 ms 40700 KB n = 199998
65 Correct 296 ms 35528 KB n = 200000
66 Correct 282 ms 34840 KB n = 190000
67 Correct 268 ms 38392 KB n = 177777
68 Correct 142 ms 22744 KB n = 100000
69 Correct 312 ms 35528 KB n = 200000
70 Correct 314 ms 40136 KB n = 200000
71 Correct 285 ms 35528 KB n = 200000
72 Correct 353 ms 35528 KB n = 200000
73 Correct 333 ms 35528 KB n = 200000
74 Correct 316 ms 35528 KB n = 200000
75 Correct 352 ms 35528 KB n = 200000
76 Correct 344 ms 35656 KB n = 200000
77 Correct 245 ms 33224 KB n = 200000
78 Correct 243 ms 31688 KB n = 200000
79 Correct 356 ms 33352 KB n = 184307
80 Correct 108 ms 19600 KB n = 76040
81 Correct 282 ms 31944 KB n = 199981
82 Correct 311 ms 36808 KB n = 199994
83 Correct 307 ms 33992 KB n = 199996
84 Correct 280 ms 43208 KB n = 199998
85 Correct 286 ms 40392 KB n = 200000
86 Correct 279 ms 40648 KB n = 199998
87 Correct 303 ms 35536 KB n = 200000
88 Correct 317 ms 37192 KB n = 200000
89 Correct 350 ms 41792 KB n = 200000
90 Correct 408 ms 35528 KB n = 200000
91 Correct 382 ms 40136 KB n = 200000
92 Correct 382 ms 35520 KB n = 200000