Submission #394262

#TimeUsernameProblemLanguageResultExecution timeMemory
394262SugardorjSwapping Cities (APIO20_swap)C++14
0 / 100
1 ms460 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; int i,j,s,t; int a[261523],b[234567],l,r,tt,k,y,z,n,m,N,M,x; vector<int>te,so, p[1234],an,W; void init(int N, int M, vector <int> U,vector <int> V, vector <int> W) { m= W[0]; for (auto u:W) m=max (m,u); } int getMinimumFuelCapacity(int u, int v) { if (N==M+1) return -1; m= W[0]; for (auto u:W) m=max (m,u); return m; }
#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...