oj.uz

Submission #348708

# Submission time Handle Problem Language Result Execution time Memory
348708 2021-01-15T15:12:22 Z ACmachine Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 251 ms 18376 KB 
#include "railroad.h"

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

struct dsu{
    vector<int> e;
    dsu(){};
    dsu(int n){
        e.resize(n, -1);
    }
    int find(int x){ return (e[x] < 0 ? x : e[x] = find(e[x])); }
    int size(int x){ return -e[find(x)]; }
    int sameSet(int a, int b){ return find(a) == find(b); }
    bool join(int a, int b){
        a = find(a); b = find(b);
        if(a == b) return false;
        if(e[a] > e[b]) swap(a, b);
        e[a] += e[b]; e[b] = a;
        return true;
    }
};


long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    s.pb(INF); t.pb(0);
    int n = (int) s.size();
    vi vals;
    REP(i, n){
        vals.pb(s[i]);
        vals.pb(t[i]);
    }
    sort(all(vals));
    vals.erase(unique(all(vals)), vals.end());
    vi in(2 * n, 0);
    vi out(2 * n, 0);
    dsu d(2 * n); 
    REP(i, n){
        s[i] = lower_bound(all(vals), s[i]) - vals.begin();
        t[i] = lower_bound(all(vals), t[i]) - vals.begin();
        out[s[i]]++;
        in[t[i]]++; 
        d.join(s[i], t[i]);
    }
    vector<array<int, 3>> edg; 
    ll ans = 0;
    REPD(i, (int)vals.size() - 1){
        if(i == 0) continue;
        if(in[i] != out[i]){
            d.join(i, i - 1);
            if(in[i] > out[i]){
                in[i - 1] += (in[i] - out[i]);
                ans += (ll)(in[i] - out[i]) * (vals[i] - vals[i-1]);
            }
            else{
                out[i - 1] += (out[i] - in[i]); 
            }
        }
        else{
            edg.pb({vals[i] - vals[i-1], i, i -1}); 
        }
    }
    sort(all(edg));
    for(auto e : edg){
        if(!d.sameSet(e[1], e[2])){
            d.join(e[1], e[2]);
            ans += e[0];
        }    
    }
    return ans; 
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 14664 KB n = 199999
2 Correct 203 ms 14664 KB n = 199991
3 Correct 204 ms 14792 KB n = 199993
4 Correct 136 ms 11072 KB n = 152076
5 Correct 90 ms 7048 KB n = 93249
6 Correct 175 ms 13640 KB n = 199910
7 Correct 177 ms 13896 KB n = 199999
8 Correct 173 ms 13512 KB n = 199997
9 Correct 174 ms 12652 KB n = 171294
10 Correct 138 ms 9756 KB n = 140872
11 Correct 192 ms 13512 KB n = 199886
12 Correct 185 ms 14024 KB n = 199996
13 Correct 192 ms 13640 KB n = 200000
14 Correct 214 ms 17480 KB n = 199998
15 Correct 206 ms 17352 KB n = 200000
16 Correct 225 ms 17716 KB n = 199998
17 Correct 188 ms 14664 KB n = 200000
18 Correct 182 ms 13944 KB n = 190000
19 Correct 163 ms 13168 KB n = 177777
20 Correct 93 ms 7512 KB n = 100000
21 Correct 211 ms 14664 KB n = 200000
22 Correct 228 ms 18248 KB n = 200000
23 Correct 251 ms 18288 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 364 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 364 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 1 ms 380 KB n = 15
37 Correct 1 ms 364 KB n = 8
38 Correct 1 ms 384 KB n = 16
39 Correct 1 ms 364 KB n = 16
40 Correct 1 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 1 ms 236 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 1 ms 364 KB n = 16
47 Correct 1 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16
49 Correct 190 ms 14664 KB n = 199999
50 Correct 203 ms 14664 KB n = 199991
51 Correct 204 ms 14792 KB n = 199993
52 Correct 136 ms 11072 KB n = 152076
53 Correct 90 ms 7048 KB n = 93249
54 Correct 175 ms 13640 KB n = 199910
55 Correct 177 ms 13896 KB n = 199999
56 Correct 173 ms 13512 KB n = 199997
57 Correct 174 ms 12652 KB n = 171294
58 Correct 138 ms 9756 KB n = 140872
59 Correct 192 ms 13512 KB n = 199886
60 Correct 185 ms 14024 KB n = 199996
61 Correct 192 ms 13640 KB n = 200000
62 Correct 214 ms 17480 KB n = 199998
63 Correct 206 ms 17352 KB n = 200000
64 Correct 225 ms 17716 KB n = 199998
65 Correct 188 ms 14664 KB n = 200000
66 Correct 182 ms 13944 KB n = 190000
67 Correct 163 ms 13168 KB n = 177777
68 Correct 93 ms 7512 KB n = 100000
69 Correct 211 ms 14664 KB n = 200000
70 Correct 228 ms 18248 KB n = 200000
71 Correct 251 ms 18288 KB n = 200000
72 Correct 193 ms 14600 KB n = 200000
73 Correct 206 ms 14664 KB n = 200000
74 Correct 212 ms 14712 KB n = 200000
75 Correct 187 ms 14600 KB n = 200000
76 Correct 183 ms 14684 KB n = 200000
77 Correct 161 ms 14792 KB n = 200000
78 Correct 197 ms 18248 KB n = 200000
79 Correct 226 ms 13404 KB n = 184307
80 Correct 66 ms 5524 KB n = 76040
81 Correct 184 ms 13512 KB n = 199981
82 Correct 180 ms 14024 KB n = 199994
83 Correct 172 ms 13640 KB n = 199996
84 Correct 199 ms 17480 KB n = 199998
85 Correct 199 ms 17352 KB n = 200000
86 Correct 213 ms 17992 KB n = 199998
87 Correct 192 ms 14664 KB n = 200000
88 Correct 189 ms 14664 KB n = 200000
89 Correct 182 ms 14664 KB n = 200000
90 Correct 188 ms 14600 KB n = 200000
91 Correct 227 ms 18376 KB n = 200000
92 Correct 233 ms 18376 KB n = 200000