Submission #319445

#	Time	Username	Problem	Language	Result	Execution time	Memory
319445		VEGAnn	Swapping Cities (APIO20_swap)	C++14	6 / 100	127 ms	10704 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
int cnt[N], mx = 0;

void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    mx = 0;

    for (int i = 0; i < M; i++){
        cnt[U[i]]++;
        cnt[V[i]]++;
        mx = max(mx, W[i]);
    }

    for (int i = 0; i < N; i++)
        if (cnt[i] < 2)
            mx = -1;
}

int getMinimumFuelCapacity(int X, int Y) {
    return mx;
}

• Subtask 1: 6 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27