oj.uz

답안 #485398

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
485398 2021-11-07T15:57:27 Z couplefire Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 611 ms 40848 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second

const int N = 400100;

int n, m, val[N], fa[N];
map<int, int> coords;
vector<int> good;
vector<pair<int, pair<int, int>>> edges;

int find(int v){return v==fa[v]?v:fa[v]=find(fa[v]);}

void unite(int u, int v){
    u = find(u), v = find(v);
    if(u==v) return;
    fa[u] = v;
}

ll plan_roller_coaster(vector<int> _s, vector<int> _t){
    _s.push_back(1e9);
    _t.push_back(1);
    n = _s.size();
    for(int i = 0; i<n; ++i)
        good.push_back(_s[i]), good.push_back(_t[i]);
    sort(good.begin(), good.end());
    good.erase(unique(good.begin(), good.end()), good.end());
    m = good.size();
    iota(fa, fa+N, 0);
    for(int i = 0; i<m; ++i)
        coords[good[i]] = i;
    for(int i = 0; i<n; ++i)
        ++val[coords[_s[i]]], --val[coords[_t[i]]], unite(coords[_s[i]], coords[_t[i]]);
    int curcnt = 0; ll ans = 0;
    for(int i = 0; i<m-1; ++i){
        curcnt += val[i];
        if(curcnt>0) ans += 1ll*curcnt*(good[i+1]-good[i]), unite(i, i+1);
        else if(curcnt<0) unite(i, i+1);
        val[i] -= curcnt, val[i+1] += curcnt;
        curcnt = 0;
    }
    for(int i = 0; i<m-1; ++i)
        edges.push_back({good[i+1]-good[i], {i, i+1}});
    sort(edges.begin(), edges.end());
    for(auto e : edges)
        if(find(e.s.f)!=find(e.s.s))
            ans += e.f, unite(e.s.f, e.s.s);
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1868 KB n = 2
2 Correct 1 ms 1836 KB n = 2
3 Correct 1 ms 1840 KB n = 2
4 Correct 1 ms 1868 KB n = 2
5 Correct 1 ms 1868 KB n = 2
6 Correct 2 ms 1840 KB n = 2
7 Correct 1 ms 1868 KB n = 3
8 Correct 1 ms 1840 KB n = 3
9 Correct 1 ms 1868 KB n = 3
10 Correct 1 ms 1868 KB n = 8
11 Correct 2 ms 1868 KB n = 8
12 Correct 1 ms 1868 KB n = 8
13 Correct 1 ms 1868 KB n = 8
14 Correct 1 ms 1868 KB n = 8
15 Correct 2 ms 1832 KB n = 8
16 Correct 2 ms 1840 KB n = 8
17 Correct 1 ms 1868 KB n = 8
18 Correct 2 ms 1868 KB n = 8
19 Correct 1 ms 1868 KB n = 3
20 Correct 1 ms 1868 KB n = 7
21 Correct 1 ms 1868 KB n = 8
22 Correct 2 ms 1868 KB n = 8
23 Correct 1 ms 1868 KB n = 8
24 Correct 1 ms 1868 KB n = 8
25 Correct 1 ms 1868 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1868 KB n = 2
2 Correct 1 ms 1836 KB n = 2
3 Correct 1 ms 1840 KB n = 2
4 Correct 1 ms 1868 KB n = 2
5 Correct 1 ms 1868 KB n = 2
6 Correct 2 ms 1840 KB n = 2
7 Correct 1 ms 1868 KB n = 3
8 Correct 1 ms 1840 KB n = 3
9 Correct 1 ms 1868 KB n = 3
10 Correct 1 ms 1868 KB n = 8
11 Correct 2 ms 1868 KB n = 8
12 Correct 1 ms 1868 KB n = 8
13 Correct 1 ms 1868 KB n = 8
14 Correct 1 ms 1868 KB n = 8
15 Correct 2 ms 1832 KB n = 8
16 Correct 2 ms 1840 KB n = 8
17 Correct 1 ms 1868 KB n = 8
18 Correct 2 ms 1868 KB n = 8
19 Correct 1 ms 1868 KB n = 3
20 Correct 1 ms 1868 KB n = 7
21 Correct 1 ms 1868 KB n = 8
22 Correct 2 ms 1868 KB n = 8
23 Correct 1 ms 1868 KB n = 8
24 Correct 1 ms 1868 KB n = 8
25 Correct 1 ms 1868 KB n = 8
26 Correct 1 ms 1868 KB n = 8
27 Correct 1 ms 1868 KB n = 8
28 Correct 1 ms 1836 KB n = 8
29 Correct 2 ms 1868 KB n = 16
30 Correct 2 ms 1868 KB n = 16
31 Correct 1 ms 1868 KB n = 16
32 Correct 1 ms 1868 KB n = 16
33 Correct 1 ms 1868 KB n = 16
34 Correct 1 ms 1868 KB n = 16
35 Correct 1 ms 1868 KB n = 16
36 Correct 1 ms 1868 KB n = 15
37 Correct 1 ms 1868 KB n = 8
38 Correct 1 ms 1868 KB n = 16
39 Correct 2 ms 1868 KB n = 16
40 Correct 1 ms 1868 KB n = 9
41 Correct 1 ms 1868 KB n = 16
42 Correct 1 ms 1868 KB n = 16
43 Correct 1 ms 1856 KB n = 16
44 Correct 1 ms 1868 KB n = 9
45 Correct 1 ms 1868 KB n = 15
46 Correct 1 ms 1868 KB n = 16
47 Correct 2 ms 1868 KB n = 16
48 Correct 1 ms 1868 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 593 ms 38564 KB n = 199999
2 Correct 611 ms 38460 KB n = 199991
3 Correct 562 ms 38428 KB n = 199993
4 Correct 401 ms 31204 KB n = 152076
5 Correct 204 ms 19184 KB n = 93249
6 Correct 478 ms 33620 KB n = 199910
7 Correct 494 ms 37676 KB n = 199999
8 Correct 417 ms 34048 KB n = 199997
9 Correct 436 ms 34148 KB n = 171294
10 Correct 347 ms 29816 KB n = 140872
11 Correct 445 ms 33940 KB n = 199886
12 Correct 487 ms 37860 KB n = 199996
13 Correct 444 ms 35036 KB n = 200000
14 Correct 448 ms 38668 KB n = 199998
15 Correct 482 ms 37788 KB n = 200000
16 Correct 472 ms 38676 KB n = 199998
17 Correct 597 ms 40824 KB n = 200000
18 Correct 522 ms 37148 KB n = 190000
19 Correct 494 ms 37276 KB n = 177777
20 Correct 235 ms 20192 KB n = 100000
21 Correct 538 ms 38492 KB n = 200000
22 Correct 566 ms 38476 KB n = 200000
23 Correct 528 ms 38428 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1868 KB n = 2
2 Correct 1 ms 1836 KB n = 2
3 Correct 1 ms 1840 KB n = 2
4 Correct 1 ms 1868 KB n = 2
5 Correct 1 ms 1868 KB n = 2
6 Correct 2 ms 1840 KB n = 2
7 Correct 1 ms 1868 KB n = 3
8 Correct 1 ms 1840 KB n = 3
9 Correct 1 ms 1868 KB n = 3
10 Correct 1 ms 1868 KB n = 8
11 Correct 2 ms 1868 KB n = 8
12 Correct 1 ms 1868 KB n = 8
13 Correct 1 ms 1868 KB n = 8
14 Correct 1 ms 1868 KB n = 8
15 Correct 2 ms 1832 KB n = 8
16 Correct 2 ms 1840 KB n = 8
17 Correct 1 ms 1868 KB n = 8
18 Correct 2 ms 1868 KB n = 8
19 Correct 1 ms 1868 KB n = 3
20 Correct 1 ms 1868 KB n = 7
21 Correct 1 ms 1868 KB n = 8
22 Correct 2 ms 1868 KB n = 8
23 Correct 1 ms 1868 KB n = 8
24 Correct 1 ms 1868 KB n = 8
25 Correct 1 ms 1868 KB n = 8
26 Correct 1 ms 1868 KB n = 8
27 Correct 1 ms 1868 KB n = 8
28 Correct 1 ms 1836 KB n = 8
29 Correct 2 ms 1868 KB n = 16
30 Correct 2 ms 1868 KB n = 16
31 Correct 1 ms 1868 KB n = 16
32 Correct 1 ms 1868 KB n = 16
33 Correct 1 ms 1868 KB n = 16
34 Correct 1 ms 1868 KB n = 16
35 Correct 1 ms 1868 KB n = 16
36 Correct 1 ms 1868 KB n = 15
37 Correct 1 ms 1868 KB n = 8
38 Correct 1 ms 1868 KB n = 16
39 Correct 2 ms 1868 KB n = 16
40 Correct 1 ms 1868 KB n = 9
41 Correct 1 ms 1868 KB n = 16
42 Correct 1 ms 1868 KB n = 16
43 Correct 1 ms 1856 KB n = 16
44 Correct 1 ms 1868 KB n = 9
45 Correct 1 ms 1868 KB n = 15
46 Correct 1 ms 1868 KB n = 16
47 Correct 2 ms 1868 KB n = 16
48 Correct 1 ms 1868 KB n = 16
49 Correct 593 ms 38564 KB n = 199999
50 Correct 611 ms 38460 KB n = 199991
51 Correct 562 ms 38428 KB n = 199993
52 Correct 401 ms 31204 KB n = 152076
53 Correct 204 ms 19184 KB n = 93249
54 Correct 478 ms 33620 KB n = 199910
55 Correct 494 ms 37676 KB n = 199999
56 Correct 417 ms 34048 KB n = 199997
57 Correct 436 ms 34148 KB n = 171294
58 Correct 347 ms 29816 KB n = 140872
59 Correct 445 ms 33940 KB n = 199886
60 Correct 487 ms 37860 KB n = 199996
61 Correct 444 ms 35036 KB n = 200000
62 Correct 448 ms 38668 KB n = 199998
63 Correct 482 ms 37788 KB n = 200000
64 Correct 472 ms 38676 KB n = 199998
65 Correct 597 ms 40824 KB n = 200000
66 Correct 522 ms 37148 KB n = 190000
67 Correct 494 ms 37276 KB n = 177777
68 Correct 235 ms 20192 KB n = 100000
69 Correct 538 ms 38492 KB n = 200000
70 Correct 566 ms 38476 KB n = 200000
71 Correct 528 ms 38428 KB n = 200000
72 Correct 537 ms 38464 KB n = 200000
73 Correct 549 ms 38480 KB n = 200000
74 Correct 588 ms 38556 KB n = 200000
75 Correct 554 ms 38368 KB n = 200000
76 Correct 540 ms 38460 KB n = 200000
77 Correct 294 ms 27512 KB n = 200000
78 Correct 322 ms 25228 KB n = 200000
79 Correct 491 ms 35992 KB n = 184307
80 Correct 179 ms 16736 KB n = 76040
81 Correct 494 ms 33932 KB n = 199981
82 Correct 529 ms 38048 KB n = 199994
83 Correct 451 ms 35104 KB n = 199996
84 Correct 460 ms 38552 KB n = 199998
85 Correct 437 ms 37772 KB n = 200000
86 Correct 516 ms 38668 KB n = 199998
87 Correct 508 ms 40840 KB n = 200000
88 Correct 496 ms 38944 KB n = 200000
89 Correct 529 ms 40848 KB n = 200000
90 Correct 500 ms 38556 KB n = 200000
91 Correct 479 ms 38424 KB n = 200000
92 Correct 518 ms 38540 KB n = 200000