Submission #343507

#TimeUsernameProblemLanguageResultExecution timeMemory
343507blue자매 도시 (APIO20_swap)C++11
6 / 100
107 ms10324 KiB
#include "swap.h"
#include <vector>
using namespace std;

int res = 0;
bool cycle = 0;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    if(N == M) cycle = 1;
    for(int i = 0; i < M; i++) res = max(res, W[i]);
}

int getMinimumFuelCapacity(int X, int Y) {
    if(cycle) return res;
    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...