oj.uz

Submission #354368

# Submission time Handle Problem Language Result Execution time Memory
354368 2021-01-21T19:50:06 Z Kerim Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 227 ms 16604 KB 
#include "railroad.h"
#include "bits/stdc++.h"
#define MAXN 400009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;
 
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int par[MAXN],ata[MAXN];
int tap(int x){
	if(ata[x]==x)return x;
	return ata[x]=tap(ata[x]);	
}
bool merge(int x,int y){
	if((x=tap(x))==(y=tap(y)))return 0;
	ata[y]=x;return 1;	
}
long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n = (int) s.size();
    vector<int>v;v.pb(1);
    for(int i=0;i<n;i++)
    	v.pb(s[i]),v.pb(t[i]);
    sort(all(v));v.erase(unique(all(v)),v.end());
    for(int i=1;i<=int(v.size());i++)ata[i]=i;
    for(int i=0;i<n;i++){
    	s[i]=lower_bound(all(v),s[i])-v.begin();	
    	t[i]=lower_bound(all(v),t[i])-v.begin();
    	s[i]++;t[i]++;
    	if(s[i]<t[i])
    		par[s[i]]++,par[t[i]]--;
    	if(s[i]>t[i])
    		par[t[i]]--,par[s[i]]++;
    	merge(s[i],t[i]);
    }n=int(v.size());
    merge(1,n);
    par[1]--;int sum=0;
    ll ans=0;
    vector<pair<int,PII> >edge;
    for(int i=1;i<n;i++){
    	sum+=par[i];
    	if(sum==0){
    		edge.pb(mp(v[i]-v[i-1],mp(i,i+1)));
  			continue;
    	}
    	merge(i,i+1);
    	if(sum>0)
    		ans+=sum*1LL*(v[i]-v[i-1]);
    }
    sort(all(edge));
    tr(it,edge)
    	if(merge(it->ss.ff,it->ss.ss))
    		ans+=it->ff;
	return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:10:18: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   10 | #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
      |                  ^~~
railroad.cpp:62:5: note: in expansion of macro 'tr'
   62 |     tr(it,edge)
      |     ^~
railroad.cpp:65:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   65 |  return ans;
      |  ^~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 8288 KB n = 199999
2 Correct 202 ms 8284 KB n = 199991
3 Correct 181 ms 8284 KB n = 199993
4 Correct 131 ms 6364 KB n = 152076
5 Correct 82 ms 4192 KB n = 93249
6 Correct 167 ms 7772 KB n = 199910
7 Correct 166 ms 8156 KB n = 199999
8 Correct 162 ms 7820 KB n = 199997
9 Correct 154 ms 7132 KB n = 171294
10 Correct 120 ms 5944 KB n = 140872
11 Correct 163 ms 7772 KB n = 199886
12 Correct 171 ms 8972 KB n = 199996
13 Correct 164 ms 8540 KB n = 200000
14 Correct 193 ms 12884 KB n = 199998
15 Correct 196 ms 12764 KB n = 200000
16 Correct 202 ms 12768 KB n = 199998
17 Correct 182 ms 8412 KB n = 200000
18 Correct 172 ms 7900 KB n = 190000
19 Correct 152 ms 7388 KB n = 177777
20 Correct 83 ms 4320 KB n = 100000
21 Correct 180 ms 8412 KB n = 200000
22 Correct 224 ms 12780 KB n = 200000
23 Correct 218 ms 12764 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 0 ms 364 KB n = 2
3 Correct 0 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 0 ms 364 KB n = 8
13 Correct 0 ms 364 KB n = 8
14 Correct 0 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 0 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 0 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 0 ms 364 KB n = 8
24 Correct 0 ms 364 KB n = 8
25 Correct 0 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 0 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 0 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 0 ms 364 KB n = 15
37 Correct 0 ms 364 KB n = 8
38 Correct 0 ms 364 KB n = 16
39 Correct 0 ms 364 KB n = 16
40 Correct 0 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 0 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 0 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 0 ms 364 KB n = 16
47 Correct 0 ms 364 KB n = 16
48 Correct 0 ms 364 KB n = 16
49 Correct 179 ms 8288 KB n = 199999
50 Correct 202 ms 8284 KB n = 199991
51 Correct 181 ms 8284 KB n = 199993
52 Correct 131 ms 6364 KB n = 152076
53 Correct 82 ms 4192 KB n = 93249
54 Correct 167 ms 7772 KB n = 199910
55 Correct 166 ms 8156 KB n = 199999
56 Correct 162 ms 7820 KB n = 199997
57 Correct 154 ms 7132 KB n = 171294
58 Correct 120 ms 5944 KB n = 140872
59 Correct 163 ms 7772 KB n = 199886
60 Correct 171 ms 8972 KB n = 199996
61 Correct 164 ms 8540 KB n = 200000
62 Correct 193 ms 12884 KB n = 199998
63 Correct 196 ms 12764 KB n = 200000
64 Correct 202 ms 12768 KB n = 199998
65 Correct 182 ms 8412 KB n = 200000
66 Correct 172 ms 7900 KB n = 190000
67 Correct 152 ms 7388 KB n = 177777
68 Correct 83 ms 4320 KB n = 100000
69 Correct 180 ms 8412 KB n = 200000
70 Correct 224 ms 12780 KB n = 200000
71 Correct 218 ms 12764 KB n = 200000
72 Correct 178 ms 8284 KB n = 200000
73 Correct 187 ms 8332 KB n = 200000
74 Correct 180 ms 12124 KB n = 200000
75 Correct 181 ms 12124 KB n = 200000
76 Correct 182 ms 12252 KB n = 200000
77 Correct 151 ms 9820 KB n = 200000
78 Correct 181 ms 14428 KB n = 200000
79 Correct 171 ms 11100 KB n = 184307
80 Correct 74 ms 4960 KB n = 76040
81 Correct 163 ms 10588 KB n = 199981
82 Correct 172 ms 12252 KB n = 199994
83 Correct 170 ms 11500 KB n = 199996
84 Correct 190 ms 15964 KB n = 199998
85 Correct 193 ms 15708 KB n = 200000
86 Correct 199 ms 16220 KB n = 199998
87 Correct 179 ms 12124 KB n = 200000
88 Correct 181 ms 12124 KB n = 200000
89 Correct 177 ms 12124 KB n = 200000
90 Correct 180 ms 12124 KB n = 200000
91 Correct 227 ms 16604 KB n = 200000
92 Correct 216 ms 16604 KB n = 200000