oj.uz

Submission #429138

# Submission time Handle Problem Language Result Execution time Memory
429138 2021-06-15T17:47:26 Z Antekb Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 849 ms 57504 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;
    unordered_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 8 ms 11208 KB n = 2
2 Correct 7 ms 11132 KB n = 2
3 Correct 8 ms 11212 KB n = 2
4 Correct 11 ms 11212 KB n = 2
5 Correct 7 ms 11212 KB n = 2
6 Correct 7 ms 11252 KB n = 2
7 Correct 9 ms 11212 KB n = 3
8 Correct 7 ms 11212 KB n = 3
9 Correct 8 ms 11212 KB n = 3
10 Correct 8 ms 11212 KB n = 8
11 Correct 8 ms 11212 KB n = 8
12 Correct 8 ms 11212 KB n = 8
13 Correct 8 ms 11188 KB n = 8
14 Correct 8 ms 11212 KB n = 8
15 Correct 8 ms 11212 KB n = 8
16 Correct 10 ms 11212 KB n = 8
17 Correct 8 ms 11256 KB n = 8
18 Correct 8 ms 11212 KB n = 8
19 Correct 9 ms 11216 KB n = 3
20 Correct 10 ms 11212 KB n = 7
21 Correct 8 ms 11212 KB n = 8
22 Correct 8 ms 11212 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 8 ms 11208 KB n = 2
2 Correct 7 ms 11132 KB n = 2
3 Correct 8 ms 11212 KB n = 2
4 Correct 11 ms 11212 KB n = 2
5 Correct 7 ms 11212 KB n = 2
6 Correct 7 ms 11252 KB n = 2
7 Correct 9 ms 11212 KB n = 3
8 Correct 7 ms 11212 KB n = 3
9 Correct 8 ms 11212 KB n = 3
10 Correct 8 ms 11212 KB n = 8
11 Correct 8 ms 11212 KB n = 8
12 Correct 8 ms 11212 KB n = 8
13 Correct 8 ms 11188 KB n = 8
14 Correct 8 ms 11212 KB n = 8
15 Correct 8 ms 11212 KB n = 8
16 Correct 10 ms 11212 KB n = 8
17 Correct 8 ms 11256 KB n = 8
18 Correct 8 ms 11212 KB n = 8
19 Correct 9 ms 11216 KB n = 3
20 Correct 10 ms 11212 KB n = 7
21 Correct 8 ms 11212 KB n = 8
22 Correct 8 ms 11212 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 7 ms 11260 KB n = 8
27 Correct 8 ms 11212 KB n = 8
28 Correct 8 ms 11240 KB n = 8
29 Correct 9 ms 11208 KB n = 16
30 Correct 8 ms 11212 KB n = 16
31 Correct 10 ms 11232 KB n = 16
32 Correct 8 ms 11260 KB n = 16
33 Correct 8 ms 11260 KB n = 16
34 Correct 8 ms 11212 KB n = 16
35 Correct 7 ms 11212 KB n = 16
36 Correct 8 ms 11212 KB n = 15
37 Correct 7 ms 11236 KB n = 8
38 Correct 9 ms 11212 KB n = 16
39 Correct 8 ms 11212 KB n = 16
40 Correct 9 ms 11212 KB n = 9
41 Correct 11 ms 11160 KB n = 16
42 Correct 10 ms 11212 KB n = 16
43 Correct 8 ms 11212 KB n = 16
44 Correct 8 ms 11212 KB n = 9
45 Correct 8 ms 11260 KB n = 15
46 Correct 7 ms 11212 KB n = 16
47 Correct 7 ms 11140 KB n = 16
48 Correct 7 ms 11212 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 849 ms 57364 KB n = 199999
2 Correct 801 ms 57332 KB n = 199991
3 Correct 814 ms 57492 KB n = 199993
4 Correct 583 ms 46988 KB n = 152076
5 Correct 353 ms 33268 KB n = 93249
6 Correct 629 ms 49944 KB n = 199910
7 Correct 752 ms 56768 KB n = 199999
8 Correct 642 ms 50172 KB n = 199997
9 Correct 746 ms 50004 KB n = 171294
10 Correct 540 ms 45280 KB n = 140872
11 Correct 670 ms 50272 KB n = 199886
12 Correct 774 ms 56988 KB n = 199996
13 Correct 681 ms 51140 KB n = 200000
14 Correct 737 ms 56892 KB n = 199998
15 Correct 718 ms 56404 KB n = 200000
16 Correct 809 ms 57272 KB n = 199998
17 Correct 790 ms 57396 KB n = 200000
18 Correct 793 ms 55820 KB n = 190000
19 Correct 733 ms 53832 KB n = 177777
20 Correct 363 ms 34292 KB n = 100000
21 Correct 773 ms 57428 KB n = 200000
22 Correct 787 ms 57504 KB n = 200000
23 Correct 828 ms 57336 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11208 KB n = 2
2 Correct 7 ms 11132 KB n = 2
3 Correct 8 ms 11212 KB n = 2
4 Correct 11 ms 11212 KB n = 2
5 Correct 7 ms 11212 KB n = 2
6 Correct 7 ms 11252 KB n = 2
7 Correct 9 ms 11212 KB n = 3
8 Correct 7 ms 11212 KB n = 3
9 Correct 8 ms 11212 KB n = 3
10 Correct 8 ms 11212 KB n = 8
11 Correct 8 ms 11212 KB n = 8
12 Correct 8 ms 11212 KB n = 8
13 Correct 8 ms 11188 KB n = 8
14 Correct 8 ms 11212 KB n = 8
15 Correct 8 ms 11212 KB n = 8
16 Correct 10 ms 11212 KB n = 8
17 Correct 8 ms 11256 KB n = 8
18 Correct 8 ms 11212 KB n = 8
19 Correct 9 ms 11216 KB n = 3
20 Correct 10 ms 11212 KB n = 7
21 Correct 8 ms 11212 KB n = 8
22 Correct 8 ms 11212 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 7 ms 11260 KB n = 8
27 Correct 8 ms 11212 KB n = 8
28 Correct 8 ms 11240 KB n = 8
29 Correct 9 ms 11208 KB n = 16
30 Correct 8 ms 11212 KB n = 16
31 Correct 10 ms 11232 KB n = 16
32 Correct 8 ms 11260 KB n = 16
33 Correct 8 ms 11260 KB n = 16
34 Correct 8 ms 11212 KB n = 16
35 Correct 7 ms 11212 KB n = 16
36 Correct 8 ms 11212 KB n = 15
37 Correct 7 ms 11236 KB n = 8
38 Correct 9 ms 11212 KB n = 16
39 Correct 8 ms 11212 KB n = 16
40 Correct 9 ms 11212 KB n = 9
41 Correct 11 ms 11160 KB n = 16
42 Correct 10 ms 11212 KB n = 16
43 Correct 8 ms 11212 KB n = 16
44 Correct 8 ms 11212 KB n = 9
45 Correct 8 ms 11260 KB n = 15
46 Correct 7 ms 11212 KB n = 16
47 Correct 7 ms 11140 KB n = 16
48 Correct 7 ms 11212 KB n = 16
49 Correct 849 ms 57364 KB n = 199999
50 Correct 801 ms 57332 KB n = 199991
51 Correct 814 ms 57492 KB n = 199993
52 Correct 583 ms 46988 KB n = 152076
53 Correct 353 ms 33268 KB n = 93249
54 Correct 629 ms 49944 KB n = 199910
55 Correct 752 ms 56768 KB n = 199999
56 Correct 642 ms 50172 KB n = 199997
57 Correct 746 ms 50004 KB n = 171294
58 Correct 540 ms 45280 KB n = 140872
59 Correct 670 ms 50272 KB n = 199886
60 Correct 774 ms 56988 KB n = 199996
61 Correct 681 ms 51140 KB n = 200000
62 Correct 737 ms 56892 KB n = 199998
63 Correct 718 ms 56404 KB n = 200000
64 Correct 809 ms 57272 KB n = 199998
65 Correct 790 ms 57396 KB n = 200000
66 Correct 793 ms 55820 KB n = 190000
67 Correct 733 ms 53832 KB n = 177777
68 Correct 363 ms 34292 KB n = 100000
69 Correct 773 ms 57428 KB n = 200000
70 Correct 787 ms 57504 KB n = 200000
71 Correct 828 ms 57336 KB n = 200000
72 Correct 835 ms 57316 KB n = 200000
73 Correct 824 ms 57304 KB n = 200000
74 Correct 834 ms 57368 KB n = 200000
75 Correct 784 ms 57392 KB n = 200000
76 Correct 772 ms 57456 KB n = 200000
77 Correct 435 ms 38228 KB n = 200000
78 Correct 342 ms 38244 KB n = 200000
79 Correct 752 ms 54908 KB n = 184307
80 Correct 248 ms 29100 KB n = 76040
81 Correct 622 ms 50332 KB n = 199981
82 Correct 738 ms 56896 KB n = 199994
83 Correct 619 ms 51096 KB n = 199996
84 Correct 709 ms 56824 KB n = 199998
85 Correct 714 ms 56404 KB n = 200000
86 Correct 769 ms 57236 KB n = 199998
87 Correct 773 ms 57396 KB n = 200000
88 Correct 763 ms 57380 KB n = 200000
89 Correct 781 ms 57420 KB n = 200000
90 Correct 775 ms 57404 KB n = 200000
91 Correct 776 ms 57416 KB n = 200000
92 Correct 798 ms 57392 KB n = 200000