oj.uz

Submission #20750

# Submission time Handle Problem Language Result Execution time Memory
20750 2017-02-15T16:06:20 Z ainta Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 279 ms 24408 KB 
#include "railroad.h"
#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
int n, X[410000], cnt, Ideg[410000], Odeg[410000], P[410000];
bool v[410000];
int UF[410000];
struct Edge{
    int a, b, c;
    bool operator<(const Edge &p)const{
        return c<p.c;
    }
}w[410000];
int Find(int a){
    if(a==UF[a])return a;
    return UF[a] = Find(UF[a]);
}
void Merge(int a, int b){
    a=Find(a),b=Find(b);
    if(a!=b)UF[a]=b;
}
void Add(int a, int b, int c){
    if(c<=0)return;
    Odeg[a]+=c, Ideg[b]+=c;
    Merge(a,b);
}
long long plan_roller_coaster(vector<int> s, vector<int> t) {
    n = s.size();
    int i;
    for(i=0;i<n;i++){
        X[++cnt] = s[i];
        X[++cnt] = t[i];
    }
    X[++cnt] = 0, X[++cnt] = 2e9;
    sort(X+1,X+cnt+1);
    for(i=1;i<=cnt;i++)UF[i] = i;
    for(i=0;i<n;i++){
        s[i] = lower_bound(X+1,X+cnt+1,s[i])-X;
        t[i] = lower_bound(X+1,X+cnt+1,t[i])-X;
        Add(s[i],t[i],1);
    }
    Add(cnt,1,1);
    int sum = 0;
    long long res = 0;
    for(i=1;i<=cnt;i++){
        sum += Ideg[i] - Odeg[i];
        P[i] = -sum;
        if(sum < 0){
            res += 1ll * (-sum) * (X[i+1]-X[i]);
        }
    }
    for(i=1;i<cnt;i++){
        Add(i+1,i,P[i]);
    }
    for(i=1;i<cnt;i++){
        Add(i,i+1,Ideg[i]-Odeg[i]);
        w[i].a=i,w[i].b=i+1,w[i].c=X[i+1]-X[i];
    }
    sort(w+1,w+cnt);
    for(i=1;i<cnt;i++){
        if(Find(w[i].a)!=Find(w[i].b)){
            res += w[i].c;
            Merge(w[i].a,w[i].b);
        }
    }
    return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 18284 KB n = 199999
2 Correct 266 ms 18284 KB n = 199991
3 Correct 246 ms 18284 KB n = 199993
4 Correct 193 ms 17532 KB n = 152076
5 Correct 113 ms 16620 KB n = 93249
6 Correct 219 ms 18284 KB n = 199910
7 Correct 239 ms 18668 KB n = 199999
8 Correct 199 ms 18800 KB n = 199997
9 Correct 216 ms 17836 KB n = 171294
10 Correct 173 ms 17356 KB n = 140872
11 Correct 219 ms 18284 KB n = 199886
12 Correct 233 ms 18764 KB n = 199996
13 Correct 233 ms 18856 KB n = 200000
14 Correct 236 ms 20040 KB n = 199998
15 Correct 229 ms 19460 KB n = 200000
16 Correct 239 ms 19268 KB n = 199998
17 Correct 236 ms 18284 KB n = 200000
18 Correct 239 ms 18124 KB n = 190000
19 Correct 213 ms 20584 KB n = 177777
20 Correct 123 ms 16716 KB n = 100000
21 Correct 273 ms 18284 KB n = 200000
22 Correct 239 ms 18284 KB n = 200000
23 Correct 253 ms 18284 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 15148 KB n = 2
2 Correct 0 ms 15148 KB n = 2
3 Correct 0 ms 15148 KB n = 2
4 Correct 0 ms 15148 KB n = 2
5 Correct 0 ms 15148 KB n = 2
6 Correct 0 ms 15148 KB n = 2
7 Correct 0 ms 15148 KB n = 3
8 Correct 0 ms 15148 KB n = 3
9 Correct 0 ms 15148 KB n = 3
10 Correct 0 ms 15148 KB n = 8
11 Correct 0 ms 15148 KB n = 8
12 Correct 0 ms 15148 KB n = 8
13 Correct 0 ms 15148 KB n = 8
14 Correct 0 ms 15148 KB n = 8
15 Correct 0 ms 15148 KB n = 8
16 Correct 0 ms 15148 KB n = 8
17 Correct 0 ms 15148 KB n = 8
18 Correct 0 ms 15148 KB n = 8
19 Correct 0 ms 15148 KB n = 3
20 Correct 0 ms 15148 KB n = 7
21 Correct 0 ms 15148 KB n = 8
22 Correct 0 ms 15148 KB n = 8
23 Correct 0 ms 15148 KB n = 8
24 Correct 0 ms 15148 KB n = 8
25 Correct 0 ms 15148 KB n = 8
26 Correct 0 ms 15148 KB n = 8
27 Correct 0 ms 15148 KB n = 8
28 Correct 0 ms 15148 KB n = 8
29 Correct 0 ms 15148 KB n = 16
30 Correct 0 ms 15148 KB n = 16
31 Correct 0 ms 15148 KB n = 16
32 Correct 0 ms 15148 KB n = 16
33 Correct 0 ms 15148 KB n = 16
34 Correct 0 ms 15148 KB n = 16
35 Correct 0 ms 15148 KB n = 16
36 Correct 0 ms 15148 KB n = 15
37 Correct 0 ms 15148 KB n = 8
38 Correct 0 ms 15148 KB n = 16
39 Correct 0 ms 15148 KB n = 16
40 Correct 0 ms 15148 KB n = 9
41 Correct 0 ms 15148 KB n = 16
42 Correct 0 ms 15148 KB n = 16
43 Correct 0 ms 15148 KB n = 16
44 Correct 0 ms 15148 KB n = 9
45 Correct 0 ms 15148 KB n = 15
46 Correct 0 ms 15148 KB n = 16
47 Correct 0 ms 15148 KB n = 16
48 Correct 0 ms 15148 KB n = 16
49 Correct 279 ms 18284 KB n = 199999
50 Correct 266 ms 18284 KB n = 199991
51 Correct 246 ms 18284 KB n = 199993
52 Correct 193 ms 17532 KB n = 152076
53 Correct 113 ms 16620 KB n = 93249
54 Correct 219 ms 18284 KB n = 199910
55 Correct 239 ms 18668 KB n = 199999
56 Correct 199 ms 18800 KB n = 199997
57 Correct 216 ms 17836 KB n = 171294
58 Correct 173 ms 17356 KB n = 140872
59 Correct 219 ms 18284 KB n = 199886
60 Correct 233 ms 18764 KB n = 199996
61 Correct 233 ms 18856 KB n = 200000
62 Correct 236 ms 20040 KB n = 199998
63 Correct 229 ms 19460 KB n = 200000
64 Correct 239 ms 19268 KB n = 199998
65 Correct 236 ms 18284 KB n = 200000
66 Correct 239 ms 18124 KB n = 190000
67 Correct 213 ms 20584 KB n = 177777
68 Correct 123 ms 16716 KB n = 100000
69 Correct 273 ms 18284 KB n = 200000
70 Correct 239 ms 18284 KB n = 200000
71 Correct 253 ms 18284 KB n = 200000
72 Correct 263 ms 18284 KB n = 200000
73 Correct 269 ms 18284 KB n = 200000
74 Correct 239 ms 18284 KB n = 200000
75 Correct 233 ms 18284 KB n = 200000
76 Correct 243 ms 18284 KB n = 200000
77 Correct 226 ms 24408 KB n = 200000
78 Correct 206 ms 18284 KB n = 200000
79 Correct 233 ms 18028 KB n = 184307
80 Correct 96 ms 16348 KB n = 76040
81 Correct 219 ms 18284 KB n = 199981
82 Correct 236 ms 18760 KB n = 199994
83 Correct 206 ms 18860 KB n = 199996
84 Correct 223 ms 20048 KB n = 199998
85 Correct 233 ms 19468 KB n = 200000
86 Correct 243 ms 19268 KB n = 199998
87 Correct 233 ms 18284 KB n = 200000
88 Correct 253 ms 18284 KB n = 200000
89 Correct 229 ms 21284 KB n = 200000
90 Correct 233 ms 18284 KB n = 200000
91 Correct 239 ms 18284 KB n = 200000
92 Correct 233 ms 18284 KB n = 200000