oj.uz

Submission #573081

# Submission time Handle Problem Language Result Execution time Memory
573081 2022-06-05T17:46:03 Z 2fat2code Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 1341 ms 153912 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define fr first
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define sc second
#define all(s) s.begin(), s.end()
#define rc(s) return cout << s, 0
using namespace std;

const int nmax = 400005;

int n, par[nmax], viz[nmax], componente;
long long ans;
unordered_map<int,vector<int>>mp_in;
unordered_map<int,vector<int>>mp_out;
unordered_map<int,vector<int>>mp_intz;
unordered_map<int,vector<int>>mp_outtz;
vector<long long>compress;
vector<pair<long long,pair<int,int>>>edges;

void dfs(int s){
    //cout << "CHECK " << s << ' ' << componente << '\n';
    viz[s] = componente;
    for(auto it : mp_out[compress[s]]){
        auto it2 = lower_bound(all(compress), it) - compress.begin();
        if(!viz[it2]) dfs(it2);
    }
}

int findpar(int x){
    if(x != par[x]){
        par[x] = findpar(par[x]);
    }
    return par[x];
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int maxi = 0;
    for(int i=0;i<(int)s.size();i++){
        maxi = max({maxi, s[i], t[i]});
    }
    s.push_back(maxi);
    t.push_back(1);
    n = (int)s.size();
    for(int i=0;i<n;i++){
       // cout << "BLEAAEAAA" << s[i] << ' ' << t[i] << '\n';
        mp_out[s[i]].push_back(t[i]);
        mp_in[t[i]].push_back(s[i]);
        compress.push_back(s[i]);
        compress.push_back(t[i]);
    }
    sort(all(compress));
    compress.resize(unique(all(compress)) - compress.begin());
    int gratis = 0, plata = 0;
    for(int i=0;i<(int)compress.size();i++){
     //   cout << ans << ' ' << cu_plata << '\n';
        auto it = compress[i];
      //  cout << "CHECK " << it << '\n';
        if(i >= 1){
            if(gratis > 0) mp_outtz[compress[i-1]].push_back(compress[i]);
            if(plata > 0) mp_outtz[compress[i]].push_back(compress[i-1]);
            ans += plata * (compress[i] - compress[i - 1]);

        }
        int x = mp_out[it].size() - mp_in[it].size();
     //   cout << "CHECK " << x << ' ' << mp_out[it].size() << ' ' << mp_in[it].size() << '\n';
        if(x > 0){
            int lol = min(gratis, x);
            gratis -= lol;
            x -= lol;
            plata += x;
        }
        else if(x < 0){
            int y = abs(x);
            int lol = min(y, plata);
            plata -= lol;
            y -= lol;
            gratis += y;
        }
    //    cout << "BLEA " << gratis << '\n';
    //    cout << "BLEA " << plata << '\n';
    //    cout << ans << ' ' << it << ' ' << gratis << ' ' << plata << '\n';
    }
    //cout << ans << '\n';
    //assert(gratis == 0 && cu_plata == 0);
    for(auto it : compress){
        for(auto it1 : mp_outtz[it]){
            mp_out[it].push_back(it1);
        }
    }
    for(int i=0;i<(int)compress.size();i++){
        if(!viz[i]){
            ++componente;
            dfs(i);
        }
    }
  //  cout << ans << ' ' << componente << '\n';
    for(int i=1;i<=componente;i++) par[i] = i;
    for(int i=1;i<(int)compress.size();i++){
        edges.push_back({compress[i] - compress[i-1], {viz[i-1], viz[i]}});
    }
    sort(all(edges));
    for(auto it : edges){
        int x = findpar(it.sc.fr);
        int y = findpar(it.sc.sc);
        if(x != y){
            ans += it.fr;
            par[x] = y;
        }
    }
    return ans;
}

// 1. Solve the problem
// 2. ???
// 3. Profit

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1220 ms 150232 KB n = 199999
2 Correct 1341 ms 135932 KB n = 199991
3 Correct 1228 ms 149316 KB n = 199993
4 Correct 873 ms 97292 KB n = 152076
5 Correct 565 ms 64488 KB n = 93249
6 Correct 774 ms 103320 KB n = 199910
7 Correct 1100 ms 135132 KB n = 199999
8 Correct 790 ms 107708 KB n = 199997
9 Correct 1016 ms 108192 KB n = 171294
10 Correct 829 ms 91440 KB n = 140872
11 Correct 796 ms 104504 KB n = 199886
12 Correct 1118 ms 134708 KB n = 199996
13 Correct 802 ms 110624 KB n = 200000
14 Correct 1018 ms 136144 KB n = 199998
15 Correct 985 ms 130952 KB n = 200000
16 Correct 1122 ms 133092 KB n = 199998
17 Correct 1135 ms 137756 KB n = 200000
18 Correct 1174 ms 133020 KB n = 190000
19 Correct 1042 ms 136720 KB n = 177777
20 Correct 564 ms 68048 KB n = 100000
21 Correct 1262 ms 135892 KB n = 200000
22 Correct 1061 ms 119456 KB n = 200000
23 Correct 1107 ms 143936 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 0 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 1 ms 312 KB n = 2
7 Correct 1 ms 312 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 312 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 312 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 ms 316 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 316 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 316 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 1 ms 312 KB n = 16
30 Correct 1 ms 312 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 340 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 0 ms 312 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 0 ms 312 KB n = 9
41 Correct 1 ms 340 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 1 ms 212 KB n = 9
45 Correct 0 ms 340 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 0 ms 312 KB n = 16
48 Correct 1 ms 304 KB n = 16
49 Correct 1220 ms 150232 KB n = 199999
50 Correct 1341 ms 135932 KB n = 199991
51 Correct 1228 ms 149316 KB n = 199993
52 Correct 873 ms 97292 KB n = 152076
53 Correct 565 ms 64488 KB n = 93249
54 Correct 774 ms 103320 KB n = 199910
55 Correct 1100 ms 135132 KB n = 199999
56 Correct 790 ms 107708 KB n = 199997
57 Correct 1016 ms 108192 KB n = 171294
58 Correct 829 ms 91440 KB n = 140872
59 Correct 796 ms 104504 KB n = 199886
60 Correct 1118 ms 134708 KB n = 199996
61 Correct 802 ms 110624 KB n = 200000
62 Correct 1018 ms 136144 KB n = 199998
63 Correct 985 ms 130952 KB n = 200000
64 Correct 1122 ms 133092 KB n = 199998
65 Correct 1135 ms 137756 KB n = 200000
66 Correct 1174 ms 133020 KB n = 190000
67 Correct 1042 ms 136720 KB n = 177777
68 Correct 564 ms 68048 KB n = 100000
69 Correct 1262 ms 135892 KB n = 200000
70 Correct 1061 ms 119456 KB n = 200000
71 Correct 1107 ms 143936 KB n = 200000
72 Correct 1224 ms 153812 KB n = 200000
73 Correct 1295 ms 139680 KB n = 200000
74 Correct 1220 ms 150476 KB n = 200000
75 Correct 1148 ms 153912 KB n = 200000
76 Correct 1147 ms 153900 KB n = 200000
77 Correct 581 ms 85132 KB n = 200000
78 Correct 431 ms 67068 KB n = 200000
79 Correct 1182 ms 127748 KB n = 184307
80 Correct 398 ms 50396 KB n = 76040
81 Correct 778 ms 107016 KB n = 199981
82 Correct 1099 ms 137576 KB n = 199994
83 Correct 804 ms 113304 KB n = 199996
84 Correct 993 ms 138908 KB n = 199998
85 Correct 958 ms 133852 KB n = 200000
86 Correct 1117 ms 136276 KB n = 199998
87 Correct 1132 ms 141264 KB n = 200000
88 Correct 1203 ms 142088 KB n = 200000
89 Correct 1151 ms 153856 KB n = 200000
90 Correct 1271 ms 139404 KB n = 200000
91 Correct 1050 ms 123036 KB n = 200000
92 Correct 1104 ms 147448 KB n = 200000