oj.uz

Submission #635937

# Submission time Handle Problem Language Result Execution time Memory
635937 2022-08-27T12:22:03 Z PoonYaPat Roller Coaster Railroad (IOI16_railroad) C++14
64 / 100
 765 ms 84216 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tu;

ll ans;
int p[400010],cross[400010],lv[400010],dis[400010];
vector<int> adj[400010];
vector<tu> v;
set<int> ss;
map<int,int> c;

void dfs(int x, int val) {
    p[x]=val;
    for (auto s : adj[x]) {
        if (p[s]==-1) dfs(s,val);
    }
}

int find(int x) {
    while (x!=p[x]) x=p[x];
    return x;
}

bool same(int x, int y) {
    return find(x)==find(y);
}

void unite(int x, int y) {
    x=find(x); y=find(y);
    if (lv[x]>lv[y]) p[y]=x;
    else if (lv[y]>lv[x]) p[x]=y;
    else {
        p[x]=y; ++lv[y];
    }
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    memset(p,-1,sizeof(p));
    for (int i=0; i<n; ++i) {
        ss.insert(s[i]);
        ss.insert(t[i]);
    }
    ss.insert(1000000010);

    int cnt=0,pre=0;
    for (auto it=ss.begin(); it!=ss.end(); ++it) {
        if (cnt) v.push_back(tu(*it-pre,cnt,cnt-1)), dis[cnt]=*it-pre;
        c[*it]=cnt++;
        pre=*it;
    }
    --cnt;

    for (int i=0; i<n; ++i) {
        int st=c[s[i]], to=c[t[i]];
        cross[st+1]++;
        cross[to+1]--;
        adj[st].push_back(to);
    }
    adj[cnt].push_back(0);
    --cross[1];

    for (int i=1; i<=cnt; ++i) {
        cross[i]+=cross[i-1];
        if (cross[i]>0) {
            adj[i].push_back(i-1);
            ans+=dis[i]*cross[i];
        } else if (cross[i]<0) {
            adj[i-1].push_back(i);
        }
    }

    for (int i=0; i<=cnt; ++i) {
        if (p[i]==-1) dfs(i,i), lv[i]=1;
    }

    sort(v.begin(),v.end());
    for (auto s : v) {
        int a,b,w;
        tie(w,a,b)=s;

        if (!same(a,b)) {
            unite(a,b);
            ans+=w;
        }
    }

    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 80300 KB n = 199999
2 Correct 753 ms 75828 KB n = 199991
3 Correct 724 ms 79984 KB n = 199993
4 Correct 499 ms 59956 KB n = 152076
5 Correct 256 ms 41208 KB n = 93249
6 Correct 586 ms 63884 KB n = 199910
7 Correct 619 ms 74880 KB n = 199999
8 Correct 547 ms 65412 KB n = 199997
9 Correct 592 ms 66632 KB n = 171294
10 Correct 457 ms 56412 KB n = 140872
11 Correct 597 ms 64636 KB n = 199886
12 Correct 601 ms 76312 KB n = 199996
13 Correct 587 ms 68736 KB n = 200000
14 Correct 564 ms 78068 KB n = 199998
15 Correct 585 ms 76212 KB n = 200000
16 Correct 596 ms 77740 KB n = 199998
17 Correct 661 ms 76320 KB n = 200000
18 Correct 618 ms 73276 KB n = 190000
19 Correct 548 ms 72772 KB n = 177777
20 Correct 261 ms 43388 KB n = 100000
21 Correct 659 ms 75832 KB n = 200000
22 Correct 640 ms 73840 KB n = 200000
23 Correct 716 ms 80360 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11220 KB n = 2
2 Correct 6 ms 11284 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 6 ms 11220 KB n = 2
5 Correct 6 ms 11220 KB n = 2
6 Correct 5 ms 11220 KB n = 2
7 Correct 6 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 5 ms 11220 KB n = 3
10 Correct 5 ms 11220 KB n = 8
11 Correct 5 ms 11220 KB n = 8
12 Correct 6 ms 11220 KB n = 8
13 Correct 7 ms 11244 KB n = 8
14 Correct 6 ms 11220 KB n = 8
15 Correct 6 ms 11220 KB n = 8
16 Correct 6 ms 11220 KB n = 8
17 Correct 6 ms 11244 KB n = 8
18 Correct 5 ms 11220 KB n = 8
19 Correct 6 ms 11244 KB n = 3
20 Correct 6 ms 11220 KB n = 7
21 Correct 6 ms 11220 KB n = 8
22 Correct 5 ms 11240 KB n = 8
23 Correct 6 ms 11244 KB n = 8
24 Correct 6 ms 11220 KB n = 8
25 Correct 6 ms 11188 KB n = 8
26 Correct 6 ms 11220 KB n = 8
27 Correct 6 ms 11220 KB n = 8
28 Correct 5 ms 11256 KB n = 8
29 Correct 6 ms 11364 KB n = 16
30 Correct 7 ms 11220 KB n = 16
31 Correct 6 ms 11220 KB n = 16
32 Correct 6 ms 11220 KB n = 16
33 Correct 6 ms 11220 KB n = 16
34 Correct 6 ms 11244 KB n = 16
35 Correct 6 ms 11220 KB n = 16
36 Correct 6 ms 11220 KB n = 15
37 Correct 6 ms 11240 KB n = 8
38 Correct 6 ms 11220 KB n = 16
39 Correct 6 ms 11220 KB n = 16
40 Correct 7 ms 11220 KB n = 9
41 Correct 6 ms 11240 KB n = 16
42 Correct 6 ms 11240 KB n = 16
43 Correct 6 ms 11244 KB n = 16
44 Correct 6 ms 11220 KB n = 9
45 Correct 6 ms 11236 KB n = 15
46 Correct 6 ms 11244 KB n = 16
47 Correct 6 ms 11220 KB n = 16
48 Correct 6 ms 11220 KB n = 16
49 Correct 709 ms 80300 KB n = 199999
50 Correct 753 ms 75828 KB n = 199991
51 Correct 724 ms 79984 KB n = 199993
52 Correct 499 ms 59956 KB n = 152076
53 Correct 256 ms 41208 KB n = 93249
54 Correct 586 ms 63884 KB n = 199910
55 Correct 619 ms 74880 KB n = 199999
56 Correct 547 ms 65412 KB n = 199997
57 Correct 592 ms 66632 KB n = 171294
58 Correct 457 ms 56412 KB n = 140872
59 Correct 597 ms 64636 KB n = 199886
60 Correct 601 ms 76312 KB n = 199996
61 Correct 587 ms 68736 KB n = 200000
62 Correct 564 ms 78068 KB n = 199998
63 Correct 585 ms 76212 KB n = 200000
64 Correct 596 ms 77740 KB n = 199998
65 Correct 661 ms 76320 KB n = 200000
66 Correct 618 ms 73276 KB n = 190000
67 Correct 548 ms 72772 KB n = 177777
68 Correct 261 ms 43388 KB n = 100000
69 Correct 659 ms 75832 KB n = 200000
70 Correct 640 ms 73840 KB n = 200000
71 Correct 716 ms 80360 KB n = 200000
72 Correct 711 ms 84216 KB n = 200000
73 Correct 765 ms 79668 KB n = 200000
74 Incorrect 731 ms 83160 KB answer is not correct: 66605227847128 instead of 66673947323864
75 Halted 0 ms 0 KB -