Submission #1225895

#	Time	Username	Problem	Language	Result	Execution time	Memory
1225895		paskalisapo	자매 도시 (APIO20_swap)	C++20	6 / 100	89 ms	16184 KiB

swap

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

int citiesnum , roadnum;
vector<vector<pair<int,int>>> adj;
vector<bool> visited;
bool circle = false;
int maxweight = 0;
void dfs(int cur, int par) {
    for(auto &x : adj[cur]) {
        if(x.first == par) {
            continue;
        }
        if(visited[x.first]) {
            circle = true;
            continue;
        }
        visited[x.first] = true;
        dfs(x.first, cur); 
    }
}
void init(int N, int M,
    std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    citiesnum = N;
    roadnum = M;
    adj.resize(N);
    visited.resize(N);
    for(int i = 0 ;i < M; i++) {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
        maxweight = max(maxweight, W[i]);
    }
    dfs(0 , -1);
}

int getMinimumFuelCapacity(int X, int Y) {
    if(circle) {
        return maxweight;
    }
    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