제출 #1345389

#제출 시각아이디문제언어결과실행 시간메모리
1345389killerzaluu자매 도시 (APIO20_swap)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;

vector<int> wv;
int third_smallest;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    wv.assign(N, 0);
    vector<int> all;

    for (int i = 0; i < M; i++) {
        int x = U[i], y = V[i], w = W[i];
        int other = (x == 0 ? y : x);
        wv[other] = w;
        all.push_back(w);
    }

    sort(all.begin(), all.end());
    third_smallest = all[2];
}

int getMinimumFuelCapacity(int X, int Y) {
    return max(third_smallest, max(wv[X], wv[Y]));
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...