Submission #1226054

#TimeUsernameProblemLanguageResultExecution timeMemory
1226054SpyrosAlivSwapping Cities (APIO20_swap)C++20
0 / 100
51 ms6500 KiB
#include "swap.h" #include <bits/stdc++.h> using namespace std; const int MN = 2e5+5; const int INF = 1e9+10; int n, m; vector<int> w, weights; void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) { n = N; m = M; w.assign(n, 0); for (int i = 0; i < m; i ++) { w[V[i]] = W[i]; weights.push_back(W[i]); } sort(weights.begin(), weights.end()); } int getMinimumFuelCapacity(int X, int Y) { int a = X; int b = Y; if (n <= 3) return -1; return max({w[a], w[b], w[2]}); }
#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...