Submission #1213960

#TimeUsernameProblemLanguageResultExecution timeMemory
1213960fskaricaHack (APIO25_hack)C++20
0 / 100
31 ms16068 KiB
#include "hack.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define pii pair<ll, ll> ll n = 1000000; ll bs(ll col) { ll lo = 1; ll hi = n; while (lo < hi) { ll mid = (lo + hi) / 2; ll cnt = 0; for (ll i = 0; i < mid; i++) { ll 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 (ll 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...