Submission #106584

#	Time	Username	Problem	Language	Result	Execution time	Memory
106584		tictaccat	Highway Tolls (IOI18_highway)	C++14	0 / 100	38 ms	1144 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int N,A,B,M;
ll length;
vector<vector<pair<int,int>>> adj;
vector<pair<int,int>> pos;
vector<int> w;

pair<int,int> find(int L, int R) {

    //cout << L << " " << R << "\n";

    if (R-L == 1) return make_pair(L,R);

    int mid = (L+R)/2;
    
    for (int i = L; i < mid; i++) w[i] = 0;
    for (int i = mid; i < R; i++) w[i] = 1;

    ll z = ask(w);

    int k = (z-length*A)/(B-A);

    if (k == 0) return find(L,mid);
    if (k == length) return find(mid,R);

    return make_pair(mid-(length-k),mid+k);
}

void find_pair(int tempN, std::vector<int> U, std::vector<int> V, int tempA, int tempB) {

    N = tempN; A = tempA; B = tempB; M = U.size(); adj.resize(N); w.resize(M,0);

    for (int i = 0; i < M; i++) {
    adj[U[i]].push_back(make_pair(V[i],i));
    adj[V[i]].push_back(make_pair(U[i],i));
    }
    length = ask(w)/A;

    pair<int,int> res = find(0,N-1);

    cout << res.first << " " << res.second << "\n";

    answer(res.first,res.second);
   // answer(0, pos[0].first);
}

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