oj.uz

Submission #429136

# Submission time Handle Problem Language Result Execution time Memory
429136 2021-06-15T17:46:15 Z Antekb Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 1149 ms 62136 KB 
#include "railroad.h"
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int N=4e5+5;
vector<int> E[N];
int r[N];
int find(int v){
	if(r[v]==v)return v;
	return r[v]=find(r[v]);
}
void Union(int u, int v){
	r[u]=v;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
	iota(r, r+N, 0);
    int n = (int) s.size();
    n++;
    s.push_back(2e9);
    t.push_back(1);
    vector<pair<int, int> > V;
    map<int, int> M;
    int wsk=0;
    for(int i=0; i<n; i++){
    	if(M.find(t[i])==M.end())M[t[i]]=wsk++;
    	if(M.find(s[i])==M.end())M[s[i]]=wsk++;
    	V.push_back({s[i], -1});
    	V.push_back({t[i], 1});
    	//cout<<M[s[i]]<<" "<<M[t[i]]<<" "<<s[i]<<" "<<t[i]<<"\n";
    	E[M[s[i]]].push_back(M[t[i]]);
    	E[M[t[i]]].push_back(M[s[i]]);
    }
    //cout<<"\n";
    //for(auto i:M)cout<<i.st<<" "<<i.nd<<"\n";
    //cout<<"\n";
    sort(V.begin(), V.end());
    long long ans=0;
    int ile=0;
    vector<pair<int, pair<int, int>>> edg;
    for(int i=0; i<V.size(); i++){
    	ile+=V[i].nd;
		if(ile<0 && V[i+1].st!=V[i].st){
			E[M[V[i].st]].push_back(M[V[i+1].st]);
			E[M[V[i+1].st]].push_back(M[V[i].st]);
			ans+=-ile*(long long)(V[i+1].st-V[i].st);
		}
		if(ile>0 && V[i+1].st!=V[i].st){
			E[M[V[i].st]].push_back(M[V[i+1].st]);
			E[M[V[i+1].st]].push_back(M[V[i].st]);
		}
		if(i+1<V.size() && V[i].st!=V[i+1].st){
			edg.push_back({V[i+1].st-V[i].st, {M[V[i].st], M[V[i+1].st]}});
		}
    }
    /*int cnt=1;
    for(int i=0; i<n; i++){
    	if(!vis[M[s[i]]])dfs(M[s[i]], wsk++);
    	if(!vis[M[t[i]]])dfs(M[t[i]], wsk++);
    }*/
    for(int i=0; i<wsk; i++){
    	for(int j:E[i]){
    		//cout<<i<<" "<<j<<"\n";
    		Union(find(i), find(j));
    	}
    }
    sort(edg.begin(), edg.end());
    for(int i=0; i<edg.size(); i++){
    	
    	int u=find(edg[i].nd.st), v=find(edg[i].nd.nd);
    	if(u!=v){
    		ans+=edg[i].st;
    		Union(u, v);
    	}
    }
    return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:42:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i=0; i<V.size(); i++){
      |                  ~^~~~~~~~~
railroad.cpp:53:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   if(i+1<V.size() && V[i].st!=V[i+1].st){
      |      ~~~^~~~~~~~~
railroad.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for(int i=0; i<edg.size(); i++){
      |                  ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11212 KB n = 2
2 Correct 8 ms 11212 KB n = 2
3 Correct 9 ms 11212 KB n = 2
4 Correct 8 ms 11212 KB n = 2
5 Correct 8 ms 11200 KB n = 2
6 Correct 7 ms 11240 KB n = 2
7 Correct 7 ms 11240 KB n = 3
8 Correct 8 ms 11212 KB n = 3
9 Correct 8 ms 11152 KB n = 3
10 Correct 7 ms 11212 KB n = 8
11 Correct 8 ms 11232 KB n = 8
12 Correct 8 ms 11212 KB n = 8
13 Correct 8 ms 11236 KB n = 8
14 Correct 9 ms 11232 KB n = 8
15 Correct 8 ms 11212 KB n = 8
16 Correct 7 ms 11212 KB n = 8
17 Correct 7 ms 11236 KB n = 8
18 Correct 7 ms 11212 KB n = 8
19 Correct 7 ms 11212 KB n = 3
20 Correct 8 ms 11268 KB n = 7
21 Correct 8 ms 11240 KB n = 8
22 Correct 10 ms 11172 KB n = 8
23 Correct 8 ms 11212 KB n = 8
24 Correct 8 ms 11212 KB n = 8
25 Correct 8 ms 11212 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1122 ms 58536 KB n = 199999
2 Correct 1116 ms 61904 KB n = 199991
3 Correct 1138 ms 62004 KB n = 199993
4 Correct 811 ms 51612 KB n = 152076
5 Correct 480 ms 35164 KB n = 93249
6 Correct 947 ms 55200 KB n = 199910
7 Correct 946 ms 60656 KB n = 199999
8 Correct 930 ms 55280 KB n = 199997
9 Correct 983 ms 55824 KB n = 171294
10 Correct 731 ms 49676 KB n = 140872
11 Correct 999 ms 55548 KB n = 199886
12 Correct 983 ms 60804 KB n = 199996
13 Correct 897 ms 56528 KB n = 200000
14 Correct 912 ms 60472 KB n = 199998
15 Correct 950 ms 59960 KB n = 200000
16 Correct 986 ms 61400 KB n = 199998
17 Correct 943 ms 61932 KB n = 200000
18 Correct 973 ms 59912 KB n = 190000
19 Correct 823 ms 57392 KB n = 177777
20 Correct 505 ms 36592 KB n = 100000
21 Correct 1004 ms 61980 KB n = 200000
22 Correct 1029 ms 61928 KB n = 200000
23 Correct 1115 ms 61932 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11212 KB n = 2
2 Correct 8 ms 11212 KB n = 2
3 Correct 9 ms 11212 KB n = 2
4 Correct 8 ms 11212 KB n = 2
5 Correct 8 ms 11200 KB n = 2
6 Correct 7 ms 11240 KB n = 2
7 Correct 7 ms 11240 KB n = 3
8 Correct 8 ms 11212 KB n = 3
9 Correct 8 ms 11152 KB n = 3
10 Correct 7 ms 11212 KB n = 8
11 Correct 8 ms 11232 KB n = 8
12 Correct 8 ms 11212 KB n = 8
13 Correct 8 ms 11236 KB n = 8
14 Correct 9 ms 11232 KB n = 8
15 Correct 8 ms 11212 KB n = 8
16 Correct 7 ms 11212 KB n = 8
17 Correct 7 ms 11236 KB n = 8
18 Correct 7 ms 11212 KB n = 8
19 Correct 7 ms 11212 KB n = 3
20 Correct 8 ms 11268 KB n = 7
21 Correct 8 ms 11240 KB n = 8
22 Correct 10 ms 11172 KB n = 8
23 Correct 8 ms 11212 KB n = 8
24 Correct 8 ms 11212 KB n = 8
25 Correct 8 ms 11212 KB n = 8
26 Correct 8 ms 11236 KB n = 8
27 Correct 8 ms 11212 KB n = 8
28 Correct 7 ms 11212 KB n = 8
29 Correct 7 ms 11224 KB n = 16
30 Correct 7 ms 11212 KB n = 16
31 Correct 7 ms 11212 KB n = 16
32 Correct 7 ms 11212 KB n = 16
33 Correct 8 ms 11212 KB n = 16
34 Correct 8 ms 11212 KB n = 16
35 Correct 8 ms 11212 KB n = 16
36 Correct 8 ms 11212 KB n = 15
37 Correct 8 ms 11172 KB n = 8
38 Correct 8 ms 11212 KB n = 16
39 Correct 7 ms 11208 KB n = 16
40 Correct 9 ms 11212 KB n = 9
41 Correct 8 ms 11212 KB n = 16
42 Correct 8 ms 11292 KB n = 16
43 Correct 8 ms 11252 KB n = 16
44 Correct 8 ms 11240 KB n = 9
45 Correct 7 ms 11212 KB n = 15
46 Correct 7 ms 11240 KB n = 16
47 Correct 7 ms 11212 KB n = 16
48 Correct 7 ms 11244 KB n = 16
49 Correct 1122 ms 58536 KB n = 199999
50 Correct 1116 ms 61904 KB n = 199991
51 Correct 1138 ms 62004 KB n = 199993
52 Correct 811 ms 51612 KB n = 152076
53 Correct 480 ms 35164 KB n = 93249
54 Correct 947 ms 55200 KB n = 199910
55 Correct 946 ms 60656 KB n = 199999
56 Correct 930 ms 55280 KB n = 199997
57 Correct 983 ms 55824 KB n = 171294
58 Correct 731 ms 49676 KB n = 140872
59 Correct 999 ms 55548 KB n = 199886
60 Correct 983 ms 60804 KB n = 199996
61 Correct 897 ms 56528 KB n = 200000
62 Correct 912 ms 60472 KB n = 199998
63 Correct 950 ms 59960 KB n = 200000
64 Correct 986 ms 61400 KB n = 199998
65 Correct 943 ms 61932 KB n = 200000
66 Correct 973 ms 59912 KB n = 190000
67 Correct 823 ms 57392 KB n = 177777
68 Correct 505 ms 36592 KB n = 100000
69 Correct 1004 ms 61980 KB n = 200000
70 Correct 1029 ms 61928 KB n = 200000
71 Correct 1115 ms 61932 KB n = 200000
72 Correct 1149 ms 61872 KB n = 200000
73 Correct 1118 ms 61936 KB n = 200000
74 Correct 1120 ms 61920 KB n = 200000
75 Correct 940 ms 61868 KB n = 200000
76 Correct 991 ms 61976 KB n = 200000
77 Correct 634 ms 42580 KB n = 200000
78 Correct 563 ms 42420 KB n = 200000
79 Correct 1060 ms 58496 KB n = 184307
80 Correct 341 ms 31588 KB n = 76040
81 Correct 985 ms 55560 KB n = 199981
82 Correct 1002 ms 60764 KB n = 199994
83 Correct 921 ms 56648 KB n = 199996
84 Correct 1008 ms 60556 KB n = 199998
85 Correct 984 ms 59856 KB n = 200000
86 Correct 973 ms 61248 KB n = 199998
87 Correct 944 ms 61880 KB n = 200000
88 Correct 987 ms 61952 KB n = 200000
89 Correct 927 ms 61892 KB n = 200000
90 Correct 1043 ms 62136 KB n = 200000
91 Correct 1078 ms 61996 KB n = 200000
92 Correct 1097 ms 61856 KB n = 200000