Submission #601786

#TimeUsernameProblemLanguageResultExecution timeMemory
601786HanksburgerHighway Tolls (IOI18_highway)C++17
6 / 100
98 ms2376 KiB
#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);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...