oj.uz

답안 #98963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98963 2019-02-27T19:06:23 Z eriksuenderhauf Roller Coaster Railroad (IOI16_railroad) C++11
100 / 100
 270 ms 16488 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
//#include "railroad.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
int par[MAXN], deg[MAXN];

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

void join(int x, int y) {
    x = qry(x), y = qry(y);
    par[x] = y;
}

ll plan_roller_coaster(vi s, vi t) {
    int n = s.size();
    vi tmp;
    for (int i = 0; i < 2 * n; i++) {
        par[i] = i;
        if (i < n)
            tmp.pb(s[i]), tmp.pb(t[i]);
    }
    sort(tmp.begin(), tmp.end());
    tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
    for (int i = 0; i < n; i++) {
        s[i] = lower_bound(tmp.begin(), tmp.end(), s[i]) - tmp.begin();
        t[i] = lower_bound(tmp.begin(), tmp.end(), t[i]) - tmp.begin();
        deg[s[i]]++;
        deg[t[i]]--;
        join(s[i], t[i]);
    }
    ll ans = 0;
    int cur = 1;
    vector<pair<ll,pii>> edg;
    for (int i = tmp.size() - 1; i > 0; i--) {
        cur += deg[i];
        if (cur < 0) { // need to accelerate, go |cur| times this way
            ans += 1ll * cur * (tmp[i - 1] - tmp[i]);
            deg[i - 1] += cur;
            join(i, i - 1);
            cur = 0;
        } else if (cur > 0)
            join(i, i - 1); // slowed down/accelerated in coaster
        else if (cur == 0)
            edg.pb({tmp[i] - tmp[i - 1], {i, i - 1}});
    }
    sort(edg.begin(), edg.end());
    for (pair<ll,pii> nx: edg) {
        int u, v;
        tie(u, v) = nx.se;
        if (qry(u) == qry(v))
            continue;
        join(u, v);
        ans += nx.fi;
    }
    return ans;
}

/*
add edges from s to t + dummy edge from inf to 1 (-> start at 1 and at 1)
cur = edges to the left - edges to the right (calc with pref. sums over degrees)
cur = 0 (-> comps may be separated, add edge to the next unprocessed edge)
cur > 0 do nothing ("acceleration" is for free, you just have to be slower!)
        -> edges from left to right can be added (go over node i) -> join left with cur
        comp is "complete", you can enter at the beginning, visit all nodes and come back (dummy node)
        solve for left + go for free from left to cur <-> join left and cur
cur < 0 you go more often to the right than you slow down/you are faster than allowed
        add edges from the right to the left (slow down) cur has to be zero -> add |cur|
        edges with length X(i)-X(i-1), cur and left are now connected
connect all components
*/

/*int main()
{
    cerr << plan_roller_coaster({1},{2}) << "\n";
    return 0;
}*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB n = 2
2 Correct 2 ms 384 KB n = 2
3 Correct 2 ms 384 KB n = 2
4 Correct 2 ms 384 KB n = 2
5 Correct 3 ms 512 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 384 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 3 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 3 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 404 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 256 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 3 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB n = 2
2 Correct 2 ms 384 KB n = 2
3 Correct 2 ms 384 KB n = 2
4 Correct 2 ms 384 KB n = 2
5 Correct 3 ms 512 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 384 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 3 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 3 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 404 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 256 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 3 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 3 ms 384 KB n = 8
27 Correct 2 ms 384 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 3 ms 256 KB n = 16
33 Correct 2 ms 384 KB n = 16
34 Correct 3 ms 384 KB n = 16
35 Correct 2 ms 384 KB n = 16
36 Correct 3 ms 384 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 3 ms 384 KB n = 16
39 Correct 2 ms 384 KB n = 16
40 Correct 2 ms 384 KB n = 9
41 Correct 3 ms 384 KB n = 16
42 Correct 3 ms 384 KB n = 16
43 Correct 2 ms 384 KB n = 16
44 Correct 3 ms 384 KB n = 9
45 Correct 2 ms 384 KB n = 15
46 Correct 2 ms 384 KB n = 16
47 Correct 2 ms 384 KB n = 16
48 Correct 2 ms 384 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 12264 KB n = 199999
2 Correct 213 ms 12240 KB n = 199991
3 Correct 212 ms 12264 KB n = 199993
4 Correct 154 ms 9112 KB n = 152076
5 Correct 95 ms 5996 KB n = 93249
6 Correct 193 ms 10824 KB n = 199910
7 Correct 184 ms 11496 KB n = 199999
8 Correct 173 ms 10880 KB n = 199997
9 Correct 198 ms 10456 KB n = 171294
10 Correct 160 ms 8808 KB n = 140872
11 Correct 187 ms 10800 KB n = 199886
12 Correct 223 ms 12264 KB n = 199996
13 Correct 218 ms 11624 KB n = 200000
14 Correct 194 ms 15544 KB n = 199998
15 Correct 267 ms 15336 KB n = 200000
16 Correct 201 ms 15976 KB n = 199998
17 Correct 180 ms 15360 KB n = 200000
18 Correct 184 ms 11980 KB n = 190000
19 Correct 172 ms 13672 KB n = 177777
20 Correct 88 ms 6500 KB n = 100000
21 Correct 201 ms 12176 KB n = 200000
22 Correct 231 ms 16488 KB n = 200000
23 Correct 236 ms 16384 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB n = 2
2 Correct 2 ms 384 KB n = 2
3 Correct 2 ms 384 KB n = 2
4 Correct 2 ms 384 KB n = 2
5 Correct 3 ms 512 KB n = 2
6 Correct 2 ms 384 KB n = 2
7 Correct 2 ms 384 KB n = 3
8 Correct 2 ms 384 KB n = 3
9 Correct 3 ms 384 KB n = 3
10 Correct 2 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 3 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 404 KB n = 8
19 Correct 2 ms 384 KB n = 3
20 Correct 3 ms 384 KB n = 7
21 Correct 2 ms 384 KB n = 8
22 Correct 2 ms 256 KB n = 8
23 Correct 2 ms 384 KB n = 8
24 Correct 3 ms 384 KB n = 8
25 Correct 2 ms 384 KB n = 8
26 Correct 3 ms 384 KB n = 8
27 Correct 2 ms 384 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 3 ms 256 KB n = 16
33 Correct 2 ms 384 KB n = 16
34 Correct 3 ms 384 KB n = 16
35 Correct 2 ms 384 KB n = 16
36 Correct 3 ms 384 KB n = 15
37 Correct 2 ms 384 KB n = 8
38 Correct 3 ms 384 KB n = 16
39 Correct 2 ms 384 KB n = 16
40 Correct 2 ms 384 KB n = 9
41 Correct 3 ms 384 KB n = 16
42 Correct 3 ms 384 KB n = 16
43 Correct 2 ms 384 KB n = 16
44 Correct 3 ms 384 KB n = 9
45 Correct 2 ms 384 KB n = 15
46 Correct 2 ms 384 KB n = 16
47 Correct 2 ms 384 KB n = 16
48 Correct 2 ms 384 KB n = 16
49 Correct 226 ms 12264 KB n = 199999
50 Correct 213 ms 12240 KB n = 199991
51 Correct 212 ms 12264 KB n = 199993
52 Correct 154 ms 9112 KB n = 152076
53 Correct 95 ms 5996 KB n = 93249
54 Correct 193 ms 10824 KB n = 199910
55 Correct 184 ms 11496 KB n = 199999
56 Correct 173 ms 10880 KB n = 199997
57 Correct 198 ms 10456 KB n = 171294
58 Correct 160 ms 8808 KB n = 140872
59 Correct 187 ms 10800 KB n = 199886
60 Correct 223 ms 12264 KB n = 199996
61 Correct 218 ms 11624 KB n = 200000
62 Correct 194 ms 15544 KB n = 199998
63 Correct 267 ms 15336 KB n = 200000
64 Correct 201 ms 15976 KB n = 199998
65 Correct 180 ms 15360 KB n = 200000
66 Correct 184 ms 11980 KB n = 190000
67 Correct 172 ms 13672 KB n = 177777
68 Correct 88 ms 6500 KB n = 100000
69 Correct 201 ms 12176 KB n = 200000
70 Correct 231 ms 16488 KB n = 200000
71 Correct 236 ms 16384 KB n = 200000
72 Correct 217 ms 12172 KB n = 200000
73 Correct 216 ms 12264 KB n = 200000
74 Correct 201 ms 12136 KB n = 200000
75 Correct 191 ms 12136 KB n = 200000
76 Correct 199 ms 12172 KB n = 200000
77 Correct 167 ms 11368 KB n = 200000
78 Correct 188 ms 15564 KB n = 200000
79 Correct 221 ms 11088 KB n = 184307
80 Correct 68 ms 4972 KB n = 76040
81 Correct 164 ms 10856 KB n = 199981
82 Correct 182 ms 12264 KB n = 199994
83 Correct 174 ms 11620 KB n = 199996
84 Correct 193 ms 15484 KB n = 199998
85 Correct 186 ms 15464 KB n = 200000
86 Correct 270 ms 15976 KB n = 199998
87 Correct 199 ms 15280 KB n = 200000
88 Correct 220 ms 12800 KB n = 200000
89 Correct 180 ms 15292 KB n = 200000
90 Correct 189 ms 12140 KB n = 200000
91 Correct 236 ms 16232 KB n = 200000
92 Correct 227 ms 16416 KB n = 200000