제출 #981049

#제출 시각아이디문제언어결과실행 시간메모리
981049Abito자매 도시 (APIO20_swap)C++17
6 / 100
71 ms12856 KiB
#include "swap.h" #include <bits/stdc++.h> #define F first #define S second #define pb push_back using namespace std; const int NN=1e5+5; int n,m,mid,mx; vector<pair<int,int>> adj[NN]; 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++) mx=max(mx,W[i]); return; } int getMinimumFuelCapacity(int X, int Y) { if (m==n) 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...