| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1230064 | Jer | 자매 도시 (APIO20_swap) | C++20 | 48 ms | 5944 KiB |
#include "swap.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int n, m, res = 0;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
n = N, m = M;
if (n == m)
for (int i = 0; i < N; i++)
res = max(W[i], res);
}
int getMinimumFuelCapacity(int X, int Y)
{
return (n == m) ? res : -1;
}
| # | 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... | ||||
