Submission #747412

#TimeUsernameProblemLanguageResultExecution timeMemory
747412vjudge1Swapping Cities (APIO20_swap)C++17
6 / 100
86 ms10164 KiB
#include "swap.h"

#include <bits/stdc++.h>

using namespace std;

bool bambusz = true;
int mx = 0;

void init(int N, int M,
    std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    if(M == N) bambusz = false;
    for(int i : W)mx = max(mx, i);
}

int getMinimumFuelCapacity(int X, int Y) {
    if(bambusz)return -1;
    return mx;
}

/*

3 2
0 1 5
0 2 5
1
1 2


*/
#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...