Submission #1041741

#TimeUsernameProblemLanguageResultExecution timeMemory
1041741MuhammetSwapping Cities (APIO20_swap)C++17
0 / 100
62 ms9440 KiB
#include <bits/stdc++.h> #include "swap.h" using namespace std; const int N = 100005; int n, m, v[N]; multiset <int> s; void init(int n1, int m1, vector<int> u1, vector<int> v1, vector<int> w1) { for(int i = 0; i < m1; i++){ v[v1[i]] = (w1[i]); s.insert(w1[i]); } } int getMinimumFuelCapacity(int x, int y) { if(m <= 2){ return -1; } int ans = (v[x]+v[y]); s.erase(s.find(v[x])); s.erase(s.find(v[y])); ans += 2*(*s.begin()); s.insert(v[x]); s.insert(v[y]); return ans; }
#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...