제출 #594354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594354		SlavicG	통행료 (IOI18_highway)	C++17	11 / 100	656 ms	262144 KiB

highway

#include "highway.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define sz(a) (int)a.size()

void dfs(int u, int par, vector<vector<int>>& adj, vector<int>& p, vector<int>& depth) {
    p[u] = par;
    for(int v: adj[u]) {
        if(v == par) continue;
        depth[v] = depth[u] + 1;
        dfs(v, u, adj, p, depth);
    }
}
int find(int start, int n, vector<int> u, vector<int> v) {
    map<pair<int, int>, int> idx;
    vector<vector<int>> adj(n);
    vector<int> p(n, 0), depth(n, 0);

    int m = u.size();
    for(int i = 0; i < m; ++i) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
        idx[{u[i], v[i]}] = idx[{v[i], u[i]}] = i;
    }
    dfs(start, -1, adj, p, depth);
    int l = 0, r = n, dd = -1;
    vector<int> c(m, 1);
    ll init = ask(c);
    while(l <= r) {
        int mid = l + r >> 1;
        for(int j = 0; j < n; ++j) {
            if(j == start) continue;
            if(depth[j] >= mid) {
                c[idx[{j, p[j]}]] = 0;
            }
        }
        if(ask(c) < init) {
            dd = mid;
            l = mid + 1;
        } else r = mid - 1;
        c.assign(m, 1);
    }
    vector<int> nodes;
    for(int i = 0; i < n; ++i) {
        if(i == start) continue;
        if(depth[i] == dd) nodes.push_back(i);
    }
    assert(sz(nodes) > 0);

    l = 0, r = sz(nodes) - 1;
    int pp = -1;
    while(l <= r) {
        int mid = l + r >> 1;
        for(int i = 0; i <= mid; ++i) {
            assert(p[nodes[i]] != -1);
            c[idx[{nodes[i], p[nodes[i]]}]] = 0;
        }
        if(ask(c) < init) {
            pp = mid;
            r = mid - 1;
        } else l = mid + 1;
        c.assign(m, 1);
    }
    assert(pp != -1);
    return nodes[pp];
}
void find_pair(int n, vector<int> u, vector<int> v, int a, int b) {
    int s = find(0, n, u, v);
    int t = find(s, n, u, v);
    answer(t, s);
}

컴파일 시 표준 에러 (stderr) 메시지

highway.cpp: In function 'int find(int, int, std::vector<int>, std::vector<int>)':
highway.cpp:31:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |         int mid = l + r >> 1;
      |                   ~~^~~
highway.cpp:54:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |         int mid = l + r >> 1;
      |                   ~~^~~

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