oj.uz

답안 #805194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805194 2023-08-03T13:54:32 Z I_Love_EliskaM_ Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 836 ms 72980 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(), x.end()
using ll = long long;
#define pi pair<int,int>
#define f first
#define s second

struct DSU {
    vector<int> p,sz;
    DSU(int n) {
        forn(i,n) p.pb(i), sz.pb(1);
    }
    int get(int u) {
        return p[u]==u?u:get(p[u]);
    }
    void uni(int u, int v) {
        u=get(u),v=get(v);
        if (u==v) return;
        if (sz[u]<sz[v]) swap(u,v);
        sz[u]+=sz[v];
        p[v]=u;
    }
};

struct edge {
    int w, u, v;
};
bool foo(edge a, edge b) {
    return a.w<b.w;
}

ll plan_roller_coaster(vector<int> s, vector<int> t) {
    int n=s.size();

    int mx=0, mn=1e9+7; 
    for(auto&x:s) mx=max(mx,x), mn=min(mn,x);
    for(auto&x:t) mx=max(mx,x), mn=min(mn,x);
    s.pb(mx);
    t.pb(mn);
    ++n;

    int m=0;
    set<int> st; forn(i,n) st.insert(s[i]), st.insert(t[i]);
    map<int,int> c, d;
    for(auto&x:st) {
        d[m]=x;
        c[x]=m++;
    }

    vector<int> pr(m);
    forn(i,n) s[i]=c[s[i]], t[i]=c[t[i]];

    DSU dsu(m);
    forn(i,n) {
        pr[t[i]]++;
        pr[s[i]]--;
        dsu.uni(s[i],t[i]);
    }
    for(int i=1; i<m; ++i) pr[i]+=pr[i-1];

    ll ans=0;
    forn(i,m) {
        if (pr[i]<0) ans-=1ll*pr[i]*(d[i+1]-d[i]);
        if (pr[i]) dsu.uni(i,i+1);
    }
    vector<edge> e;
    forn(i,m-1) {
        if (dsu.get(i)!=dsu.get(i+1)) e.pb({d[i+1]-d[i],i,i+1});
    }
    sort(all(e),foo);
    for(auto&x:e) {
        if (dsu.get(x.u)==dsu.get(x.v)) continue;
        dsu.uni(x.u,x.v);
        ans+=x.w;
    }
    return ans;
}

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 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 300 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 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 300 KB n = 8
17 Correct 0 ms 300 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 304 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 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 300 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 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 300 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 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 300 KB n = 8
17 Correct 0 ms 300 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 304 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 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 300 KB n = 8
26 Correct 1 ms 296 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 296 KB n = 16
31 Correct 1 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 296 KB n = 16
35 Correct 1 ms 300 KB n = 16
36 Correct 1 ms 228 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 ms 300 KB n = 16
39 Correct 1 ms 300 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 1 ms 300 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 635 ms 69680 KB n = 199999
2 Correct 836 ms 69716 KB n = 199991
3 Correct 782 ms 69680 KB n = 199993
4 Correct 486 ms 52432 KB n = 152076
5 Correct 224 ms 32864 KB n = 93249
6 Correct 533 ms 57884 KB n = 199910
7 Correct 611 ms 67556 KB n = 199999
8 Correct 462 ms 58388 KB n = 199997
9 Correct 590 ms 58828 KB n = 171294
10 Correct 369 ms 49200 KB n = 140872
11 Correct 465 ms 58784 KB n = 199886
12 Correct 559 ms 68128 KB n = 199996
13 Correct 519 ms 60600 KB n = 200000
14 Correct 541 ms 67628 KB n = 199998
15 Correct 580 ms 66680 KB n = 200000
16 Correct 540 ms 69000 KB n = 199998
17 Correct 680 ms 69664 KB n = 200000
18 Correct 611 ms 65096 KB n = 190000
19 Correct 508 ms 61116 KB n = 177777
20 Correct 219 ms 35184 KB n = 100000
21 Correct 603 ms 69652 KB n = 200000
22 Correct 694 ms 72980 KB n = 200000
23 Correct 720 ms 69808 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 1 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 0 ms 212 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 212 KB n = 3
10 Correct 0 ms 300 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 1 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 300 KB n = 8
17 Correct 0 ms 300 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 304 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 212 KB n = 8
24 Correct 0 ms 212 KB n = 8
25 Correct 1 ms 300 KB n = 8
26 Correct 1 ms 296 KB n = 8
27 Correct 1 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 296 KB n = 16
31 Correct 1 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 1 ms 296 KB n = 16
35 Correct 1 ms 300 KB n = 16
36 Correct 1 ms 228 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 ms 300 KB n = 16
39 Correct 1 ms 300 KB n = 16
40 Correct 0 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 212 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 1 ms 300 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 635 ms 69680 KB n = 199999
50 Correct 836 ms 69716 KB n = 199991
51 Correct 782 ms 69680 KB n = 199993
52 Correct 486 ms 52432 KB n = 152076
53 Correct 224 ms 32864 KB n = 93249
54 Correct 533 ms 57884 KB n = 199910
55 Correct 611 ms 67556 KB n = 199999
56 Correct 462 ms 58388 KB n = 199997
57 Correct 590 ms 58828 KB n = 171294
58 Correct 369 ms 49200 KB n = 140872
59 Correct 465 ms 58784 KB n = 199886
60 Correct 559 ms 68128 KB n = 199996
61 Correct 519 ms 60600 KB n = 200000
62 Correct 541 ms 67628 KB n = 199998
63 Correct 580 ms 66680 KB n = 200000
64 Correct 540 ms 69000 KB n = 199998
65 Correct 680 ms 69664 KB n = 200000
66 Correct 611 ms 65096 KB n = 190000
67 Correct 508 ms 61116 KB n = 177777
68 Correct 219 ms 35184 KB n = 100000
69 Correct 603 ms 69652 KB n = 200000
70 Correct 694 ms 72980 KB n = 200000
71 Correct 720 ms 69808 KB n = 200000
72 Correct 676 ms 69684 KB n = 200000
73 Correct 678 ms 69664 KB n = 200000
74 Correct 788 ms 69732 KB n = 200000
75 Correct 717 ms 69700 KB n = 200000
76 Correct 591 ms 69696 KB n = 200000
77 Correct 306 ms 39092 KB n = 200000
78 Correct 346 ms 41024 KB n = 200000
79 Correct 604 ms 63020 KB n = 184307
80 Correct 158 ms 26940 KB n = 76040
81 Correct 545 ms 58944 KB n = 199981
82 Correct 543 ms 68012 KB n = 199994
83 Correct 500 ms 60644 KB n = 199996
84 Correct 532 ms 67572 KB n = 199998
85 Correct 555 ms 66612 KB n = 200000
86 Correct 567 ms 68992 KB n = 199998
87 Correct 653 ms 69624 KB n = 200000
88 Correct 670 ms 69732 KB n = 200000
89 Correct 657 ms 69696 KB n = 200000
90 Correct 579 ms 69700 KB n = 200000
91 Correct 699 ms 72944 KB n = 200000
92 Correct 703 ms 69700 KB n = 200000