제출 #777849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777849		t6twotwo	자매 도시 (APIO20_swap)	C++17	0 / 100	335 ms	524288 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
int N, mn;
vector<int> pmax, ad;
constexpr int inf = 2e9;
void init(int n, int M, vector<int> U, vector<int> V, vector<int> W) {
    N = n;
    mn = inf;
    ad.resize(N, inf);
    pmax.resize(N);
    vector<vector<pair<int, int>>> adj(N);
    for (int i = 0; i < M; i++) {
        adj[U[i]].emplace_back(W[i], V[i]);
        adj[V[i]].emplace_back(W[i], U[i]);
    }
    for (auto &v : adj) {
        sort(v.begin(), v.end());
    }
    vector<int> stk{inf};
    auto dfs = [&](auto dfs, int x) -> void {
        ad[x] = stk.back();
        for (auto [z, y] : adj[x]) {
            adj[y].erase(find(adj[y].begin(), adj[y].end(), pair{z, x}));
            pmax[y] = max(pmax[x], z);
            if (x != 0 && adj[x].size() > 1) {
                stk.push_back(min(stk.back(), adj[x][0] == pair{z, y} ? adj[x][1].first : adj[x][0].first));
            }
            dfs(dfs, y);
            if (x != 0 && adj[x].size() > 1) {
                stk.pop_back();
            }
        }
        if (x != 0 && adj[x].size() > 1) {
            mn = min(mn, adj[x][1].first);
        }
    };
    dfs(dfs, 0);
}
int getMinimumFuelCapacity(int X, int Y) {
    int ans = max(pmax[Y], min(mn, ad[Y]));
    if (ans == inf) {
        ans = -1;
    }
    return ans;
}

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