제출 #286237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
286237		dolphingarlic	통행료 (IOI18_highway)	C++14	0 / 100	252 ms	262148 KiB

highway

#include "highway.h"

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

vector<pair<int, int>> graph[90000], order;

void dfs(int node, int parent = -1) {
    for (pair<int, int> i : graph[node]) if (i.first != parent) {
        order.push_back(i);
        dfs(i.first, node);
    }
}

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
    int M = U.size();
    if (M != N - 1) answer(0, 0);

    for (int i = 0; i < N; i++) graph[i].clear();
    order.clear();
    for (int i = 0; i < M; i++) {
        graph[U[i]].push_back({V[i], i});
        graph[V[i]].push_back({U[i], i});
    }
    order.push_back({0, -1});
    dfs(0);

    vector<int> W(M, 0);
    int path_len = ask(W) / A;

    int l = 1, r = M - 1;
    while (l != r) {
        int mid = (l + r) / 2;
        for (int i = 0; i <= mid; i++) W[order[i].second] = 1;
        for (int i = mid + 1; i < M; i++) W[order[i].second] = 0;
        int dist = ask(W);
        if (dist == path_len * B) r = mid;
        else l = mid + 1;
    }
    int T = order[l].first;

    order.clear();
    dfs(T);

    l = 1, r = M - 1;
    while (l != r) {
        int mid = (l + r) / 2;
        for (int i = 0; i <= mid; i++) W[order[i].second] = 1;
        for (int i = mid + 1; i < M; i++) W[order[i].second] = 0;
        int dist = ask(W);
        if (dist == path_len * B) r = mid;
        else l = mid + 1;
    }
    int S = order[l].first;

    answer(S, T);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31