제출 #728937

#제출 시각아이디문제언어결과실행 시간메모리
728937stevancv자매 도시 (APIO20_swap)C++14
6 / 100
87 ms10256 KiB
#include <bits/stdc++.h> #include "swap.h" #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; //const int N = 1e5 + 2; const int inf = 1e9; int N, M, MX; 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++) smax(MX, w[i]); } int getMinimumFuelCapacity(int x, int y) { if (N == M) return MX; 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...