제출 #407270

#제출 시각아이디문제언어결과실행 시간메모리
407270proma자매 도시 (APIO20_swap)C++17
6 / 100
103 ms10156 KiB
#include <bits/stdc++.h>

using namespace std;

int n, m, max_weight;

void init (int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    for (int i = 0; i < m; i ++) {
        max_weight = max(max_weight, W[i]);
    }
}

int getMinimumFuelCapacity (int X, int Y) {
    if (n == m) {
        return max_weight;
    }
    else {
        return -1;
    }
}
#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...