oj.uz

답안 #569676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
569676 2022-05-27T15:40:05 Z ryangohca 자매 도시 (APIO20_swap) C++17
7 / 100
 551 ms 22980 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);
    memset(lineWeight, -1, sizeof lineWeight);
    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;
        if (lineWeight[px] == -1) 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] == px || en[px] == px) && (st[py] == py || en[py] == py)){
            st[px] = (st[px] == px ? en[px] : st[px]);
            en[px] = (st[py] == py ? en[py] : st[py]);
        } else {
            st[px] = en[px] = -1;
            lineWeight[px] = w;
        }
    }
    lineWeight[px] = max(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 (twok[X][0] != -1) X = twok[X][0];
    //if (twok[Y][0] != -1) Y = twok[Y][0];
    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
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 8 ms 16340 KB Output is correct
4 Incorrect 7 ms 16340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 551 ms 22852 KB Output is correct
4 Correct 450 ms 22980 KB Output is correct
5 Correct 465 ms 22980 KB Output is correct
6 Correct 466 ms 22876 KB Output is correct
7 Correct 467 ms 22980 KB Output is correct
8 Correct 470 ms 22784 KB Output is correct
9 Correct 472 ms 22952 KB Output is correct
10 Correct 471 ms 22740 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 8 ms 16340 KB Output is correct
4 Incorrect 7 ms 16340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 8 ms 16340 KB Output is correct
4 Incorrect 7 ms 16340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 8 ms 16340 KB Output is correct
4 Incorrect 7 ms 16340 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 16360 KB Output is correct
2 Correct 10 ms 16328 KB Output is correct
3 Correct 8 ms 16340 KB Output is correct
4 Incorrect 7 ms 16340 KB Output isn't correct
5 Halted 0 ms 0 KB -