Submission #836263

#	Time	Username	Problem	Language	Result	Execution time	Memory
836263		mousebeaver	Highway Tolls (IOI18_highway)	C++14	6 / 100	115 ms	2096 KiB

highway

#define ll long long
#define pll pair<ll, ll>
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;

void find_pair(int n, std::vector<int> u, std::vector<int> v, int a, int b) 
{
    vector<int> w(n-1, 0);
    ll dist = ask(w);

    //Find first station:
    int left = 0;
    int right = n-1;
    while(left < right)
    {
        int mid = (left+right)/2;
        w.assign(n-1, 0);
        for(int i = 0; i <= mid; i++)
        {
            w[i] = 1;
        }

        if(ask(w) > dist)
        {
            right = mid;
        }
        else
        {
            left = mid+1;
        }
    }
    int start = left;

    //Find second station:
    left = 1;
    right = n;
    while(left < right)
    {
        int mid = (left+right+1)/2;
        w.assign(n-1, 0);
        for(int i = n; i >= mid; i--)
        {
            w[i-1]= 1;
        }

        if(ask(w) > dist)
        {
            left = mid;
        }
        else
        {
            right = mid-1;
        }
    }
    int goal = left;

    answer(start, goal);
}

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