oj.uz

Submission #635914

# Submission time Handle Problem Language Result Execution time Memory
635914 2022-08-27T11:21:17 Z PoonYaPat Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 2000 ms 94884 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],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);
    p[x]=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]);
    }
    int cnt=0;
    for (auto it=ss.begin(); it!=ss.end(); ++it) c[*it]=cnt++;
    c[1000000010]=cnt;

    for (int i=0; i<n; ++i) {
        if (s[i]<t[i]) {
            cross[c[s[i]]+1]++;
            cross[c[t[i]]+1]--;
        } else {
            cross[c[s[i]]+1]--;
            cross[c[t[i]]+1]++;
        }
        adj[c[s[i]]].push_back(c[t[i]]);
    }
    --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+=(cross[i]*(c[i]-c[i-1]));
        } 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);
    }

    for (int i=1; i<=cnt; ++i) {
        v.push_back(tu(c[i]-c[i-1],i,i-1));
    }
    sort(v.begin(),v.end());

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

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

    return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 11348 KB answer is not correct: 3 instead of 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 11348 KB answer is not correct: 3 instead of 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2077 ms 94884 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 11348 KB answer is not correct: 3 instead of 0
2 Halted 0 ms 0 KB -