제출 #594274

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

highway

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

const int N = 1e5 + 10;
vector<int> adj[N];
int depth[N], p[N];
void dfs(int u, int par) {
    p[u] = par;
    for(int v: adj[u]) {
        if(v == par) continue;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}
map<pair<int, int>, int> idx;
void find_pair(int n, vector<int> u, vector<int> v, int a, int b) {
    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(0, -1);
    int l = 1, r = N - 1, dd = -1;
    vector<int> c(m, 1);
    ll init = ask(c);
    while(l <= r) {
        int mid = l + r >> 1;
        vector<int> now = c;
        for(int j = 0; j < n; ++j) {
            if(depth[j] >= mid) {
                now[idx[{j, p[j]}]] = 0;
            }
        }
        if(ask(now) < init) {
            dd = mid;
            l = mid + 1;
        } else r = mid - 1;
    }
    vector<int> nodes;
    for(int i = 0; i < n; ++i) {
        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;
        vector<int> now = c;
        for(int i = 0; i <= mid; ++i) c[i] = 0;
        if(ask(now) < init) {
            pp = mid;
            r = mid - 1;
        } else l = mid + 1;
    }
    assert(pp != -1);
    answer(0, nodes[pp]);
}

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

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

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