oj.uz

Submission #637018

# Submission time Handle Problem Language Result Execution time Memory
637018 2022-08-31T06:25:00 Z ggoh Roller Coaster Railroad (IOI16_railroad) C++14
30 / 100
 118 ms 14872 KB 
#include<bits/stdc++.h>
#include "railroad.h"
using namespace std;
#define sz(v) ((int)(v).size())
typedef long long lint;
typedef pair<int,int> pii;

lint D[1<<16][16];
int v[200002];
int line[200002],sT[200002],num[200002],ori[200002],col;
void dfs(int p)
{
    v[p]=col;
    if(!v[sT[p]])dfs(sT[p]);
}
lint plan_roller_coaster(vector<int> s, vector<int> t) {

    int n = (int) s.size();
    lint ans=0;
    vector<pii>S;
    vector<pii>T;
    for(int i=0;i<n;i++)S.push_back({s[i],i});
    for(int i=0;i<n;i++)T.push_back({t[i],i});
    S.push_back({1e9+1,n});T.push_back({0,n});
    sort(S.begin(),S.end());
    sort(T.begin(),T.end());
    for(int i=0;i<=n;i++)num[T[i].second]=i;
    for(int i=0;i<=n;i++)
    {
        ori[i]=T[i].first;
        if(T[i].first>S[i].first)
        {
            ans+=T[i].first-S[i].first;
            T[i].first=S[i].first;
        }
    }
    int j=0;
    for(int i=0;i<=n;i++)
    {
        while(j<=n && T[i].first>S[j].first)j++;
        line[i]=j;
        sT[i]=num[S[i].second];
    }
    col=0;
    for(int i=0;i<=n;i++)
    {
        if(!v[i])
        {
            col++;
            dfs(i);
        }
    }
    int real[200002],mini,maxi;
    priority_queue<pii>P;
    for(int i=1;i<=col;i++)real[i]=i;
    for(int i=0;i<=n;)
    {
        int k=i;
        int minreal=col+1;
        mini=ori[i];
        maxi=T[i].first;
        while(k+1<=n)
        {
            mini=min(mini,ori[k+1]);
            maxi=max(maxi,T[k+1].first);
            if(mini>=maxi)k++;
            else break;
        }
        for(int l=i;l<=k;l++)
        {
            minreal=min(minreal,real[v[l]]);
        }
        for(int l=i;l<=k;l++)real[v[l]]=minreal;
        i=k+1;
    }
    for(int i=0;i<=n;i++)
    {
        if(line[i]!=i && real[v[i-1]]!=real[v[i]])
        {
            real[v[i]]=real[v[i-1]]=min(real[v[i]],real[v[i-1]]);
        }
        if(line[i]==i && i>0)
        {
            P.push({-(T[i].first-S[i-1].first),i});
        }
    }
    while(!P.empty())
    {
        pii p=P.top();
        P.pop();
        if(real[v[p.second]]!=real[v[p.second-1]])
        {
            real[v[p.second]]=real[v[p.second-1]]=min(real[v[p.second]],real[v[p.second-1]]);
            ans+=(-p.first);
        }
    }
    return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB n = 2
2 Correct 1 ms 1108 KB n = 2
3 Correct 1 ms 1108 KB n = 2
4 Correct 1 ms 1108 KB n = 2
5 Correct 1 ms 1080 KB n = 2
6 Correct 1 ms 1108 KB n = 2
7 Correct 1 ms 1108 KB n = 3
8 Correct 1 ms 1108 KB n = 3
9 Correct 1 ms 1108 KB n = 3
10 Correct 1 ms 1108 KB n = 8
11 Incorrect 1 ms 1080 KB answer is not correct: 256651303 instead of 189002015
12 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB n = 2
2 Correct 1 ms 1108 KB n = 2
3 Correct 1 ms 1108 KB n = 2
4 Correct 1 ms 1108 KB n = 2
5 Correct 1 ms 1080 KB n = 2
6 Correct 1 ms 1108 KB n = 2
7 Correct 1 ms 1108 KB n = 3
8 Correct 1 ms 1108 KB n = 3
9 Correct 1 ms 1108 KB n = 3
10 Correct 1 ms 1108 KB n = 8
11 Incorrect 1 ms 1080 KB answer is not correct: 256651303 instead of 189002015
12 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 11852 KB n = 199999
2 Correct 116 ms 14792 KB n = 199991
3 Correct 113 ms 14804 KB n = 199993
4 Correct 62 ms 9384 KB n = 152076
5 Correct 41 ms 6424 KB n = 93249
6 Correct 81 ms 11804 KB n = 199910
7 Correct 89 ms 11972 KB n = 199999
8 Correct 84 ms 11872 KB n = 199997
9 Correct 79 ms 10468 KB n = 171294
10 Correct 61 ms 8892 KB n = 140872
11 Correct 81 ms 11792 KB n = 199886
12 Correct 89 ms 12104 KB n = 199996
13 Correct 86 ms 12220 KB n = 200000
14 Correct 103 ms 14872 KB n = 199998
15 Correct 107 ms 14796 KB n = 200000
16 Correct 113 ms 14780 KB n = 199998
17 Correct 118 ms 14760 KB n = 200000
18 Correct 89 ms 12988 KB n = 190000
19 Correct 73 ms 10772 KB n = 177777
20 Correct 41 ms 6760 KB n = 100000
21 Correct 83 ms 11808 KB n = 200000
22 Correct 118 ms 14848 KB n = 200000
23 Correct 115 ms 14780 KB n = 200000

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB n = 2
2 Correct 1 ms 1108 KB n = 2
3 Correct 1 ms 1108 KB n = 2
4 Correct 1 ms 1108 KB n = 2
5 Correct 1 ms 1080 KB n = 2
6 Correct 1 ms 1108 KB n = 2
7 Correct 1 ms 1108 KB n = 3
8 Correct 1 ms 1108 KB n = 3
9 Correct 1 ms 1108 KB n = 3
10 Correct 1 ms 1108 KB n = 8
11 Incorrect 1 ms 1080 KB answer is not correct: 256651303 instead of 189002015
12 Halted 0 ms 0 KB -