Submission #1189300

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189300		zh_h	Swapping Cities (APIO20_swap)	C++17	6 / 100	68 ms	17584 KiB

swap

#include <bits/stdc++.h>
#define pb push_back
#define lint long long int
using namespace std;

vector<vector<pair<int, int>>> edge;
vector<bool> visited;
bool is_cycle = false;
int max_l = 0;

void dfs(int v, int p) {
    visited[v] = true;
    for (auto i : edge[v]) {
        if (i.first == p) continue;
        if (visited[i.first]) {
            is_cycle = true;
        }
        if (!visited[i.first]) {
            max_l = max(max_l, i.second);
            dfs(i.first, v);
        }
    }
    
}

void init(int n, int m, vector<int> U, vector<int> V, vector<int> W) {
    edge.resize(n+1);

    for (int i = 0; i < m; i ++) {
        edge[U[i]].pb({V[i], W[i]});
        edge[V[i]].pb({U[i], W[i]});
    }

    visited.resize(n, false);
    dfs(0, -1);

}

int getMinimumFuelCapacity(int x, int y) {
    if (!is_cycle) {return -1;}
    else {return max_l;}
}

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