oj.uz

Submission #620104

# Submission time Handle Problem Language Result Execution time Memory
620104 2022-08-02T23:48:38 Z definitelynotmee Roller Coaster Railroad (IOI16_railroad) C++
100 / 100
 696 ms 57404 KB 
#include<bits/stdc++.h>
#include"railroad.h"
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

struct edge{
    ll a, b, w;
    bool operator<(edge c) const{
        return w < c.w;
    }
};

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = s.size();
    set<int> S;
    S.insert(0);
    S.insert(INF);
    map<int,int> tr;
    
    for(int i = 0; i < n; i++){
        S.insert(s[i]);
        S.insert(t[i]);
    }

    for(int i : S)
        tr[i] = tr.size();
    
    int m = tr.size();
    
    vector<int> delta(m);
    vector<ll> og(m);

    for(pii i : tr){
        og[i.ss] = i.ff;
    }
    for(int& i : s)
        i = tr[i];
    for(int& i : t)
        i = tr[i];
    
    vector<int> pai(m);
    iota(all(pai),0);

    auto find =[&](int id, auto f){
        if(pai[id] == id)
            return id;
        return pai[id] = f(pai[id],f);
    };

    auto onion =[&](int a, int b){
        a = find(a,find);
        b = find(b,find);
        if(a == b)
            return false;
        pai[a] = b; 
        return true;
    };

    ll ahead = 1;
    ll resp = 0;

    for(int i = 0; i < n; i++){
        delta[s[i]]--;
        delta[t[i]]++;
        onion(s[i],t[i]);
    }
    
    vector<edge> cand;

    for(int i = 0; i < m-1; i++){
        ahead+=delta[i];
        if(ahead!=0){
            resp+=max(0ll,-ahead*(og[i+1]-og[i]));
            onion(i,i+1);
        } else cand.push_back({i,i+1,og[i+1]-og[i]});
    }
    
    sort(all(cand));

    for(edge i : cand){
        if(onion(i.a,i.b))
            resp+=i.w;
    }

    return resp;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 304 KB n = 2
4 Correct 1 ms 304 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 296 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 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 304 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 300 KB n = 8
23 Correct 0 ms 296 KB n = 8
24 Correct 1 ms 212 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 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 304 KB n = 2
4 Correct 1 ms 304 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 296 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 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 304 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 300 KB n = 8
23 Correct 0 ms 296 KB n = 8
24 Correct 1 ms 212 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 1 ms 212 KB n = 8
29 Correct 0 ms 300 KB n = 16
30 Correct 0 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 1 ms 304 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 0 ms 296 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 1 ms 212 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 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 1 ms 296 KB n = 16
48 Correct 0 ms 212 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 661 ms 51096 KB n = 199999
2 Correct 677 ms 51104 KB n = 199991
3 Correct 625 ms 51176 KB n = 199993
4 Correct 462 ms 38596 KB n = 152076
5 Correct 245 ms 23912 KB n = 93249
6 Correct 542 ms 42004 KB n = 199910
7 Correct 622 ms 49336 KB n = 199999
8 Correct 514 ms 42224 KB n = 199997
9 Correct 527 ms 43600 KB n = 171294
10 Correct 395 ms 36148 KB n = 140872
11 Correct 530 ms 42748 KB n = 199886
12 Correct 590 ms 50684 KB n = 199996
13 Correct 524 ms 44936 KB n = 200000
14 Correct 606 ms 55688 KB n = 199998
15 Correct 644 ms 54968 KB n = 200000
16 Correct 630 ms 56692 KB n = 199998
17 Correct 547 ms 53164 KB n = 200000
18 Correct 575 ms 48844 KB n = 190000
19 Correct 448 ms 47248 KB n = 177777
20 Correct 231 ms 25676 KB n = 100000
21 Correct 629 ms 51132 KB n = 200000
22 Correct 625 ms 57404 KB n = 200000
23 Correct 696 ms 57380 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 304 KB n = 2
4 Correct 1 ms 304 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 0 ms 296 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 296 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 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 304 KB n = 8
18 Correct 1 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 1 ms 212 KB n = 7
21 Correct 0 ms 212 KB n = 8
22 Correct 0 ms 300 KB n = 8
23 Correct 0 ms 296 KB n = 8
24 Correct 1 ms 212 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 1 ms 212 KB n = 8
29 Correct 0 ms 300 KB n = 16
30 Correct 0 ms 212 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 0 ms 212 KB n = 16
33 Correct 1 ms 304 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 0 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 0 ms 296 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 1 ms 212 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 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 1 ms 296 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 661 ms 51096 KB n = 199999
50 Correct 677 ms 51104 KB n = 199991
51 Correct 625 ms 51176 KB n = 199993
52 Correct 462 ms 38596 KB n = 152076
53 Correct 245 ms 23912 KB n = 93249
54 Correct 542 ms 42004 KB n = 199910
55 Correct 622 ms 49336 KB n = 199999
56 Correct 514 ms 42224 KB n = 199997
57 Correct 527 ms 43600 KB n = 171294
58 Correct 395 ms 36148 KB n = 140872
59 Correct 530 ms 42748 KB n = 199886
60 Correct 590 ms 50684 KB n = 199996
61 Correct 524 ms 44936 KB n = 200000
62 Correct 606 ms 55688 KB n = 199998
63 Correct 644 ms 54968 KB n = 200000
64 Correct 630 ms 56692 KB n = 199998
65 Correct 547 ms 53164 KB n = 200000
66 Correct 575 ms 48844 KB n = 190000
67 Correct 448 ms 47248 KB n = 177777
68 Correct 231 ms 25676 KB n = 100000
69 Correct 629 ms 51132 KB n = 200000
70 Correct 625 ms 57404 KB n = 200000
71 Correct 696 ms 57380 KB n = 200000
72 Correct 689 ms 51100 KB n = 200000
73 Correct 676 ms 51148 KB n = 200000
74 Correct 650 ms 51252 KB n = 200000
75 Correct 507 ms 51220 KB n = 200000
76 Correct 514 ms 51020 KB n = 200000
77 Correct 335 ms 29200 KB n = 200000
78 Correct 371 ms 35512 KB n = 200000
79 Correct 596 ms 46924 KB n = 184307
80 Correct 167 ms 19532 KB n = 76040
81 Correct 552 ms 42684 KB n = 199981
82 Correct 588 ms 50752 KB n = 199994
83 Correct 535 ms 44980 KB n = 199996
84 Correct 579 ms 55708 KB n = 199998
85 Correct 582 ms 54936 KB n = 200000
86 Correct 630 ms 56696 KB n = 199998
87 Correct 535 ms 53144 KB n = 200000
88 Correct 634 ms 51616 KB n = 200000
89 Correct 541 ms 53156 KB n = 200000
90 Correct 624 ms 51200 KB n = 200000
91 Correct 682 ms 57400 KB n = 200000
92 Correct 691 ms 57364 KB n = 200000