#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;
int par[200002];
int find(int p)
{
if(par[p]==p)return p;
else return par[p]=find(par[p]);
}
void uni(int p,int q)
{
p=find(p);
q=find(q);
if(p!=q)par[p]=q;
}
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 mini,maxi;
priority_queue<pii>P;
for(int i=1;i<=col;i++)par[i]=i;
for(int i=0;i<=n;)
{
int k=i;
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+1;l<=k;l++)uni(v[l],v[l-1]);
i=k+1;
}
for(int i=0;i<=n;i++)
{
if(line[i]!=i && find(v[i-1])!=find(v[i]))uni(v[i-1],v[i]);
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(find(v[p.second])!=find(v[p.second-1]))
{
uni(v[p.second-1],v[p.second]);
ans+=(-p.first);
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
340 KB |
n = 2 |
6 |
Correct |
1 ms |
340 KB |
n = 2 |
7 |
Correct |
0 ms |
340 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
1 ms |
340 KB |
n = 3 |
10 |
Correct |
1 ms |
340 KB |
n = 8 |
11 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 256651303 instead of 189002015 |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
340 KB |
n = 2 |
6 |
Correct |
1 ms |
340 KB |
n = 2 |
7 |
Correct |
0 ms |
340 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
1 ms |
340 KB |
n = 3 |
10 |
Correct |
1 ms |
340 KB |
n = 8 |
11 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 256651303 instead of 189002015 |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
92 ms |
10688 KB |
n = 199999 |
2 |
Correct |
123 ms |
13644 KB |
n = 199991 |
3 |
Correct |
122 ms |
13628 KB |
n = 199993 |
4 |
Correct |
68 ms |
8360 KB |
n = 152076 |
5 |
Correct |
42 ms |
5292 KB |
n = 93249 |
6 |
Correct |
85 ms |
10616 KB |
n = 199910 |
7 |
Correct |
85 ms |
10752 KB |
n = 199999 |
8 |
Correct |
87 ms |
10940 KB |
n = 199997 |
9 |
Correct |
82 ms |
9240 KB |
n = 171294 |
10 |
Correct |
63 ms |
7708 KB |
n = 140872 |
11 |
Correct |
83 ms |
10796 KB |
n = 199886 |
12 |
Correct |
93 ms |
11012 KB |
n = 199996 |
13 |
Correct |
91 ms |
11096 KB |
n = 200000 |
14 |
Correct |
110 ms |
13760 KB |
n = 199998 |
15 |
Correct |
113 ms |
13752 KB |
n = 200000 |
16 |
Correct |
119 ms |
13828 KB |
n = 199998 |
17 |
Correct |
115 ms |
13540 KB |
n = 200000 |
18 |
Correct |
97 ms |
11692 KB |
n = 190000 |
19 |
Correct |
75 ms |
9556 KB |
n = 177777 |
20 |
Correct |
43 ms |
5540 KB |
n = 100000 |
21 |
Correct |
88 ms |
10604 KB |
n = 200000 |
22 |
Correct |
132 ms |
14080 KB |
n = 200000 |
23 |
Correct |
120 ms |
13568 KB |
n = 200000 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
n = 2 |
2 |
Correct |
0 ms |
212 KB |
n = 2 |
3 |
Correct |
0 ms |
212 KB |
n = 2 |
4 |
Correct |
0 ms |
212 KB |
n = 2 |
5 |
Correct |
1 ms |
340 KB |
n = 2 |
6 |
Correct |
1 ms |
340 KB |
n = 2 |
7 |
Correct |
0 ms |
340 KB |
n = 3 |
8 |
Correct |
1 ms |
212 KB |
n = 3 |
9 |
Correct |
1 ms |
340 KB |
n = 3 |
10 |
Correct |
1 ms |
340 KB |
n = 8 |
11 |
Incorrect |
0 ms |
212 KB |
answer is not correct: 256651303 instead of 189002015 |
12 |
Halted |
0 ms |
0 KB |
- |