Submission #1211673

#TimeUsernameProblemLanguageResultExecution timeMemory
1211673dubabubaHack (APIO25_hack)C++20
25 / 100
284 ms4080 KiB
#include "hack.h"
#include <bits/stdc++.h>

using namespace std;

int hack(){
    function<bool(int)> can = [&](int N) -> bool {
        int SQRT = sqrt(N) + 1;
        set<int> s;
        for(int i = 1; i <= SQRT; i++)
            s.insert(i);
        for(int i = N + 1; i > SQRT; i -= SQRT)
            s.insert(i);

        vector<long long> vec;
        for(int x : s)
            if(x <= N + 1)
                vec.push_back(x);
        
        // cout << "sqrt = " << SQRT << ", " << vec.size() << endl;
        long long a = collisions(vec);
        return a > 0;
    };

    int L = 0, R = 1e9 + 10;
    while(R - L > 1) {
        int M = L + (R - L) / 2;
        if(can(M)) R = M;
        else L = M;
    }
    return R;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...