oj.uz

답안 #569702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569702 2022-05-27T16:03:57 Z ryangohca 자매 도시 (APIO20_swap) C++17
13 / 100
 1183 ms 23328 KB 
#include "swap.h"
 
#include <bits/stdc++.h>
using namespace std;
int p[100001], pweight[100001][20], st[100001], en[100001], lineWeight[100001], twok[100001][20];
void init(int N){
    iota(p, p+N, 0);
    iota(st, st+N, 0);
    iota(en, en+N, 0);
    fill(lineWeight, lineWeight+N, 2e9);
    memset(twok, -1, sizeof twok);
    memset(pweight, -1, sizeof pweight);
}
int fs(int x){
    if (p[x] == x) return x;
    return p[x] = fs(p[x]);
}
void ms(int x, int y, int w){
    int px = fs(x), py = fs(y);
    if (px == py){
        st[px] = en[px] = -1;
        lineWeight[px] = min(lineWeight[px], w);
        return;
    }
    p[py] = px; // px -> py
    //cout << px << ' ' << py << ' ' << w << endl;
    twok[py][0] = px;
    pweight[py][0] = w;
    if (st[px] != -1 && st[py] != -1){
        if ((st[px] == x || en[px] == x) && (st[py] == y || en[py] == y)){
            st[px] = (st[px] == x ? en[px] : st[px]);
            en[px] = (st[py] == y ? en[py] : st[py]);
        } else {
            st[px] = en[px] = -1;
            lineWeight[px] = min(lineWeight[px], w);
        }
    } else {
        st[px] = en[px] = -1;
      	lineWeight[px] = min(lineWeight[px], lineWeight[py]);
    }
}
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    init(N);
    vector<tuple<int, int, int>> edges;
    for (int i = 0; i < M; i++){
        edges.push_back({W[i], U[i], V[i]});
    }
    sort(edges.begin(), edges.end());
    for (auto [w, a, b] : edges){
        ms(a, b, w);
    }
    for (int i = 1; i <= 19; i++){
        for (int j = 0; j < N; j++){
            if (twok[j][i-1] != -1){
                twok[j][i] = twok[twok[j][i-1]][i-1];
                pweight[j][i] = max(pweight[j][i-1], pweight[twok[j][i-1]][i-1]);
            }
        }
    }
}
bool isOkay(int mid, int X, int Y){
    for (int i = 19; i >= 0; i--){
        if (twok[X][i] != -1 && pweight[X][i] <= mid) X = twok[X][i];
        if (twok[Y][i] != -1 && pweight[Y][i] <= mid) Y = twok[Y][i];
    }
    if (X != Y) return false;
    return lineWeight[X] != -1 && lineWeight[X] <= mid;
}
int getMinimumFuelCapacity(int X, int Y) {
    int mini = 0, maxi = 1e9+10;
    while (maxi - mini > 1){
        int mid = (maxi + mini) / 2;
        if (isOkay(mid, X, Y)) maxi = mid;
        else mini = mid;
    }
    return (maxi==1e9+10?-1:maxi);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 15932 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 9 ms 15956 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 16 ms 15996 KB Output is correct
7 Correct 8 ms 15960 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 54 ms 20680 KB Output is correct
10 Correct 78 ms 21392 KB Output is correct
11 Correct 83 ms 21252 KB Output is correct
12 Correct 76 ms 21432 KB Output is correct
13 Correct 100 ms 21448 KB Output is correct
14 Correct 104 ms 20808 KB Output is correct
15 Correct 597 ms 22956 KB Output is correct
16 Correct 606 ms 22796 KB Output is correct
17 Correct 614 ms 23116 KB Output is correct
18 Correct 1183 ms 23108 KB Output is correct
19 Correct 379 ms 20136 KB Output is correct
20 Correct 541 ms 22868 KB Output is correct
21 Correct 542 ms 22844 KB Output is correct
22 Correct 584 ms 23096 KB Output is correct
23 Correct 1043 ms 23328 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 15932 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 447 ms 22792 KB Output is correct
4 Correct 439 ms 22976 KB Output is correct
5 Correct 469 ms 22920 KB Output is correct
6 Correct 432 ms 22876 KB Output is correct
7 Correct 455 ms 22940 KB Output is correct
8 Correct 448 ms 22724 KB Output is correct
9 Correct 437 ms 22856 KB Output is correct
10 Correct 448 ms 22744 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 15932 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 9 ms 15956 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 16 ms 15996 KB Output is correct
7 Correct 8 ms 15960 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 9 ms 15956 KB Output is correct
10 Correct 9 ms 16040 KB Output is correct
11 Correct 8 ms 15956 KB Output is correct
12 Correct 8 ms 15956 KB Output is correct
13 Correct 8 ms 15956 KB Output is correct
14 Correct 7 ms 15956 KB Output is correct
15 Incorrect 8 ms 15932 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15956 KB Output is correct
2 Correct 15 ms 15932 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 9 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 16 ms 15996 KB Output is correct
8 Correct 8 ms 15960 KB Output is correct
9 Correct 7 ms 15956 KB Output is correct
10 Correct 54 ms 20680 KB Output is correct
11 Correct 78 ms 21392 KB Output is correct
12 Correct 83 ms 21252 KB Output is correct
13 Correct 76 ms 21432 KB Output is correct
14 Correct 100 ms 21448 KB Output is correct
15 Correct 9 ms 16040 KB Output is correct
16 Correct 8 ms 15956 KB Output is correct
17 Correct 8 ms 15956 KB Output is correct
18 Correct 8 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Incorrect 8 ms 15932 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 15932 KB Output is correct
2 Correct 8 ms 15956 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 9 ms 15956 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 16 ms 15996 KB Output is correct
7 Correct 8 ms 15960 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 54 ms 20680 KB Output is correct
10 Correct 78 ms 21392 KB Output is correct
11 Correct 83 ms 21252 KB Output is correct
12 Correct 76 ms 21432 KB Output is correct
13 Correct 100 ms 21448 KB Output is correct
14 Correct 104 ms 20808 KB Output is correct
15 Correct 597 ms 22956 KB Output is correct
16 Correct 606 ms 22796 KB Output is correct
17 Correct 614 ms 23116 KB Output is correct
18 Correct 1183 ms 23108 KB Output is correct
19 Correct 447 ms 22792 KB Output is correct
20 Correct 439 ms 22976 KB Output is correct
21 Correct 469 ms 22920 KB Output is correct
22 Correct 432 ms 22876 KB Output is correct
23 Correct 455 ms 22940 KB Output is correct
24 Correct 448 ms 22724 KB Output is correct
25 Correct 437 ms 22856 KB Output is correct
26 Correct 448 ms 22744 KB Output is correct
27 Correct 9 ms 16040 KB Output is correct
28 Correct 8 ms 15956 KB Output is correct
29 Correct 8 ms 15956 KB Output is correct
30 Correct 8 ms 15956 KB Output is correct
31 Correct 7 ms 15956 KB Output is correct
32 Incorrect 8 ms 15932 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 15956 KB Output is correct
2 Correct 15 ms 15932 KB Output is correct
3 Correct 8 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 9 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 16 ms 15996 KB Output is correct
8 Correct 8 ms 15960 KB Output is correct
9 Correct 7 ms 15956 KB Output is correct
10 Correct 54 ms 20680 KB Output is correct
11 Correct 78 ms 21392 KB Output is correct
12 Correct 83 ms 21252 KB Output is correct
13 Correct 76 ms 21432 KB Output is correct
14 Correct 100 ms 21448 KB Output is correct
15 Correct 104 ms 20808 KB Output is correct
16 Correct 597 ms 22956 KB Output is correct
17 Correct 606 ms 22796 KB Output is correct
18 Correct 614 ms 23116 KB Output is correct
19 Correct 1183 ms 23108 KB Output is correct
20 Correct 447 ms 22792 KB Output is correct
21 Correct 439 ms 22976 KB Output is correct
22 Correct 469 ms 22920 KB Output is correct
23 Correct 432 ms 22876 KB Output is correct
24 Correct 455 ms 22940 KB Output is correct
25 Correct 448 ms 22724 KB Output is correct
26 Correct 437 ms 22856 KB Output is correct
27 Correct 448 ms 22744 KB Output is correct
28 Correct 9 ms 16040 KB Output is correct
29 Correct 8 ms 15956 KB Output is correct
30 Correct 8 ms 15956 KB Output is correct
31 Correct 8 ms 15956 KB Output is correct
32 Correct 7 ms 15956 KB Output is correct
33 Incorrect 8 ms 15932 KB Output isn't correct
34 Halted 0 ms 0 KB -