제출 #1273991

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

long long collisions(std::vector<long long> x);

int hack(){
    int l = 0, r = 1e6+1;
    while(r-l>1){
        int mid = (l+r)/2;
        vector<long long> g(mid);
        for (int i = 0; i<mid; i++) g[i] = i+1;
        long long res = collisions(g);
        if (res==0) l = mid;
        else r = mid;
    }
    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...