Submission #977606

#	Time	Username	Problem	Language	Result	Execution time	Memory
977606		Ning07	Swapping Cities (APIO20_swap)	C++17	6 / 100	80 ms	11452 KiB

swap

#include "swap.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;

#define L(i, j, k) for (int i = (j); i <= k; i++) 
#define R(i, j, k) for (int i = (j); i >= k; i--) 

const int nax = 100050;
int N, M;
int ok = true;
int mx = -1;
vector<pair<int, int>> G[nax];

void init(int _N, int _M, std::vector<int> _U, std::vector<int> _V, std::vector<int> _W) {
    N = _N; M = _M;
    for (int i = 0; i < M; i++) {
        G[_U[i]].push_back(make_pair(_V[i], _W[i]));
        G[_V[i]].push_back(make_pair(_U[i], _W[i]));
        mx = max(mx, _W[i]);
    }
    for (int i = 0; i < N; i++) 
        if (G[i].size() <= 1) 
            ok = false;
}

int getMinimumFuelCapacity(int X, int Y) {
    if (!ok) return -1;
    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