제출 #1233336

#제출 시각아이디문제언어결과실행 시간메모리
1233336clemmy14자매 도시 (APIO20_swap)C++20
6 / 100
46 ms5800 KiB
#include "swap.h" #include<bits/stdc++.h> using namespace std; int allM=-1; void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) { if(N == M) { for(int i=0; i<M; i++) allM=max(allM, W[i]); } } int getMinimumFuelCapacity(int X, int Y) { return allM; }
#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...