제출 #342522

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

highway

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

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define pb push_back
#define popb pop_back
#define fi first
#define se second

const int MX = 2e5;

int n, a, b;
vi U, V;
vi adj[MX];
vi seq;
vi W;

void fillAdj() {
    RE(i,U.size()) {
        adj[U[i]].push_back(i);
        adj[V[i]].push_back(i);
    }
}
void dfsSeq(int u, int p) {
    FOR(e,adj[u]) {
        if(V[e] == p || U[e] == p) continue;
        if(V[e] == u) swap(V[e], U[e]);
        int v = V[e];
        seq.push_back(e);
        dfsSeq(v, u);
    }
}

void find_pair(int N, vi _U, vi _V, int A, int B) {
    n=N; U=_U; V=_V; a=A; b=B;

    fillAdj();
    dfsSeq(0,-1);
    reverse(all(seq));

    W.assign(n-1,0);
    ll normal = ask(W);

    int lb=0, ub=n-1;
    while(lb != ub) {
        int mid=(lb+ub)/2;
        W.assign(n-1,0);
        REP(i,0,mid+1) W[seq[i]] = 1;

        if(ask(W) == normal) lb=mid+1;
        else                 ub=mid;
    }

    answer(0,V[seq[lb]]);
}

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