oj.uz

Submission #945237

# Submission time Handle Problem Language Result Execution time Memory
945237 2024-03-13T14:48:49 Z Lalic Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 530 ms 71868 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5+10;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9+7;

void dfs(int ver, int val, vector<vector<int>>& adj, vector<int>& cmp){
	cmp[ver]=val;
	
	for(auto u : adj[ver])
		if(!cmp[u]) dfs(u, val, adj, cmp);
}

int pai[MAXN], peso[MAXN];

int find(int x){ return (pai[x]==x ? x : pai[x]=find(pai[x])); }
void join(int a, int b){
	a=find(a); b=find(b);
	
	if(a==b) return;
	
	if(peso[a]>peso[b]) swap(a, b);
	pai[a]=b;
	peso[b]=max(peso[b], peso[a]+1);
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    vector<int> arr;
    for(auto u : s) arr.pb(u);
    for(auto u : t) arr.pb(u);
    sort(all(arr));
    arr.erase(unique(all(arr)), arr.end());
    
    int n=(int)arr.size();
    
    map<int, int> mp;
    vector<int> g(n, 0);
    for(int i=0;i<n;i++) mp[arr[i]]=i;
    
    vector<vector<int>> adj(n);
    adj[n-1].pb(0);
    g[n-1]++; g[0]--;
    
    for(int i=0;i<(int)s.size();i++){
		g[mp[s[i]]]++; g[mp[t[i]]]--;
		adj[mp[s[i]]].pb(mp[t[i]]);
	}
	
	ll ans=0ll;
	
	for(int i=0;i<n-1;i++){
		if(g[i]>0) adj[i+1].pb(i), ans+=(ll)g[i]*(ll)(arr[i+1]-arr[i]), g[i+1]+=g[i], g[i]=0;
		else if(g[i]<0) adj[i].pb(i+1), g[i+1]+=g[i], g[i]=0;
	}
	
	int cnt=0;
	vector<int> cmp(n, 0);
	for(int i=0;i<n;i++)
		if(!cmp[i]) dfs(i, ++cnt, adj, cmp);
		
	for(int i=1;i<=cnt;i++) pai[i]=i;
	
	vector<pair<int, pii>> edge;
	for(int i=0;i<n-1;i++)
		if(cmp[i]!=cmp[i+1]) edge.pb({arr[i+1]-arr[i], {cmp[i], cmp[i+1]}});
	
	sort(all(edge));
	
	for(auto u : edge){
		if(find(u.se.fi)!=find(u.se.se)){
			join(u.se.fi, u.se.se);
			ans+=u.fi;
		}
	}
	
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 0 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 1 ms 344 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 344 KB n = 8
15 Correct 0 ms 348 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 444 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 1 ms 440 KB n = 7
21 Correct 0 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 344 KB n = 8
24 Correct 0 ms 344 KB n = 8
25 Correct 1 ms 348 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 71592 KB n = 199999
2 Correct 468 ms 60868 KB n = 199991
3 Correct 461 ms 70964 KB n = 199993
4 Correct 331 ms 45440 KB n = 152076
5 Correct 172 ms 28868 KB n = 93249
6 Correct 370 ms 48580 KB n = 199910
7 Correct 403 ms 60472 KB n = 199999
8 Correct 372 ms 51396 KB n = 199997
9 Correct 403 ms 51920 KB n = 171294
10 Correct 284 ms 42500 KB n = 140872
11 Correct 389 ms 49036 KB n = 199886
12 Correct 395 ms 60100 KB n = 199996
13 Correct 406 ms 53716 KB n = 200000
14 Correct 407 ms 65508 KB n = 199998
15 Correct 391 ms 61888 KB n = 200000
16 Correct 402 ms 63344 KB n = 199998
17 Correct 415 ms 62140 KB n = 200000
18 Correct 461 ms 59620 KB n = 190000
19 Correct 389 ms 63672 KB n = 177777
20 Correct 187 ms 30492 KB n = 100000
21 Correct 486 ms 60744 KB n = 200000
22 Correct 454 ms 58036 KB n = 200000
23 Correct 467 ms 71612 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 0 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 348 KB n = 3
9 Correct 1 ms 344 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 1 ms 348 KB n = 8
14 Correct 1 ms 344 KB n = 8
15 Correct 0 ms 348 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 444 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 1 ms 440 KB n = 7
21 Correct 0 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 344 KB n = 8
24 Correct 0 ms 344 KB n = 8
25 Correct 1 ms 348 KB n = 8
26 Correct 0 ms 440 KB n = 8
27 Correct 0 ms 344 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 0 ms 348 KB n = 16
30 Correct 0 ms 344 KB n = 16
31 Correct 1 ms 348 KB n = 16
32 Correct 0 ms 348 KB n = 16
33 Correct 0 ms 348 KB n = 16
34 Correct 0 ms 348 KB n = 16
35 Correct 1 ms 348 KB n = 16
36 Correct 0 ms 348 KB n = 15
37 Correct 0 ms 348 KB n = 8
38 Correct 1 ms 348 KB n = 16
39 Correct 0 ms 344 KB n = 16
40 Correct 0 ms 348 KB n = 9
41 Correct 1 ms 348 KB n = 16
42 Correct 0 ms 444 KB n = 16
43 Correct 1 ms 348 KB n = 16
44 Correct 0 ms 348 KB n = 9
45 Correct 1 ms 344 KB n = 15
46 Correct 0 ms 348 KB n = 16
47 Correct 0 ms 348 KB n = 16
48 Correct 0 ms 348 KB n = 16
49 Correct 434 ms 71592 KB n = 199999
50 Correct 468 ms 60868 KB n = 199991
51 Correct 461 ms 70964 KB n = 199993
52 Correct 331 ms 45440 KB n = 152076
53 Correct 172 ms 28868 KB n = 93249
54 Correct 370 ms 48580 KB n = 199910
55 Correct 403 ms 60472 KB n = 199999
56 Correct 372 ms 51396 KB n = 199997
57 Correct 403 ms 51920 KB n = 171294
58 Correct 284 ms 42500 KB n = 140872
59 Correct 389 ms 49036 KB n = 199886
60 Correct 395 ms 60100 KB n = 199996
61 Correct 406 ms 53716 KB n = 200000
62 Correct 407 ms 65508 KB n = 199998
63 Correct 391 ms 61888 KB n = 200000
64 Correct 402 ms 63344 KB n = 199998
65 Correct 415 ms 62140 KB n = 200000
66 Correct 461 ms 59620 KB n = 190000
67 Correct 389 ms 63672 KB n = 177777
68 Correct 187 ms 30492 KB n = 100000
69 Correct 486 ms 60744 KB n = 200000
70 Correct 454 ms 58036 KB n = 200000
71 Correct 467 ms 71612 KB n = 200000
72 Correct 425 ms 71616 KB n = 200000
73 Correct 452 ms 60856 KB n = 200000
74 Correct 444 ms 69056 KB n = 200000
75 Correct 454 ms 71700 KB n = 200000
76 Correct 430 ms 71868 KB n = 200000
77 Correct 263 ms 40248 KB n = 200000
78 Correct 266 ms 36284 KB n = 200000
79 Correct 435 ms 53860 KB n = 184307
80 Correct 134 ms 23264 KB n = 76040
81 Correct 373 ms 49264 KB n = 199981
82 Correct 390 ms 60176 KB n = 199994
83 Correct 368 ms 53956 KB n = 199996
84 Correct 382 ms 65476 KB n = 199998
85 Correct 387 ms 61956 KB n = 200000
86 Correct 399 ms 63176 KB n = 199998
87 Correct 429 ms 62404 KB n = 200000
88 Correct 431 ms 62656 KB n = 200000
89 Correct 516 ms 71632 KB n = 200000
90 Correct 474 ms 60732 KB n = 200000
91 Correct 439 ms 58780 KB n = 200000
92 Correct 530 ms 71644 KB n = 200000