Submission #1330394

#TimeUsernameProblemLanguageResultExecution timeMemory
1330394KhoaDuyHack (APIO25_hack)C++20
78.10 / 100
75 ms1284 KiB
#include "hack.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN=1e9;
int hack(){
    int low=1,high=MAXN;
    while(low<high){
        //cout << "PHASE " << low << ' ' << high << endl;
        int mid=((high+low)>>1);
        vector<ll> v;
        int blsz=sqrt(mid-low+1);
        for(int i=1;i<=blsz;i++){
            v.push_back(i);
        }
        if(low>1){
            v.push_back(v.back()+low-1);
        }
        while(v.back()-v[0]<mid){
            v.push_back(v.back()+blsz);
        }
        if(collisions(v)){
            high=v.back()-v[0];
        }
        else{
            low=v.back()-v[0]+1;
        }
    }
    return low;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...