oj.uz

Submission #635933

# Submission time Handle Problem Language Result Execution time Memory
635933 2022-08-27T12:02:36 Z PoonYaPat Roller Coaster Railroad (IOI16_railroad) C++14
30 / 100
 824 ms 84344 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]];
        if (s[i]<t[i]) {
            cross[st+1]++;
            cross[to+1]--;
        } else if (s[i]>t[i]) {
            cross[to+1]--;
            cross[st+1]++;
        }
        adj[st].push_back(to);
    }
    --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];
        } 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
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11220 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 6 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 6 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 6 ms 11220 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 6 ms 11220 KB n = 8
12 Incorrect 6 ms 11348 KB answer is not correct: 867508423 instead of 2726473632
13 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11220 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 6 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 6 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 6 ms 11220 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 6 ms 11220 KB n = 8
12 Incorrect 6 ms 11348 KB answer is not correct: 867508423 instead of 2726473632
13 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 824 ms 80260 KB n = 199999
2 Correct 739 ms 75884 KB n = 199991
3 Correct 817 ms 80040 KB n = 199993
4 Correct 516 ms 60084 KB n = 152076
5 Correct 298 ms 41224 KB n = 93249
6 Correct 588 ms 63792 KB n = 199910
7 Correct 650 ms 74788 KB n = 199999
8 Correct 545 ms 65300 KB n = 199997
9 Correct 670 ms 66416 KB n = 171294
10 Correct 500 ms 56492 KB n = 140872
11 Correct 579 ms 64812 KB n = 199886
12 Correct 637 ms 76240 KB n = 199996
13 Correct 614 ms 68744 KB n = 200000
14 Correct 558 ms 78148 KB n = 199998
15 Correct 573 ms 79044 KB n = 200000
16 Correct 613 ms 81092 KB n = 199998
17 Correct 671 ms 80164 KB n = 200000
18 Correct 642 ms 77060 KB n = 190000
19 Correct 551 ms 76076 KB n = 177777
20 Correct 256 ms 45372 KB n = 100000
21 Correct 703 ms 79504 KB n = 200000
22 Correct 651 ms 77732 KB n = 200000
23 Correct 745 ms 84344 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11220 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 6 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 6 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 6 ms 11220 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 6 ms 11220 KB n = 8
12 Incorrect 6 ms 11348 KB answer is not correct: 867508423 instead of 2726473632
13 Halted 0 ms 0 KB -