oj.uz

Submission #363561

# Submission time Handle Problem Language Result Execution time Memory
363561 2021-02-06T15:24:29 Z CSQ31 Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 246 ms 18264 KB 
#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
const int MAXN = 4e5+5;
vector<int>par(MAXN),szz(MAXN,1);
int find(int x){
	if(x == par[x])return x;
	return par[x] = find(par[x]);
}
bool unite(int a,int b){
	a = find(a);
	b = find(b);
	if(a == b)return 0;
	if(szz[a] > szz[b])swap(a,b);
	szz[b]+=szz[a];
	par[a] = b;
	return 1;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
	s.pb(1e9);
	t.pb(0);
    int n = (int) s.size();
    /*
    if(n<=0){
		
		VII dp(17,vector<ll>(1<<17,INF));
		for(int i=0;i<n;i++)dp[i][(1<<i)] = max(0,1-s[i]);
		for(int mask=0;mask<(1<<n);mask++){
			for(int i=0;i<n;i++){
				if(!((1<<i)&mask))continue;
				for(int j=0;j<n;j++){
					if(i == j || !((1<<j)&mask))continue;
					dp[i][mask] = min(dp[i][mask],dp[j][mask-(1<<i)] + max(0,t[j]-s[i]));
					
				}
			}
		}
		ll ans = INF;
		for(int i=0;i<n;i++)ans = min(ans,dp[i][(1<<n)-1]);
		return ans;
	}*/
	vector<int>c;
	for(int i=0;i<n;i++){
		c.pb(s[i]);
		c.pb(t[i]);
	}
	sort(all(c));
	c.resize(unique(all(c))-c.begin());
	vector<ll>v(sz(c));
	ll ans = 0;
	for(int i=0;i<2*n;i++)par[i] = i;
	for(int i=0;i<n;i++){
		s[i] = lb(all(c),s[i])-c.begin();
		t[i] = lb(all(c),t[i])-c.begin();
		v[s[i]]++;
		v[t[i]]--;
		unite(s[i],t[i]);
	}
	vector<pii>edge;
	for(int i=1;i<sz(v);i++)v[i]+=v[i-1];
	for(int i=0;i<sz(v);i++){
		if(v[i]>0){
			if(i+1<sz(v)){
				ans+=v[i]*(c[i+1]-c[i]);
			}
		}
		if(i+1<sz(v)){
			if(v[i])unite(i,i+1);
			else edge.pb({c[i+1]-c[i],i});
		}
	}
	sort(all(edge));
	for(pii x:edge){
		if(unite(x.se,x.se+1))ans+=x.fi;
	}
	return ans;
}
/*
int main()
{
	int n;
	cin>>n;
	vector<int>s(n),t(n);
	for(int i=0;i<n;i++)cin>>s[i]>>t[i];
	cout<<plan_roller_coaster(s,t);
}*/

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 16156 KB n = 199999
2 Correct 222 ms 16200 KB n = 199991
3 Correct 217 ms 16260 KB n = 199993
4 Correct 171 ms 13188 KB n = 152076
5 Correct 85 ms 9608 KB n = 93249
6 Correct 183 ms 14536 KB n = 199910
7 Correct 198 ms 15404 KB n = 199999
8 Correct 174 ms 14664 KB n = 199997
9 Correct 174 ms 14380 KB n = 171294
10 Correct 154 ms 11824 KB n = 140872
11 Correct 189 ms 14536 KB n = 199886
12 Correct 187 ms 15432 KB n = 199996
13 Correct 183 ms 14920 KB n = 200000
14 Correct 201 ms 17352 KB n = 199998
15 Correct 201 ms 17352 KB n = 200000
16 Correct 207 ms 17864 KB n = 199998
17 Correct 196 ms 16200 KB n = 200000
18 Correct 194 ms 15640 KB n = 190000
19 Correct 168 ms 14968 KB n = 177777
20 Correct 87 ms 9816 KB n = 100000
21 Correct 200 ms 16200 KB n = 200000
22 Correct 234 ms 18248 KB n = 200000
23 Correct 236 ms 18248 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3436 KB n = 2
2 Correct 3 ms 3436 KB n = 2
3 Correct 3 ms 3436 KB n = 2
4 Correct 3 ms 3436 KB n = 2
5 Correct 5 ms 3436 KB n = 2
6 Correct 3 ms 3436 KB n = 2
7 Correct 3 ms 3436 KB n = 3
8 Correct 3 ms 3436 KB n = 3
9 Correct 3 ms 3584 KB n = 3
10 Correct 4 ms 3436 KB n = 8
11 Correct 3 ms 3436 KB n = 8
12 Correct 3 ms 3436 KB n = 8
13 Correct 3 ms 3436 KB n = 8
14 Correct 3 ms 3436 KB n = 8
15 Correct 3 ms 3436 KB n = 8
16 Correct 3 ms 3436 KB n = 8
17 Correct 3 ms 3436 KB n = 8
18 Correct 3 ms 3436 KB n = 8
19 Correct 3 ms 3436 KB n = 3
20 Correct 3 ms 3436 KB n = 7
21 Correct 3 ms 3436 KB n = 8
22 Correct 3 ms 3436 KB n = 8
23 Correct 3 ms 3440 KB n = 8
24 Correct 3 ms 3436 KB n = 8
25 Correct 4 ms 3436 KB n = 8
26 Correct 3 ms 3436 KB n = 8
27 Correct 3 ms 3436 KB n = 8
28 Correct 3 ms 3436 KB n = 8
29 Correct 3 ms 3504 KB n = 16
30 Correct 3 ms 3436 KB n = 16
31 Correct 3 ms 3436 KB n = 16
32 Correct 3 ms 3436 KB n = 16
33 Correct 3 ms 3436 KB n = 16
34 Correct 3 ms 3436 KB n = 16
35 Correct 3 ms 3436 KB n = 16
36 Correct 3 ms 3436 KB n = 15
37 Correct 3 ms 3436 KB n = 8
38 Correct 3 ms 3564 KB n = 16
39 Correct 4 ms 3436 KB n = 16
40 Correct 4 ms 3436 KB n = 9
41 Correct 3 ms 3436 KB n = 16
42 Correct 3 ms 3456 KB n = 16
43 Correct 3 ms 3436 KB n = 16
44 Correct 3 ms 3436 KB n = 9
45 Correct 3 ms 3436 KB n = 15
46 Correct 3 ms 3436 KB n = 16
47 Correct 3 ms 3436 KB n = 16
48 Correct 3 ms 3436 KB n = 16
49 Correct 208 ms 16156 KB n = 199999
50 Correct 222 ms 16200 KB n = 199991
51 Correct 217 ms 16260 KB n = 199993
52 Correct 171 ms 13188 KB n = 152076
53 Correct 85 ms 9608 KB n = 93249
54 Correct 183 ms 14536 KB n = 199910
55 Correct 198 ms 15404 KB n = 199999
56 Correct 174 ms 14664 KB n = 199997
57 Correct 174 ms 14380 KB n = 171294
58 Correct 154 ms 11824 KB n = 140872
59 Correct 189 ms 14536 KB n = 199886
60 Correct 187 ms 15432 KB n = 199996
61 Correct 183 ms 14920 KB n = 200000
62 Correct 201 ms 17352 KB n = 199998
63 Correct 201 ms 17352 KB n = 200000
64 Correct 207 ms 17864 KB n = 199998
65 Correct 196 ms 16200 KB n = 200000
66 Correct 194 ms 15640 KB n = 190000
67 Correct 168 ms 14968 KB n = 177777
68 Correct 87 ms 9816 KB n = 100000
69 Correct 200 ms 16200 KB n = 200000
70 Correct 234 ms 18248 KB n = 200000
71 Correct 236 ms 18248 KB n = 200000
72 Correct 219 ms 16200 KB n = 200000
73 Correct 204 ms 16200 KB n = 200000
74 Correct 203 ms 16200 KB n = 200000
75 Correct 197 ms 16328 KB n = 200000
76 Correct 196 ms 16216 KB n = 200000
77 Correct 159 ms 14664 KB n = 200000
78 Correct 190 ms 16712 KB n = 200000
79 Correct 183 ms 15048 KB n = 184307
80 Correct 67 ms 8084 KB n = 76040
81 Correct 194 ms 14536 KB n = 199981
82 Correct 190 ms 15856 KB n = 199994
83 Correct 181 ms 14764 KB n = 199996
84 Correct 197 ms 17352 KB n = 199998
85 Correct 218 ms 17352 KB n = 200000
86 Correct 206 ms 17736 KB n = 199998
87 Correct 192 ms 16200 KB n = 200000
88 Correct 216 ms 16328 KB n = 200000
89 Correct 190 ms 16196 KB n = 200000
90 Correct 190 ms 16196 KB n = 200000
91 Correct 226 ms 18264 KB n = 200000
92 Correct 246 ms 18248 KB n = 200000