# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979638 | vjudge1 | Swapping Cities (APIO20_swap) | C++17 | 97 ms | 15928 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "swap.h"
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
vector<pair<int, int>> g[200005];
pair<int, int> p[200005];
map<pair<int, int>, int> mp, pos;
set<pair<int, int>> st;
int x, y, mx;
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
x = N;
y = M;
for(int i = 0; i < M; i++){
int a = U[i] + 1, b = V[i] + 1, c = W[i] + 1;
// g[a].push_back({b, c});
// g[b].push_back({a, c});
// mp[{a, b}] = c;
// mp[{b, a}] = c;
// pos[{a, b}] = i + 1;
// pos[{b, a}] = i + 1;
mx = max(mx, W[i]);
st.insert({c, i + 1});
}
}
int getMinimumFuelCapacity(int X, int Y) {
X++;
Y++;
if(x - 1 == y) return -1;
else return mx;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |