Submission #743421

#TimeUsernameProblemLanguageResultExecution timeMemory
743421MauveSwapping Cities (APIO20_swap)C++14
6 / 100
85 ms8104 KiB
#include "swap.h" #include<bits/stdc++.h> #define pb push_back #define ss second #define ff first using namespace std; int l,r,i,j,ii,jj,k,n,m,mx; vector< pair<int,int> > v[100000]; void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) { n=N; m=M; for(i=0;i<M;i++){ mx=max(mx,W[i]); } } int getMinimumFuelCapacity(int X, int Y) { if(m<n) return -1; return mx; }
#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...