제출 #1246057

#제출 시각아이디문제언어결과실행 시간메모리
1246057radaiosm7Hack (APIO25_hack)C++20
25 / 100
1470 ms16184 KiB
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> x;
long long l, r, m, quer;

long long many(long long k) {
    long long res = 0LL;
    for (int l=1; l <= 1000000; ++l) res += (l-1)/k;
    return res;
}

int hack(){
    x.clear();
    for (int i=1 ; i <= 1000000; ++i) x.push_back(i);
    quer = collisions(x);
    l = 1;
    r = 1000000;

    while (l < r) {
        m = (l+r)/2LL;
        long long v = many(m);
        if (v == quer) {
            l = m;
            break;
        }

        else if (v < quer) r = m-1;
        else l = m+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...