제출 #979492

#제출 시각아이디문제언어결과실행 시간메모리
979492ducksaysquack자매 도시 (APIO20_swap)C++17
6 / 100
70 ms6060 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; bool yes = true; int k = 0; void init(int n, int m, vector<int> u, vector<int> v, vector<int> w) { yes = n == m; for(int i=0;i<m;i++) k = max(k, w[i]); } int getMinimumFuelCapacity(int x, int y) { return yes? k:-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...