oj.uz

Submission #119748

# Submission time Handle Problem Language Result Execution time Memory
119748 2019-06-22T07:54:52 Z dorijanlendvaj Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 1958 ms 72016 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<int,int>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int MOD=1000000007,N=400010;
const char en='\n';
const ll LLINF=1ll<<60;
int par[N];
ll ans;
unordered_map<int,int> ma;

int fin(int a)
{
	if (a==par[a]) return a;
	return par[a]=fin(par[a]);
}

void merge(int a,int b,int c)
{
	a=fin(a);
	b=fin(b);
	if (a==b) return;
	ans+=c;
	par[a]=b;
}

bool debug=0;

ll plan_roller_coaster(vi s, vi t) {
	//if (debug) cout<<"startao"<<endl;
    int n = s.size()+1;
    s.pb(2e9);
    t.pb(1);
    set<int> x;
    for (auto e: s) x.insert(e);
    for (auto e: t) x.insert(e);
    for (int i=0;i<x.size();i++) par[i]=i;
    int i=0;
    for (auto e: x)
    {
    	ma[e]=i++;
    }
    //if (debug) cout<<"tu sam"<<endl;
    for (int i=0;i<n;++i) merge(ma[s[i]],ma[t[i]],0);
    map<int,int> maa;
    for (int i=0;i<n;++i) ++maa[s[i]],--maa[t[i]];
    int last=1,bal=0;
    //if (debug) cout<<"i tu sam"<<endl;
    for (auto a: maa)
    {
    	if (debug) cout<<last<<' '<<a.x<<' '<<bal<<en;
        if (bal) merge(ma[a.x],ma[last],0);
        ans+=max(0,bal)*1ll*(a.x-last);
        bal+=a.y;
        last=a.x;
    }
    if (debug) cout<<"finished random loop with ans="<<ans<<endl;
    vector<pair<int,pii>> v;
    auto it=x.begin();
    auto it1=it;
    ++it1;
    while (it1!=x.end())
    {
    	int a=*it,b=*it1;
    	v.pb({b-a,{ma[a],ma[b]}});
    	++it;
    	++it1;
    	if (debug) cout<<"from "<<a<<" to "<<b<<" with cost="<<b-a<<endl;
    }
    sort(v.begin(),v.end());
    for (auto a: v) merge(a.y.x,a.y.y,a.x);
    return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:43:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<x.size();i++) par[i]=i;
                  ~^~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1762 ms 68276 KB n = 199999
2 Correct 1958 ms 68116 KB n = 199991
3 Correct 1887 ms 68260 KB n = 199993
4 Correct 1321 ms 54868 KB n = 152076
5 Correct 661 ms 32408 KB n = 93249
6 Correct 1347 ms 58792 KB n = 199910
7 Correct 1530 ms 66860 KB n = 199999
8 Correct 1207 ms 58972 KB n = 199997
9 Correct 1343 ms 60348 KB n = 171294
10 Correct 1234 ms 52032 KB n = 140872
11 Correct 1281 ms 59488 KB n = 199886
12 Correct 1645 ms 70512 KB n = 199996
13 Correct 1312 ms 63904 KB n = 200000
14 Correct 1417 ms 70544 KB n = 199998
15 Correct 1400 ms 69472 KB n = 200000
16 Correct 1559 ms 71504 KB n = 199998
17 Correct 1609 ms 71828 KB n = 200000
18 Correct 1785 ms 69076 KB n = 190000
19 Correct 1442 ms 65308 KB n = 177777
20 Correct 690 ms 36032 KB n = 100000
21 Correct 1732 ms 71924 KB n = 200000
22 Correct 1682 ms 71972 KB n = 200000
23 Correct 1712 ms 71900 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 2
2 Correct 2 ms 384 KB n = 2
3 Correct 2 ms 256 KB n = 2
4 Correct 2 ms 384 KB n = 2
5 Correct 2 ms 256 KB n = 2
6 Correct 2 ms 256 KB n = 2
7 Correct 2 ms 256 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 2 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 256 KB n = 8
13 Correct 2 ms 384 KB n = 8
14 Correct 2 ms 384 KB n = 8
15 Correct 2 ms 384 KB n = 8
16 Correct 2 ms 384 KB n = 8
17 Correct 2 ms 384 KB n = 8
18 Correct 2 ms 384 KB n = 8
19 Correct 2 ms 256 KB n = 3
20 Correct 2 ms 256 KB n = 7
21 Correct 2 ms 256 KB n = 8
22 Correct 2 ms 384 KB n = 8
23 Correct 2 ms 256 KB n = 8
24 Correct 2 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 2 ms 384 KB n = 8
27 Correct 2 ms 256 KB n = 8
28 Correct 2 ms 384 KB n = 8
29 Correct 2 ms 384 KB n = 16
30 Correct 2 ms 384 KB n = 16
31 Correct 2 ms 384 KB n = 16
32 Correct 2 ms 256 KB n = 16
33 Correct 2 ms 256 KB n = 16
34 Correct 2 ms 256 KB n = 16
35 Correct 2 ms 384 KB n = 16
36 Correct 2 ms 384 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 2 ms 256 KB n = 16
39 Correct 2 ms 256 KB n = 16
40 Correct 2 ms 256 KB n = 9
41 Correct 2 ms 384 KB n = 16
42 Correct 2 ms 256 KB n = 16
43 Correct 2 ms 256 KB n = 16
44 Correct 2 ms 384 KB n = 9
45 Correct 2 ms 384 KB n = 15
46 Correct 2 ms 256 KB n = 16
47 Correct 2 ms 256 KB n = 16
48 Correct 2 ms 256 KB n = 16
49 Correct 1762 ms 68276 KB n = 199999
50 Correct 1958 ms 68116 KB n = 199991
51 Correct 1887 ms 68260 KB n = 199993
52 Correct 1321 ms 54868 KB n = 152076
53 Correct 661 ms 32408 KB n = 93249
54 Correct 1347 ms 58792 KB n = 199910
55 Correct 1530 ms 66860 KB n = 199999
56 Correct 1207 ms 58972 KB n = 199997
57 Correct 1343 ms 60348 KB n = 171294
58 Correct 1234 ms 52032 KB n = 140872
59 Correct 1281 ms 59488 KB n = 199886
60 Correct 1645 ms 70512 KB n = 199996
61 Correct 1312 ms 63904 KB n = 200000
62 Correct 1417 ms 70544 KB n = 199998
63 Correct 1400 ms 69472 KB n = 200000
64 Correct 1559 ms 71504 KB n = 199998
65 Correct 1609 ms 71828 KB n = 200000
66 Correct 1785 ms 69076 KB n = 190000
67 Correct 1442 ms 65308 KB n = 177777
68 Correct 690 ms 36032 KB n = 100000
69 Correct 1732 ms 71924 KB n = 200000
70 Correct 1682 ms 71972 KB n = 200000
71 Correct 1712 ms 71900 KB n = 200000
72 Correct 1654 ms 71808 KB n = 200000
73 Correct 1737 ms 71960 KB n = 200000
74 Correct 1704 ms 71904 KB n = 200000
75 Correct 1551 ms 71816 KB n = 200000
76 Correct 1611 ms 72008 KB n = 200000
77 Correct 795 ms 39564 KB n = 200000
78 Correct 773 ms 39564 KB n = 200000
79 Correct 1620 ms 66932 KB n = 184307
80 Correct 469 ms 29120 KB n = 76040
81 Correct 1284 ms 61872 KB n = 199981
82 Correct 1528 ms 70484 KB n = 199994
83 Correct 1312 ms 63708 KB n = 199996
84 Correct 1443 ms 70336 KB n = 199998
85 Correct 1408 ms 69724 KB n = 200000
86 Correct 1588 ms 71568 KB n = 199998
87 Correct 1628 ms 71872 KB n = 200000
88 Correct 1787 ms 71900 KB n = 200000
89 Correct 1668 ms 71808 KB n = 200000
90 Correct 1726 ms 72016 KB n = 200000
91 Correct 1669 ms 71900 KB n = 200000
92 Correct 1725 ms 71772 KB n = 200000