oj.uz

Submission #240265

# Submission time Handle Problem Language Result Execution time Memory
240265 2020-06-19T04:24:49 Z lyc Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 278 ms 18280 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cout << #x << " :: " << x << endl;
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

struct UnionFind {
    vector<int> p, sz;
    UnionFind(int n) { p.assign(n,0); iota(ALL(p),0); sz.assign(n,1); }
    int finds(int i) { return (p[i] == i) ? i : (p[i] = finds(p[i])); }
    bool unions(int i, int j) {
        int x = finds(i), y = finds(j);
        if (x != y) {
            if (sz[x] < sz[y]) swap(x,y);
            p[y] = x, sz[x] += sz[y];
            return true;
        } return false;
    }
};

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int N = SZ(s);
    vector<int> vals;
    for (int x : s) vals.push_back(x);
    for (int x : t) vals.push_back(x);
    sort(ALL(vals)); vals.resize(unique(ALL(vals))-vals.begin());
    int V = SZ(vals);
    int seg[V] = {0}; seg[0] = -1;
    UnionFind UF(V);
    FOR(i,0,N-1){
        s[i] = lower_bound(ALL(vals),s[i])-vals.begin();
        t[i] = lower_bound(ALL(vals),t[i])-vals.begin();
        if (s[i] <= t[i]) ++seg[s[i]], --seg[t[i]];
        else --seg[t[i]], ++seg[s[i]];
        UF.unions(s[i],t[i]);
    }
    long long ans = 0;
    vector<tuple<int,int,int>> el;
    FOR(i,0,V-2){
        if (i > 0) seg[i] += seg[i-1];
        if (seg[i] != 0) {
            ans += (long long) max(0,seg[i]) * (vals[i+1]-vals[i]);
            UF.unions(i,i+1);
        } else {
            el.emplace_back(vals[i+1]-vals[i],i,i+1);
        }
    }
    sort(ALL(el));
    for (auto& [w,u,v] : el) if (UF.unions(u,v)) { ans += w; }
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 13696 KB n = 199999
2 Correct 215 ms 13800 KB n = 199991
3 Correct 222 ms 13672 KB n = 199993
4 Correct 170 ms 10216 KB n = 152076
5 Correct 100 ms 6636 KB n = 93249
6 Correct 194 ms 11816 KB n = 199910
7 Correct 193 ms 12904 KB n = 199999
8 Correct 184 ms 11880 KB n = 199997
9 Correct 207 ms 11752 KB n = 171294
10 Correct 156 ms 9832 KB n = 140872
11 Correct 182 ms 11880 KB n = 199886
12 Correct 200 ms 13548 KB n = 199996
13 Correct 189 ms 12520 KB n = 200000
14 Correct 210 ms 17260 KB n = 199998
15 Correct 212 ms 17256 KB n = 200000
16 Correct 241 ms 17768 KB n = 199998
17 Correct 204 ms 13676 KB n = 200000
18 Correct 213 ms 13160 KB n = 190000
19 Correct 184 ms 12268 KB n = 177777
20 Correct 96 ms 7148 KB n = 100000
21 Correct 203 ms 13800 KB n = 200000
22 Correct 244 ms 18152 KB n = 200000
23 Correct 267 ms 18280 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB n = 2
2 Correct 4 ms 256 KB n = 2
3 Correct 5 ms 256 KB n = 2
4 Correct 5 ms 256 KB n = 2
5 Correct 5 ms 256 KB n = 2
6 Correct 5 ms 128 KB n = 2
7 Correct 5 ms 256 KB n = 3
8 Correct 5 ms 256 KB n = 3
9 Correct 5 ms 256 KB n = 3
10 Correct 5 ms 256 KB n = 8
11 Correct 5 ms 384 KB n = 8
12 Correct 5 ms 256 KB n = 8
13 Correct 5 ms 256 KB n = 8
14 Correct 5 ms 384 KB n = 8
15 Correct 5 ms 256 KB n = 8
16 Correct 5 ms 384 KB n = 8
17 Correct 5 ms 384 KB n = 8
18 Correct 5 ms 256 KB n = 8
19 Correct 5 ms 256 KB n = 3
20 Correct 5 ms 256 KB n = 7
21 Correct 5 ms 384 KB n = 8
22 Correct 5 ms 256 KB n = 8
23 Correct 5 ms 384 KB n = 8
24 Correct 5 ms 256 KB n = 8
25 Correct 4 ms 256 KB n = 8
26 Correct 5 ms 256 KB n = 8
27 Correct 5 ms 256 KB n = 8
28 Correct 5 ms 256 KB n = 8
29 Correct 5 ms 256 KB n = 16
30 Correct 5 ms 256 KB n = 16
31 Correct 5 ms 384 KB n = 16
32 Correct 5 ms 256 KB n = 16
33 Correct 5 ms 384 KB n = 16
34 Correct 5 ms 384 KB n = 16
35 Correct 5 ms 384 KB n = 16
36 Correct 5 ms 256 KB n = 15
37 Correct 5 ms 256 KB n = 8
38 Correct 5 ms 256 KB n = 16
39 Correct 5 ms 256 KB n = 16
40 Correct 5 ms 512 KB n = 9
41 Correct 5 ms 256 KB n = 16
42 Correct 5 ms 256 KB n = 16
43 Correct 5 ms 256 KB n = 16
44 Correct 5 ms 256 KB n = 9
45 Correct 5 ms 256 KB n = 15
46 Correct 5 ms 256 KB n = 16
47 Correct 5 ms 384 KB n = 16
48 Correct 5 ms 256 KB n = 16
49 Correct 219 ms 13696 KB n = 199999
50 Correct 215 ms 13800 KB n = 199991
51 Correct 222 ms 13672 KB n = 199993
52 Correct 170 ms 10216 KB n = 152076
53 Correct 100 ms 6636 KB n = 93249
54 Correct 194 ms 11816 KB n = 199910
55 Correct 193 ms 12904 KB n = 199999
56 Correct 184 ms 11880 KB n = 199997
57 Correct 207 ms 11752 KB n = 171294
58 Correct 156 ms 9832 KB n = 140872
59 Correct 182 ms 11880 KB n = 199886
60 Correct 200 ms 13548 KB n = 199996
61 Correct 189 ms 12520 KB n = 200000
62 Correct 210 ms 17260 KB n = 199998
63 Correct 212 ms 17256 KB n = 200000
64 Correct 241 ms 17768 KB n = 199998
65 Correct 204 ms 13676 KB n = 200000
66 Correct 213 ms 13160 KB n = 190000
67 Correct 184 ms 12268 KB n = 177777
68 Correct 96 ms 7148 KB n = 100000
69 Correct 203 ms 13800 KB n = 200000
70 Correct 244 ms 18152 KB n = 200000
71 Correct 267 ms 18280 KB n = 200000
72 Correct 227 ms 13672 KB n = 200000
73 Correct 227 ms 13912 KB n = 200000
74 Correct 214 ms 13800 KB n = 200000
75 Correct 223 ms 13672 KB n = 200000
76 Correct 233 ms 13816 KB n = 200000
77 Correct 175 ms 11368 KB n = 200000
78 Correct 203 ms 15848 KB n = 200000
79 Correct 219 ms 12520 KB n = 184307
80 Correct 75 ms 5488 KB n = 76040
81 Correct 204 ms 11828 KB n = 199981
82 Correct 194 ms 13548 KB n = 199994
83 Correct 188 ms 12648 KB n = 199996
84 Correct 208 ms 17384 KB n = 199998
85 Correct 203 ms 17256 KB n = 200000
86 Correct 224 ms 17896 KB n = 199998
87 Correct 219 ms 13800 KB n = 200000
88 Correct 211 ms 13804 KB n = 200000
89 Correct 204 ms 13836 KB n = 200000
90 Correct 211 ms 13800 KB n = 200000
91 Correct 259 ms 18280 KB n = 200000
92 Correct 278 ms 18280 KB n = 200000