# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707492 | josanneo22 | Swapping Cities (APIO20_swap) | C++17 | 1 ms | 340 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<bits/stdc++.h>
#include <vector>
using namespace std;
vector<vector<pair<int,int>>> adj;
long long sm = 0;
int cycle = 1;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
int n, m; n = N; m = M;
for (int i = 0; i < n; i++) {
adj[U[i]].push_back(make_pair(V[i], W[i]));
sm += (long long)W[i];
}
for (int i = 0; i < n; i++) {
if (adj[i].size() == 1) cycle = 0;
}
}
int getMinimumFuelCapacity(int X, int Y) {
if (cycle == 1) return (int)sm;
else return -1;
}
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... |