Submission #741818

#	Time	Username	Problem	Language	Result	Execution time	Memory
741818		1zaid1	Swapping Cities (APIO20_swap)	C++17	6 / 100	110 ms	16900 KiB

swap

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

const int M = 1e5+5;
vector<pair<int, int>> node[M];
vector<array<int, 3>> E;

int n, m;
int mx = 0, cycle = 3;
void init(int _n, int _m, vector<int> U, vector<int> V, vector<int> W) {
    n = _n, m = _m;
    for (int i = 0; i < m; i++) E.push_back({U[i], V[i], W[i]});
    for (auto [a, b, c]:E) 
        node[a].push_back({b, c}),
        node[b].push_back({a, c});
    for (int i = 0; i < n; i++) cycle = min(cycle, (int)node[i].size());
    for (auto [a, b, c]:E) mx = max(mx, c);
    cycle = cycle > 1;
}


int getMinimumFuelCapacity(int X, int Y) {
    // int x = solve(X, Y);
    // if (x > 1e9) return -1;
    // return x+1;

    if (cycle) return mx;
    return -1;
}

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