oj.uz

Submission #280000

# Submission time Handle Problem Language Result Execution time Memory
280000 2020-08-22T12:37:07 Z eohomegrownapps Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 355 ms 63836 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll INF = 1e9;

vector<vector<ll>> adjlist;
vector<ll> comind;
vector<bool> visited;

void dfs(ll ind, ll com){
    //cout<<ind<<' '<<com<<'\n';
    visited[ind]=true;
    comind[ind]=com;
    for (ll i : adjlist[ind]){
        if (!visited[i]){
            dfs(i,com);
        }
    }
}

struct UFDS{
    vector<ll> parent;
    ll n;
    UFDS(ll _n){
        n=_n;
        parent.resize(n);
        for (ll i = 0; i<n; i++){
            parent[i]=i;
        }
    }

    ll root(ll x){
        if (x==parent[x]){return x;}
        return parent[x]=root(parent[x]);
    }

    void connect(ll a, ll b){
        ll ra = root(a);
        ll rb = root(b);
        if (ra!=rb){
            parent[ra]=rb;
        }
    }

    bool connected(ll a, ll b){
        return root(a)==root(b);
    }
};

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    vector<ll> ind2coord;
    for (ll i : s){
        ind2coord.push_back(i);
    }
    for (ll i : t){
        ind2coord.push_back(i);
    }
    ind2coord.push_back(INF);
    ind2coord.push_back(1);
    sort(ind2coord.begin(),ind2coord.end());
    ind2coord.erase(unique(ind2coord.begin(),ind2coord.end()),ind2coord.end());
    s.push_back(INF);
    t.push_back(1);
    ll n = ind2coord.size();

    for (ll i = 0; i<s.size(); i++){
        s[i]=lower_bound(ind2coord.begin(),ind2coord.end(),s[i])-ind2coord.begin();
        t[i]=lower_bound(ind2coord.begin(),ind2coord.end(),t[i])-ind2coord.begin();
    }
    //start at 1, end at 1
    
    ll ans = 0;

    vector<ll> edgedelta(n);
    for (ll i = 0; i<s.size(); i++){
        edgedelta[s[i]]++;
        edgedelta[t[i]]--;
    }
    ll curdelta = 0;
    for (ll i = 0; i<n-1; i++){
        curdelta+=edgedelta[i];
        if (curdelta<0){
            //need to go ltr / speed up (fine)
            s.push_back(i);
            t.push_back(i+1);
        }
        if (curdelta>0){
            //need to go rtl / slow down (not fine)
            ans+=curdelta*(ind2coord[i+1]-ind2coord[i]);
            s.push_back(i+1);
            t.push_back(i);
        }
    }

    //make connected components
    adjlist.resize(n);
    visited.resize(n);
    comind.resize(n);
    for (ll i = 0; i<s.size(); i++){
        adjlist[s[i]].push_back(t[i]);
    }
    ll cptr = 0;
    for (ll i = 0; i<n; i++){
        if (!visited[i]){
            dfs(i,cptr);
            cptr++;
        }
    }
    vector<pair<ll,pair<ll,ll>>> edges;
    for (ll i = 0; i<n-1; i++){
        if (comind[i]!=comind[i+1]){
            edges.push_back({ind2coord[i+1]-ind2coord[i],{comind[i],comind[i+1]}});
        }
    }
    sort(edges.begin(), edges.end());
    UFDS u(n);
    for (auto e : edges){
        // are these connected?
        if (u.connected(e.second.first, e.second.second)){
            continue;
        }
        ans+=e.first;
        u.connect(e.second.first, e.second.second);
    }
    return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:68:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for (ll i = 0; i<s.size(); i++){
      |                    ~^~~~~~~~~
railroad.cpp:77:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (ll i = 0; i<s.size(); i++){
      |                    ~^~~~~~~~~
railroad.cpp:101:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for (ll i = 0; i<s.size(); i++){
      |                    ~^~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 59964 KB n = 199999
2 Correct 354 ms 49160 KB n = 199991
3 Correct 305 ms 59196 KB n = 199993
4 Correct 230 ms 36956 KB n = 152076
5 Correct 141 ms 23012 KB n = 93249
6 Correct 277 ms 40024 KB n = 199910
7 Correct 285 ms 49364 KB n = 199999
8 Correct 274 ms 42944 KB n = 199997
9 Correct 274 ms 42012 KB n = 171294
10 Correct 226 ms 34180 KB n = 140872
11 Correct 282 ms 40508 KB n = 199886
12 Correct 295 ms 49212 KB n = 199996
13 Correct 284 ms 44220 KB n = 200000
14 Correct 315 ms 55000 KB n = 199998
15 Correct 326 ms 51492 KB n = 200000
16 Correct 309 ms 52284 KB n = 199998
17 Correct 305 ms 50492 KB n = 200000
18 Correct 270 ms 48652 KB n = 190000
19 Correct 258 ms 53228 KB n = 177777
20 Correct 146 ms 24536 KB n = 100000
21 Correct 324 ms 49092 KB n = 200000
22 Correct 325 ms 45784 KB n = 200000
23 Correct 329 ms 58304 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 2
2 Correct 0 ms 256 KB n = 2
3 Correct 0 ms 256 KB n = 2
4 Correct 0 ms 256 KB n = 2
5 Correct 0 ms 256 KB n = 2
6 Correct 0 ms 256 KB n = 2
7 Correct 0 ms 256 KB n = 3
8 Correct 1 ms 256 KB n = 3
9 Correct 1 ms 256 KB n = 3
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 256 KB n = 8
12 Correct 0 ms 256 KB n = 8
13 Correct 0 ms 384 KB n = 8
14 Correct 0 ms 256 KB n = 8
15 Correct 0 ms 256 KB n = 8
16 Correct 0 ms 256 KB n = 8
17 Correct 1 ms 256 KB n = 8
18 Correct 0 ms 256 KB n = 8
19 Correct 0 ms 256 KB n = 3
20 Correct 1 ms 256 KB n = 7
21 Correct 1 ms 256 KB n = 8
22 Correct 1 ms 256 KB n = 8
23 Correct 1 ms 384 KB n = 8
24 Correct 1 ms 256 KB n = 8
25 Correct 0 ms 256 KB n = 8
26 Correct 0 ms 256 KB n = 8
27 Correct 0 ms 256 KB n = 8
28 Correct 1 ms 256 KB n = 8
29 Correct 0 ms 384 KB n = 16
30 Correct 1 ms 256 KB n = 16
31 Correct 0 ms 256 KB n = 16
32 Correct 1 ms 256 KB n = 16
33 Correct 0 ms 256 KB n = 16
34 Correct 0 ms 384 KB n = 16
35 Correct 0 ms 256 KB n = 16
36 Correct 0 ms 256 KB n = 15
37 Correct 1 ms 256 KB n = 8
38 Correct 0 ms 256 KB n = 16
39 Correct 1 ms 256 KB n = 16
40 Correct 1 ms 256 KB n = 9
41 Correct 0 ms 256 KB n = 16
42 Correct 1 ms 256 KB n = 16
43 Correct 1 ms 256 KB n = 16
44 Correct 1 ms 256 KB n = 9
45 Correct 0 ms 256 KB n = 15
46 Correct 0 ms 256 KB n = 16
47 Correct 0 ms 256 KB n = 16
48 Correct 1 ms 256 KB n = 16
49 Correct 335 ms 59964 KB n = 199999
50 Correct 354 ms 49160 KB n = 199991
51 Correct 305 ms 59196 KB n = 199993
52 Correct 230 ms 36956 KB n = 152076
53 Correct 141 ms 23012 KB n = 93249
54 Correct 277 ms 40024 KB n = 199910
55 Correct 285 ms 49364 KB n = 199999
56 Correct 274 ms 42944 KB n = 199997
57 Correct 274 ms 42012 KB n = 171294
58 Correct 226 ms 34180 KB n = 140872
59 Correct 282 ms 40508 KB n = 199886
60 Correct 295 ms 49212 KB n = 199996
61 Correct 284 ms 44220 KB n = 200000
62 Correct 315 ms 55000 KB n = 199998
63 Correct 326 ms 51492 KB n = 200000
64 Correct 309 ms 52284 KB n = 199998
65 Correct 305 ms 50492 KB n = 200000
66 Correct 270 ms 48652 KB n = 190000
67 Correct 258 ms 53228 KB n = 177777
68 Correct 146 ms 24536 KB n = 100000
69 Correct 324 ms 49092 KB n = 200000
70 Correct 325 ms 45784 KB n = 200000
71 Correct 329 ms 58304 KB n = 200000
72 Correct 302 ms 63804 KB n = 200000
73 Correct 355 ms 53032 KB n = 200000
74 Correct 306 ms 61244 KB n = 200000
75 Correct 296 ms 63804 KB n = 200000
76 Correct 292 ms 63836 KB n = 200000
77 Correct 280 ms 37052 KB n = 200000
78 Correct 246 ms 33856 KB n = 200000
79 Correct 296 ms 46524 KB n = 184307
80 Correct 107 ms 20484 KB n = 76040
81 Correct 286 ms 43196 KB n = 199981
82 Correct 309 ms 52412 KB n = 199994
83 Correct 283 ms 47180 KB n = 199996
84 Correct 292 ms 58044 KB n = 199998
85 Correct 272 ms 54460 KB n = 200000
86 Correct 295 ms 55584 KB n = 199998
87 Correct 282 ms 54460 KB n = 200000
88 Correct 310 ms 54948 KB n = 200000
89 Correct 281 ms 63740 KB n = 200000
90 Correct 336 ms 53180 KB n = 200000
91 Correct 326 ms 49472 KB n = 200000
92 Correct 322 ms 62272 KB n = 200000