제출 #1219086

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219086		JooDdae	통행료 (IOI18_highway)	C++20	51 / 100	164 ms	14208 KiB

highway

#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

long long ask(const std::vector<int> &w);
void answer(int s, int t);

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
    int M = U.size();
    vector<vector<array<int, 2>>> v(N);
    for(int i=0;i<M;i++) {
        v[U[i]].push_back({V[i], i});
        v[V[i]].push_back({U[i], i});
    }

    auto query = [&](vector<array<int, 2>> L) {
        vector<int> w(M, 0);
        for(auto [d, u] : L) for(auto [x, id] : v[u]) w[id] = 1;
        return ask(w);
    };

    auto bfs = [&](int s) -> pair<vector<int>, vector<int>> {
        vector<int> d(N, -1), p(N);

        queue<int> q;
        q.push(s), d[s] = 0;
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(auto [x, id] : v[u]) {
                if(d[x] == -1) q.push(x), d[x] = d[u]+1;
                if(d[x] == d[u]+1) p[x] = id;
            }
        }

        return {d, p};
    };

    ll D = query({});

    auto find_deepest = [&](int s, vector<int> e) -> array<int, 2> {
        auto [d, p] = bfs(s);

        vector<array<int, 2>> L;
        for(auto x : e) L.push_back({d[x], x});
        sort(L.rbegin(), L.rend());

        int l = 1, r = (int)L.size()-1;
        while(l <= r) {
            int mid = (l+r) >> 1;
            if(query(vector<array<int, 2>>(L.begin(), L.begin()+mid)) == D) l = mid+1;
            else r = mid-1;
        }

        return {L[r][1], p[L[r][1]]};
    };

    vector<int> E(N, 0); iota(E.begin(), E.end(), 0);
    auto [S, P] = find_deepest(0, E);
    int T = V[P] ^ U[P] ^ S;

    vector<int> d[2] = {bfs(S).first, bfs(T).first}, e[2];
    for(int i=0;i<N;i++) e[d[0][i] > d[1][i]].push_back(i);


    int ans[2] = {-1, -1};
    for(int i=0;i<2;i++) ans[i] = find_deepest(i?T:S, e[i])[0];

    answer(ans[0], ans[1]);
}

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