제출 #601786

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601786		Hanksburger	통행료 (IOI18_highway)	C++17	6 / 100	98 ms	2376 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
void find_pair(int n, vector<int> u, vector<int> v, int a, int b)
{
    for (int i=0; i<=n-2; i++)
        vec.push_back(0);
    long long res=ask(vec)/a;
    int l=0, r=n-1-res;
    while (l<r)
    {
        int mid=(l+r)/2;
        for (int i=0; i<=n-2; i++)
            vec[i]=0;
        for (int i=0; i<=mid; i++)
            vec[i]=1;
        if (ask(vec)==res*a)
            l=mid+1;
        else
            r=mid;
    }
    answer(l, l+res);
}

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