Submission #493425

#	Time	Username	Problem	Language	Result	Execution time	Memory
493425		vendx_greyback	자매 도시 (APIO20_swap)	C++14	6 / 100	98 ms	10648 KiB

swap

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

const int mxn = 1e5;
int par[mxn], mx = 0;
bool isLine = true;

int get(int u){
    
    if(u == par[u])
        return u;
        
    return par[u] = get(par[u]);
    
}

void join(int u, int v){
    
    u = get(u);
    v = get(v);
    
    par[u] = v;
    
}

void init(int n, int m, vector<int> u, vector<int> v, vector<int> w){
    
    for(int i = 0; i < n; i++)
        par[i] = i;
    
    for(int i = 0; i < m; i++){
        
        if(get(u[i]) == get(v[i]))
            isLine = false;
        
        else
            join(u[i], v[i]);
            
        mx = max(mx, w[i]);
        
    }
    
}

int getMinimumFuelCapacity(int x, int y){
    return (isLine? -1: 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