oj.uz

답안 #319974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319974 2020-11-07T04:09:42 Z arujbansal 자매 도시 (APIO20_swap) C++17
13 / 100
 602 ms 32112 KB 
    #include "swap.h"
    #include <bits/stdc++.h>
     
    #define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
    #define setIO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
    #define pb push_back
    #define eb emplace_back
    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define sz(x) (int) (x).size()
    #define lc(i) 2*i
    #define rc(i) 2*i+1
    //#define int long long
    using namespace std;
    using ll = long long;
    using ii = pair<int, int>;
    using vii = vector<ii>;
    using vi = vector<int>;
    using vvi = vector<vi>;
    using vb = vector<bool>;
    using vvb = vector<vb>;
     
    const int MAXN = 1e5 + 20, MOD = 1e9 + 7, INF = 1e9;
     
    struct Edge {
        int u, v, w;
     
        bool operator<(const Edge &other) {
            return w < other.w;
        }
    };
     
    struct DSU {
        int n;
        vi par, s, deg, mxDeg, timeValid;
        vii root[MAXN];
        vi g[MAXN];
     
        void init(int n) {
            this->n = n;
            par.resize(n);
            iota(all(par), 0);
            s.assign(n, 1);
            deg.assign(n, 0);
            mxDeg.assign(n, 0);
            timeValid.assign(n, INF);
     
            for (int i = 0; i < n; i++)
                root[i].eb(0, i);
        }
     
        int get(int x) {
            return par[x];
        }
     
        void mark(int x, int newPar, int time) {
            if (par[x] == newPar) return;
     
            par[x] = newPar;
            root[x].eb(time, newPar);
     
            for (const auto &v : g[x]) mark(v, newPar, time);
        }
     
        void unite(int u, int v, int time) {
            g[u].pb(v);
            g[v].pb(u);
            
            deg[u]++;
            deg[v]++;
     
            int x = get(u);
            int y = get(v);
     
            if (deg[u] >= 3) timeValid[x] = min(timeValid[x], time);
            if (deg[v] >= 3) timeValid[y] = min(timeValid[y], time);
     
            if (x == y) {
                timeValid[x] = min(timeValid[x], time);
                return;
            }
     
            if (s[x] > s[y]) {
                swap(x, y);
                swap(u, v);
            }
     
            s[y] += s[x];
            timeValid[y] = min(timeValid[y], timeValid[x]);
          	mark(par[x], y, time);
        }
     
        bool query(int u, int v, int time) {
            time++;
     
            auto x = upper_bound(all(root[u]), ii(time, INF));
            auto y = upper_bound(all(root[v]), ii(time, INF));
            x--, y--;
     
            ii rootU = *x;
            ii rootV = *y;
     
            if (rootU.second == rootV.second)
                return timeValid[rootU.second] <= time;
     
            return false;
        }
    };
     
    DSU graph;
    vector<Edge> edges;
    int n, m;
     
    void init(int N, int M, vi U, vi V, vi W) {
        n = N;
        m = M;
     
        edges.resize(M);
     
        for (int i = 0; i < M; i++) {
            edges[i].u = U[i];
            edges[i].v = V[i];
            edges[i].w = W[i];
        }
     
        sort(all(edges));
     
        graph.init(N);
     
        for (int i = 0; i < M; i++)
            graph.unite(edges[i].u, edges[i].v, i + 1);
    }
     
    int getMinimumFuelCapacity(int X, int Y) {
        int lo = 0, hi = m - 1;
        int ans = INF;
     
        while (lo <= hi) {
            int mid = (lo + hi) >> 1;
            if (graph.query(X, Y, mid)) {
                ans = min(ans, edges[mid].w);
                hi = mid - 1;
            } else lo = mid + 1;
        }
     
        return ans < INF ? ans : -1;
    }
     
    //signed main() {
    //    FAST_IO;
    //#ifdef arujbansal_local
    //    setIO("input.txt", "output.txt");
    //#endif
    //
    //    int a, b;
    //    cin >> a >> b;
    //    int u[b], v[b], wt[b];
    //
    //    for (int i = 0; i < b; i++)
    //        cin >> u[i] >> v[i] >> wt[i];
    //
    //    init(a, b, u, v, wt);
    //
    //    int q;
    //    cin >> q;
    //    while (q--) {
    //        int x, y;
    //        cin >> x >> y;
    //        cout << getMinimumFuelCapacity(x, y) << "\n";
    //    }
    //
    ////    for (const auto &[time, root] : graph.root[4])
    ////        cout << time << " " << root << "\n";
    //}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5228 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 255 ms 22648 KB Output is correct
10 Correct 331 ms 25700 KB Output is correct
11 Correct 333 ms 25848 KB Output is correct
12 Correct 352 ms 26864 KB Output is correct
13 Correct 144 ms 22800 KB Output is correct
14 Correct 297 ms 22608 KB Output is correct
15 Correct 602 ms 29924 KB Output is correct
16 Correct 549 ms 29336 KB Output is correct
17 Correct 580 ms 30540 KB Output is correct
18 Correct 282 ms 26444 KB Output is correct
19 Correct 152 ms 13284 KB Output is correct
20 Correct 527 ms 30560 KB Output is correct
21 Correct 533 ms 30496 KB Output is correct
22 Correct 591 ms 32112 KB Output is correct
23 Correct 327 ms 27468 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 283 ms 22916 KB Output is correct
4 Correct 265 ms 23436 KB Output is correct
5 Correct 274 ms 23424 KB Output is correct
6 Correct 248 ms 23268 KB Output is correct
7 Correct 260 ms 23640 KB Output is correct
8 Correct 254 ms 22796 KB Output is correct
9 Correct 259 ms 23200 KB Output is correct
10 Correct 254 ms 22936 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 3 ms 4972 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 4 ms 5224 KB Output is correct
11 Correct 5 ms 5228 KB Output is correct
12 Correct 5 ms 5228 KB Output is correct
13 Correct 5 ms 5228 KB Output is correct
14 Correct 4 ms 5100 KB Output is correct
15 Correct 4 ms 5228 KB Output is correct
16 Correct 5 ms 5356 KB Output is correct
17 Correct 4 ms 5228 KB Output is correct
18 Correct 4 ms 5228 KB Output is correct
19 Correct 5 ms 5096 KB Output is correct
20 Correct 4 ms 5228 KB Output is correct
21 Correct 5 ms 5100 KB Output is correct
22 Correct 5 ms 5100 KB Output is correct
23 Correct 4 ms 5100 KB Output is correct
24 Incorrect 5 ms 5228 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 3 ms 4972 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 255 ms 22648 KB Output is correct
11 Correct 331 ms 25700 KB Output is correct
12 Correct 333 ms 25848 KB Output is correct
13 Correct 352 ms 26864 KB Output is correct
14 Correct 144 ms 22800 KB Output is correct
15 Correct 4 ms 5224 KB Output is correct
16 Correct 5 ms 5228 KB Output is correct
17 Correct 5 ms 5228 KB Output is correct
18 Correct 5 ms 5228 KB Output is correct
19 Correct 4 ms 5100 KB Output is correct
20 Correct 4 ms 5228 KB Output is correct
21 Correct 5 ms 5356 KB Output is correct
22 Correct 4 ms 5228 KB Output is correct
23 Correct 4 ms 5228 KB Output is correct
24 Correct 19 ms 7660 KB Output is correct
25 Correct 349 ms 25868 KB Output is correct
26 Correct 322 ms 25956 KB Output is correct
27 Correct 331 ms 25060 KB Output is correct
28 Correct 284 ms 24164 KB Output is correct
29 Correct 264 ms 23908 KB Output is correct
30 Correct 226 ms 22284 KB Output is correct
31 Incorrect 359 ms 26724 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 4 ms 5228 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 255 ms 22648 KB Output is correct
10 Correct 331 ms 25700 KB Output is correct
11 Correct 333 ms 25848 KB Output is correct
12 Correct 352 ms 26864 KB Output is correct
13 Correct 144 ms 22800 KB Output is correct
14 Correct 297 ms 22608 KB Output is correct
15 Correct 602 ms 29924 KB Output is correct
16 Correct 549 ms 29336 KB Output is correct
17 Correct 580 ms 30540 KB Output is correct
18 Correct 282 ms 26444 KB Output is correct
19 Correct 283 ms 22916 KB Output is correct
20 Correct 265 ms 23436 KB Output is correct
21 Correct 274 ms 23424 KB Output is correct
22 Correct 248 ms 23268 KB Output is correct
23 Correct 260 ms 23640 KB Output is correct
24 Correct 254 ms 22796 KB Output is correct
25 Correct 259 ms 23200 KB Output is correct
26 Correct 254 ms 22936 KB Output is correct
27 Correct 4 ms 5224 KB Output is correct
28 Correct 5 ms 5228 KB Output is correct
29 Correct 5 ms 5228 KB Output is correct
30 Correct 5 ms 5228 KB Output is correct
31 Correct 4 ms 5100 KB Output is correct
32 Correct 4 ms 5228 KB Output is correct
33 Correct 5 ms 5356 KB Output is correct
34 Correct 4 ms 5228 KB Output is correct
35 Correct 4 ms 5228 KB Output is correct
36 Correct 19 ms 7660 KB Output is correct
37 Correct 349 ms 25868 KB Output is correct
38 Correct 322 ms 25956 KB Output is correct
39 Correct 331 ms 25060 KB Output is correct
40 Correct 284 ms 24164 KB Output is correct
41 Correct 264 ms 23908 KB Output is correct
42 Correct 226 ms 22284 KB Output is correct
43 Incorrect 359 ms 26724 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4972 KB Output is correct
2 Correct 3 ms 4972 KB Output is correct
3 Correct 3 ms 4972 KB Output is correct
4 Correct 3 ms 4972 KB Output is correct
5 Correct 4 ms 5100 KB Output is correct
6 Correct 4 ms 5228 KB Output is correct
7 Correct 4 ms 5228 KB Output is correct
8 Correct 4 ms 5228 KB Output is correct
9 Correct 4 ms 5228 KB Output is correct
10 Correct 255 ms 22648 KB Output is correct
11 Correct 331 ms 25700 KB Output is correct
12 Correct 333 ms 25848 KB Output is correct
13 Correct 352 ms 26864 KB Output is correct
14 Correct 144 ms 22800 KB Output is correct
15 Correct 297 ms 22608 KB Output is correct
16 Correct 602 ms 29924 KB Output is correct
17 Correct 549 ms 29336 KB Output is correct
18 Correct 580 ms 30540 KB Output is correct
19 Correct 282 ms 26444 KB Output is correct
20 Correct 283 ms 22916 KB Output is correct
21 Correct 265 ms 23436 KB Output is correct
22 Correct 274 ms 23424 KB Output is correct
23 Correct 248 ms 23268 KB Output is correct
24 Correct 260 ms 23640 KB Output is correct
25 Correct 254 ms 22796 KB Output is correct
26 Correct 259 ms 23200 KB Output is correct
27 Correct 254 ms 22936 KB Output is correct
28 Correct 4 ms 5224 KB Output is correct
29 Correct 5 ms 5228 KB Output is correct
30 Correct 5 ms 5228 KB Output is correct
31 Correct 5 ms 5228 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 4 ms 5228 KB Output is correct
34 Correct 5 ms 5356 KB Output is correct
35 Correct 4 ms 5228 KB Output is correct
36 Correct 4 ms 5228 KB Output is correct
37 Correct 19 ms 7660 KB Output is correct
38 Correct 349 ms 25868 KB Output is correct
39 Correct 322 ms 25956 KB Output is correct
40 Correct 331 ms 25060 KB Output is correct
41 Correct 284 ms 24164 KB Output is correct
42 Correct 264 ms 23908 KB Output is correct
43 Correct 226 ms 22284 KB Output is correct
44 Incorrect 359 ms 26724 KB Output isn't correct
45 Halted 0 ms 0 KB -