oj.uz

답안 #602534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602534 2022-07-23T07:39:24 Z MadokaMagicaFan Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 414 ms 20864 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
const ll inf = 1e9+5;
const int md1 = 1e9+7;
const int md2 = 998244353;
using vi = vector<int>;
using ai = array<int, 2>;

#define sz(v)                       ((int)v.size())
#define pb                          push_back

#define pry                         cout << "YES\n"
#define prn                         cout << "NO\n"
#define endl                        '\n'

#define fst                         first
#define scn                         second
/* #define ONPC */

const int N = 2e5+5;
int p[N<<1];

int
lb(int x, vi& v)
{
    int l = 0, r = sz(v);
    int mid;

    while (l < r) {
        mid = (l+r)>>1;
        if (v[mid] > x)
            r = mid;
        else
            l = mid+1;
    }
    return l-1;
}

int
getp(int x)
{
    return p[x] = (x == p[x]) ? x : getp(p[x]);
}

ll
uni(int a, int b)
{
    a = getp(a);
    b = getp(b);

    p[a] = b;
    return (a!=b);
}

ll
plan_roller_coaster(vi s, vi t)
{
    int n = sz(s);
    vi nm;

    for (int i = 0; i < n; ++i) nm.pb(s[i]);
    for (int i = 0; i < n; ++i) nm.pb(t[i]);

    nm.pb(0);
    nm.pb(inf);
    sort(nm.begin(), nm.end());
    nm.resize(distance(nm.begin(), unique(nm.begin(), nm.end())));

    vi qin, qot;

    int pin, pot;
    pin = pot = 0;


    for (int i = 0; i < sz(nm); ++i) p[i] = i;

    for (int i = 0; i < n; ++i) {
        qin.pb(lb(s[i],nm));
        qot.pb(lb(t[i],nm));
        uni(lb(s[i], nm), lb(t[i], nm));
    }
    uni(0, sz(nm)-1);

    /* for (int i = 0; i < 20; ++i) { */
    /*     cout << i << ": " << lb(i, nm) << endl; */
    /* } */

    qot.pb(0);

    sort(qin.begin(), qin.end());
    sort(qot.begin(), qot.end());

    ll ans = 0;

    for (int i = 0; i < sz(nm)-1; ++i) {
        while (pin < sz(qin)) {
            if (qin[pin] > i) break;
            ++pin;
        }
        while (pot < sz(qot)) {
            if (qot[pot] > i) break;
            ++pot;
        }

        if (pot < pin) {
            ans += ((ll) pin-pot) * ((ll) (nm[i+1]-nm[i]));
            uni(i,i+1);
        } else if (pot > pin) {
            uni(i,i+1);
        }
    }

    vector<ai> edg;

    for (int i = 0; i < sz(nm)-1; ++i)
        edg.pb({nm[i+1]-nm[i], i});

    sort(edg.begin(), edg.end());

    for (int i = 0; i < sz(edg); ++i) {
        ans += uni(edg[i][1], edg[i][1]+1) * ((ll)edg[i][0]);
    }

    return ans;
}

#ifdef ONPC
void
solve()
{
    int n;
    cin >> n;

    vi t(n), s(n);

    for (int i = 0; i < n; ++i) cin >> s[i];
    for (int i = 0; i < n; ++i) cin >> t[i];

    cout << plan_roller_coaster(s,t) << endl;
}

int32_t
main(int argc, char **argv)
{
    if (argc >= 2) {
        freopen(argv[1], "r", stdin);
    } else
        ios_base::sync_with_stdio(0);cin.tie(0);
    int t = 1;
    /* cin >> t; */
    while(t--)
        solve();
}
#endif

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 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 212 KB n = 2
7 Correct 1 ms 308 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 312 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 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 1 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 308 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 2 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 308 KB n = 8
25 Correct 1 ms 316 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 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 212 KB n = 2
7 Correct 1 ms 308 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 312 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 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 1 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 308 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 2 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 308 KB n = 8
25 Correct 1 ms 316 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 308 KB n = 16
31 Correct 1 ms 312 KB n = 16
32 Correct 1 ms 312 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 244 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 308 KB n = 16
42 Correct 1 ms 212 KB n = 16
43 Correct 1 ms 316 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 1 ms 316 KB n = 15
46 Correct 1 ms 312 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 1 ms 316 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 391 ms 14676 KB n = 199999
2 Correct 380 ms 14760 KB n = 199991
3 Correct 344 ms 14760 KB n = 199993
4 Correct 252 ms 12896 KB n = 152076
5 Correct 167 ms 7368 KB n = 93249
6 Correct 310 ms 14480 KB n = 199910
7 Correct 311 ms 14988 KB n = 199999
8 Correct 292 ms 14780 KB n = 199997
9 Correct 305 ms 13564 KB n = 171294
10 Correct 227 ms 12468 KB n = 140872
11 Correct 307 ms 14524 KB n = 199886
12 Correct 365 ms 18224 KB n = 199996
13 Correct 317 ms 17600 KB n = 200000
14 Correct 332 ms 18964 KB n = 199998
15 Correct 357 ms 18532 KB n = 200000
16 Correct 329 ms 18780 KB n = 199998
17 Correct 334 ms 20844 KB n = 200000
18 Correct 303 ms 18060 KB n = 190000
19 Correct 281 ms 19264 KB n = 177777
20 Correct 148 ms 9452 KB n = 100000
21 Correct 324 ms 18480 KB n = 200000
22 Correct 321 ms 18416 KB n = 200000
23 Correct 307 ms 18504 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 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 212 KB n = 2
7 Correct 1 ms 308 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 312 KB n = 8
12 Correct 1 ms 308 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 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 1 ms 212 KB n = 8
19 Correct 1 ms 212 KB n = 3
20 Correct 1 ms 308 KB n = 7
21 Correct 1 ms 212 KB n = 8
22 Correct 2 ms 212 KB n = 8
23 Correct 1 ms 212 KB n = 8
24 Correct 1 ms 308 KB n = 8
25 Correct 1 ms 316 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 1 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 308 KB n = 16
31 Correct 1 ms 312 KB n = 16
32 Correct 1 ms 312 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 212 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 244 KB n = 16
39 Correct 1 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 308 KB n = 16
42 Correct 1 ms 212 KB n = 16
43 Correct 1 ms 316 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 1 ms 316 KB n = 15
46 Correct 1 ms 312 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 1 ms 316 KB n = 16
49 Correct 391 ms 14676 KB n = 199999
50 Correct 380 ms 14760 KB n = 199991
51 Correct 344 ms 14760 KB n = 199993
52 Correct 252 ms 12896 KB n = 152076
53 Correct 167 ms 7368 KB n = 93249
54 Correct 310 ms 14480 KB n = 199910
55 Correct 311 ms 14988 KB n = 199999
56 Correct 292 ms 14780 KB n = 199997
57 Correct 305 ms 13564 KB n = 171294
58 Correct 227 ms 12468 KB n = 140872
59 Correct 307 ms 14524 KB n = 199886
60 Correct 365 ms 18224 KB n = 199996
61 Correct 317 ms 17600 KB n = 200000
62 Correct 332 ms 18964 KB n = 199998
63 Correct 357 ms 18532 KB n = 200000
64 Correct 329 ms 18780 KB n = 199998
65 Correct 334 ms 20844 KB n = 200000
66 Correct 303 ms 18060 KB n = 190000
67 Correct 281 ms 19264 KB n = 177777
68 Correct 148 ms 9452 KB n = 100000
69 Correct 324 ms 18480 KB n = 200000
70 Correct 321 ms 18416 KB n = 200000
71 Correct 307 ms 18504 KB n = 200000
72 Correct 323 ms 18528 KB n = 200000
73 Correct 414 ms 18428 KB n = 200000
74 Correct 362 ms 18508 KB n = 200000
75 Correct 334 ms 18436 KB n = 200000
76 Correct 323 ms 18488 KB n = 200000
77 Correct 282 ms 17516 KB n = 200000
78 Correct 251 ms 15168 KB n = 200000
79 Correct 282 ms 17520 KB n = 184307
80 Correct 115 ms 8056 KB n = 76040
81 Correct 294 ms 17132 KB n = 199981
82 Correct 295 ms 18288 KB n = 199994
83 Correct 303 ms 17620 KB n = 199996
84 Correct 300 ms 18960 KB n = 199998
85 Correct 287 ms 18452 KB n = 200000
86 Correct 368 ms 18796 KB n = 199998
87 Correct 300 ms 20808 KB n = 200000
88 Correct 326 ms 18988 KB n = 200000
89 Correct 281 ms 20864 KB n = 200000
90 Correct 318 ms 18516 KB n = 200000
91 Correct 302 ms 18508 KB n = 200000
92 Correct 299 ms 18444 KB n = 200000