oj.uz

답안 #999921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999921 2024-06-16T10:04:38 Z underwaterkillerwhale 자매 도시 (APIO20_swap) C++17
37 / 100
 2000 ms 17348 KB 
#include "swap.h"

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N  = 2e5 + 7;
const int Mod = 998244353;
const int szBL = 916;
const int INF = 1e9;
const int BASE = 137;

struct Edge {
    int u, v, w;
};

vector<int> weights;

struct Query {
    int X, Y;
    int id;
    int lf, rt, ok;
    int getMid() { return lf + rt >> 1; }
};

struct Disjoin_set {
    int lab[N], sz[N];
    bool isline[N];
    pair<int,int> ln[N];

    void init (int n) {
        rep (i, 1, n) {
            lab[i] = i;
            sz[i] = 1;
            isline[i] = 1;
            ln[i] = {i, i};
        }
    }

    int Find (int u) {
        return u == lab[u] ? u : lab[u] = Find(lab[u]);
    }

    void Join (int u, int v){
        int uu = u, vv = v;
        u = Find(u);
        v = Find(v);
        if (u == v) {
            isline[u] = 0;
            return;
        }
        if (sz[u] < sz[v]) swap (u, v), swap (uu, vv);
        if (min(isline[v], isline[u]) == 0) {
            isline[u] = isline[v] = 0;
        }
        else {
            if ((uu != ln[u].fs && uu != ln[u].se) || (vv != ln[v].fs && vv != ln[v].se)) {
                isline[u] = isline[v] = 0;
            }
            else {
                static vector<int> vec;
                if (ln[u].fs == ln[u].se) {
                    if (ln[v].fs != vv) ln[u].se = ln[v].fs;
                    else ln[u].se = ln[v].se;
                }
                else if (ln[v].fs == ln[v].se) {
                    if (ln[u].fs != uu) ln[u].se = ln[v].fs;
                    else ln[u].fs = ln[v].fs;
                }
                else {
                    vec = {ln[u].fs, ln[u].se, ln[v].fs, ln[v].se};
                    ln[u] = {-1, -1};
                    iter (&id, vec) {
                        if (id != uu && id != vv) {
                            if (ln[u].fs == -1) ln[u].fs = id;
                            else ln[u].se = id;
                        }
                    }
                }
            }
        }
        lab[v] = u;
        sz[u] += sz[v];
    }
    bool check (int u, int v) {
        u = Find(u);
        v = Find(v);
        if (u != v) return 0;
        return isline[u] == 0;
    }
}DSU;

int n, m, Q;
vector<Edge> edges;
Query qr[N];
map<pair<int,int>, int> Ans;

void algo() {
    sort (ALL(edges), [] (Edge A, Edge B) { return A.w < B.w; });
    iter (&E, edges) weights.push_back(E.w);
    sort (ALL(weights));
    weights.resize (unique(ALL(weights)) - weights.begin());
    rep (i, 1, Q) {
        qr[i].lf = 0;
        qr[i].rt = SZ(weights) - 1;
        qr[i].ok = 0;
    }

    rep (step, 0, 25) {
        DSU.init(n);
        sort (qr + 1, qr + 1 + Q, [] (Query A, Query B) { return A.getMid() < B.getMid(); });
        int ptrQ = 1, ptrE = 0;
        iter (&W, weights) {
            while (ptrE < SZ(edges) && edges[ptrE].w < W) ++ptrE;
            while (ptrQ <= Q && weights[qr[ptrQ].getMid()] < W) ++ptrQ;
            while (ptrE < SZ(edges) && edges[ptrE].w == W)  {
                Edge &cur = edges[ptrE];
                DSU.Join(cur.u, cur.v);
                ++ptrE;
            }
            while (ptrQ <= Q && weights[qr[ptrQ].getMid()] == W) {
                Query &cur = qr[ptrQ];
                if (DSU.check(cur.X, cur.Y)) {
                    qr[ptrQ].rt = qr[ptrQ].getMid();
                    qr[ptrQ].ok = 1;
                }
                else qr[ptrQ].lf = qr[ptrQ].getMid() + 1;
                ++ptrQ;
            }
        }
    }
    sort (qr + 1, qr + 1 + Q, [] (Query A, Query B) { return A.id < B.id; });
//    rep (i, 1, Q) {
//        if (qr[i].ok == 1) {
////            cout << weights[qr[i].getMid()] <<"\n";
//            Ans[mp(qr[i].X, qr[i].Y)] = weights[qr[i].getMid()];
//        }
//        else {
//            Ans[mp(qr[i].X, qr[i].Y)] = -1;
////            cout << -1 <<"\n";
//        }
//    }
}

void init (int _n, int _m, vector<int> _U, vector<int> _V, vector<int> _W) {
//void solution() {
    n = _n;
    m = _m;
//    Q = _Q;
    rep (i, 0, m  - 1) {
        int u = _U[i], v = _V[i], w = _W[i];
        ++u, ++v;
        edges.push_back({u, v, w});
    }
//    rep (i, 0, Q - 1) {
//        qr[i + 1].X = _X[i] + 1, qr[i + 1].Y = _Y[i] + 1;
//    }
//    cin >> n >> m;
//    rep (i, 1, m) {
//        int u, v, w;
//        cin >> u >> v >> w;
//        ++u,++v;
//        edges.push_back({u, v, w});
//    }
//    cin >> Q;
//    rep (i, 1, Q ) {
//        cin >> qr[i].X >> qr[i].Y;
//        ++qr[i].X, ++qr[i].Y;
//        qr[i].id = i;
//    }
//    algo();
}

int getMinimumFuelCapacity (int X, int Y) {
    Q = 1;
    qr[1].X = ++X, qr[1].Y = ++Y;
    algo();
    if (qr[1].ok == 1) 
////            cout << weights[qr[i].getMid()] <<"\n";
        return weights[qr[1].getMid()];
    else return -1;
//            Ans[mp(qr[i].X, qr[i].Y)] = weights[qr[i].getMid()];
//        }
//        else {
//            Ans[mp(qr[i].X, qr[i].Y)] = -1;
////            cout << -1 <<"\n";
//        }
}

//#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
//int main () {
//    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
////    file ("c");
//    int num_Test = 1;
////    cin >> num_Test;
//    while (num_Test--)
//        solution();
//}
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
1 4 10
2 3 3
3
1 2
2 4
0 1




3 2
0 1 5
0 2 5
1
1 2

*/

Compilation message

swap.cpp: In member function 'int Query::getMid()':
swap.cpp:39:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |     int getMid() { return lf + rt >> 1; }
      |                           ~~~^~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 3 ms 3932 KB Output is correct
5 Correct 4 ms 3932 KB Output is correct
6 Correct 3 ms 3928 KB Output is correct
7 Correct 4 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 208 ms 9172 KB Output is correct
10 Correct 521 ms 10052 KB Output is correct
11 Correct 646 ms 9924 KB Output is correct
12 Correct 653 ms 10380 KB Output is correct
13 Correct 463 ms 10380 KB Output is correct
14 Execution timed out 2098 ms 9604 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Execution timed out 2059 ms 13932 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 3 ms 3932 KB Output is correct
5 Correct 4 ms 3932 KB Output is correct
6 Correct 3 ms 3928 KB Output is correct
7 Correct 4 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 1 ms 3932 KB Output is correct
10 Correct 3 ms 3932 KB Output is correct
11 Correct 3 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 3 ms 3932 KB Output is correct
14 Correct 3 ms 3932 KB Output is correct
15 Correct 4 ms 3932 KB Output is correct
16 Correct 4 ms 3932 KB Output is correct
17 Correct 3 ms 3932 KB Output is correct
18 Correct 3 ms 3932 KB Output is correct
19 Correct 3 ms 3976 KB Output is correct
20 Correct 4 ms 3932 KB Output is correct
21 Correct 3 ms 4144 KB Output is correct
22 Correct 5 ms 3928 KB Output is correct
23 Correct 3 ms 3932 KB Output is correct
24 Correct 5 ms 4188 KB Output is correct
25 Correct 7 ms 4184 KB Output is correct
26 Correct 6 ms 4184 KB Output is correct
27 Correct 4 ms 3928 KB Output is correct
28 Correct 5 ms 4188 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 3 ms 3932 KB Output is correct
6 Correct 4 ms 3932 KB Output is correct
7 Correct 3 ms 3928 KB Output is correct
8 Correct 4 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 208 ms 9172 KB Output is correct
11 Correct 521 ms 10052 KB Output is correct
12 Correct 646 ms 9924 KB Output is correct
13 Correct 653 ms 10380 KB Output is correct
14 Correct 463 ms 10380 KB Output is correct
15 Correct 3 ms 3932 KB Output is correct
16 Correct 3 ms 3932 KB Output is correct
17 Correct 3 ms 3932 KB Output is correct
18 Correct 3 ms 3932 KB Output is correct
19 Correct 3 ms 3932 KB Output is correct
20 Correct 4 ms 3932 KB Output is correct
21 Correct 4 ms 3932 KB Output is correct
22 Correct 3 ms 3932 KB Output is correct
23 Correct 3 ms 3932 KB Output is correct
24 Correct 3 ms 3976 KB Output is correct
25 Correct 4 ms 3932 KB Output is correct
26 Correct 3 ms 4144 KB Output is correct
27 Correct 5 ms 3928 KB Output is correct
28 Correct 3 ms 3932 KB Output is correct
29 Correct 5 ms 4188 KB Output is correct
30 Correct 7 ms 4184 KB Output is correct
31 Correct 6 ms 4184 KB Output is correct
32 Correct 4 ms 3928 KB Output is correct
33 Correct 5 ms 4188 KB Output is correct
34 Correct 15 ms 4892 KB Output is correct
35 Correct 628 ms 10068 KB Output is correct
36 Correct 626 ms 10068 KB Output is correct
37 Correct 647 ms 10072 KB Output is correct
38 Correct 610 ms 10040 KB Output is correct
39 Correct 591 ms 9844 KB Output is correct
40 Correct 521 ms 9492 KB Output is correct
41 Correct 680 ms 10288 KB Output is correct
42 Correct 658 ms 10032 KB Output is correct
43 Correct 357 ms 10028 KB Output is correct
44 Correct 620 ms 10252 KB Output is correct
45 Correct 686 ms 13836 KB Output is correct
46 Correct 651 ms 10284 KB Output is correct
47 Correct 643 ms 9928 KB Output is correct
48 Correct 645 ms 10448 KB Output is correct
49 Correct 331 ms 13688 KB Output is correct
50 Correct 279 ms 11068 KB Output is correct
51 Correct 529 ms 11984 KB Output is correct
52 Correct 907 ms 15292 KB Output is correct
53 Correct 880 ms 16380 KB Output is correct
54 Correct 1067 ms 17348 KB Output is correct
55 Correct 367 ms 10028 KB Output is correct
56 Correct 927 ms 15028 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 3 ms 3932 KB Output is correct
5 Correct 4 ms 3932 KB Output is correct
6 Correct 3 ms 3928 KB Output is correct
7 Correct 4 ms 3932 KB Output is correct
8 Correct 3 ms 3932 KB Output is correct
9 Correct 208 ms 9172 KB Output is correct
10 Correct 521 ms 10052 KB Output is correct
11 Correct 646 ms 9924 KB Output is correct
12 Correct 653 ms 10380 KB Output is correct
13 Correct 463 ms 10380 KB Output is correct
14 Execution timed out 2098 ms 9604 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3932 KB Output is correct
2 Correct 1 ms 3932 KB Output is correct
3 Correct 1 ms 3932 KB Output is correct
4 Correct 1 ms 3932 KB Output is correct
5 Correct 3 ms 3932 KB Output is correct
6 Correct 4 ms 3932 KB Output is correct
7 Correct 3 ms 3928 KB Output is correct
8 Correct 4 ms 3932 KB Output is correct
9 Correct 3 ms 3932 KB Output is correct
10 Correct 208 ms 9172 KB Output is correct
11 Correct 521 ms 10052 KB Output is correct
12 Correct 646 ms 9924 KB Output is correct
13 Correct 653 ms 10380 KB Output is correct
14 Correct 463 ms 10380 KB Output is correct
15 Execution timed out 2098 ms 9604 KB Time limit exceeded
16 Halted 0 ms 0 KB -