Submission #421535

#	Time	Username	Problem	Language	Result	Execution time	Memory
421535		xt0r3	Highway Tolls (IOI18_highway)	C++14	0 / 100	259 ms	262148 KiB

highway

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

constexpr int N = 1e5 + 5;
vector<int> w, lst;
vector<pair<int, int> > edges[N];

int n, m, a, b, d[N], s, t;
long long alap;

void dfs(int id, int de = 0, int par = -1){
    d[id] = de;
    //cout << id << endl;
    for(pair<int, int> p : edges[id]){
        if(p.first != par){
            dfs(p.first, de + 1, id);
            lst.push_back(p.second);
        }
    }
}

int src(int l, int r){
    if(l == r) return lst[l];
    int m = (l + r) / 2;

    for(int i = l; i <= m; i++) w[lst[i]] = 1;
    long long cur = ask(w);
    for(int i = l; i <= m; i++) w[lst[i]] = 0;

    return (cur > alap ? src(l, m) : src(m + 1, r));

}

void find_pair(int _N, std::vector<int> u, std::vector<int> v, int A, int B) {
    n = _N;
    m = u.size();
    a = A;
    b = B;
    w.assign(m, 0);
    alap = ask(w);
    for(int i = 0; i < m; i++){
        edges[u[i]].emplace_back(v[i], i);
        edges[v[i]].emplace_back(u[i], i);
    }
    dfs(0);
    sort(lst.begin(), lst.end(), [&u, &v](int x, int y){return max(d[u[x]], d[v[x]]) > max(d[u[y]], d[v[y]]);});
    int id = src(0, lst.size() - 1);
    pair<int, int> p1 = make_pair(u[id], v[id]), p2;
    //cout << "EL: " << p1.first << ' ' << p1.second << endl;

    lst.clear();
    dfs(p1.first, 0, p1.second);
    if(lst.empty()){
        s = p1.first;
    }
    else{
        sort(lst.begin(), lst.end(), [&u, &v](int x, int y){return max(d[u[x]], d[v[x]]) > max(d[u[y]], d[v[y]]);});
        id = src(0, lst.size() - 1);
        s = (d[u[id]] > d[v[id]] ? u[id] : v[id]);
        //cout << "lst: " << endl;
        //for(int x : lst) cout << u[x] << ' ' << v[x] << endl;
        //cout << d[u[id]] << ' ' << d[v[id]] << ' ' << u[id] << ' ' << v[id] << '\n';
    }

    swap(p1.first, p1.second);//ugyanez forditva
    lst.clear();
    dfs(p1.first, 0, p1.second);
    if(lst.empty()){
        t = p1.first;
    }
    else{
        sort(lst.begin(), lst.end(), [&u, &v](int x, int y){return max(d[u[x]], d[v[x]]) > max(d[u[y]], d[v[y]]);});
        id = src(0, lst.size() - 1);
        t = (d[u[id]] > d[v[id]] ? u[id] : v[id]);
        //cout << d[u[id]] << ' ' << d[v[id]] << ' ' << u[id] << ' ' << v[id] << '\n';
    }
    lst.clear();

    //cout << s << ' ' << t << endl;
  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