Submission #1235036

#TimeUsernameProblemLanguageResultExecution timeMemory
1235036HanksburgerHack (APIO25_hack)C++20
78.10 / 100
199 ms1284 KiB
#include "hack.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int hack()
{
    int l=2, r=1e9;
    while (l<r)
    {
        int mid=(l+r)/2, sq=sqrt(mid-l+1.5);
        vector<long long> tmp;
        for (int i=1; i<=sq; i++)
            tmp.push_back(i);
        for (int i=mid+1; i>l; i-=sq)
            tmp.push_back(i);
        sort(tmp.begin(), tmp.end());
        tmp.resize(unique(tmp.begin(), tmp.end())-tmp.begin());
        if (collisions(tmp))
            r=mid;
        else
            l=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...