제출 #397820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
397820		yuto1115	자매 도시 (APIO20_swap)	C++17	6 / 100	136 ms	16048 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int inf = 1001001001;

namespace {
    int n;
    vvp G;
    vi deg;
    int mx;
    bool cycle;
}

void init(int _n, int m, vi u, vi v, vi w) {
    n = _n;
    G.resize(n);
    deg.resize(n);
    mx = 0;
    rep(i, m) {
        G[u[i]].eb(v[i], w[i]);
        G[v[i]].eb(u[i], w[i]);
        deg[u[i]]++;
        deg[v[i]]++;
        chmax(mx, w[i]);
    }
    cycle = true;
    rep(i, n) cycle &= deg[i] == 2;
}

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