제출 #1238952

#제출 시각아이디문제언어결과실행 시간메모리
1238952noopHack (APIO25_hack)C++20
0 / 100
1 ms320 KiB
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;

bool query (int l, int r){
    int gap=sqrt(r-l+1);
    vector<long long> v;
    for (int i=1; i<=gap; ++i)
        v.push_back(i);
    for (int i=r; i>=l; i-=gap)
        v.push_back(i);
    return collisions(v);
}

int hack(){
    int l=1,r=1000000;
    while (l<r){
        int mid=l+r+1>>1;
        if (query(l,mid))
            l=mid;
        else
            r=mid-1;
    }
    return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...