Submission #1213957

#TimeUsernameProblemLanguageResultExecution timeMemory
1213957fskaricaHack (APIO25_hack)C++20
0 / 100
20 ms16020 KiB
#include "hack.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

int n = 1000000;
int bs(ll col) {
    int lo = 1;
    int hi = n;
    while (lo < hi) {
        int mid = (lo + hi) / 2;

        ll cnt = 0;
        for (int i = 0; i < mid; i++) {
            int x = n / mid;
            if (i < n % mid) x++;

            cnt += x * (x - 1) / 2;
        }

        if (cnt > col) lo = mid + 1;
        else hi = mid;
    }

    return lo;
}

int hack() {
    vector <ll> v;
    for (int i = 0; i < n; i++) v.push_back(i);
    ll x = collisions(v);

    return bs(x);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...