제출 #1206896

#제출 시각아이디문제언어결과실행 시간메모리
1206896am_aadvikHack (APIO25_hack)C++20
25 / 100
1806 ms24280 KiB
#include <iostream> #include <vector> #define int long long using namespace std; long long collisions(vector<int> x); int calc(vector<int> arr, int n, int ans = 0) { vector<int> a(n); for (auto x : arr) ans += a[x % n], ++a[x % n]; return ans; } int hack() { vector<int> a; for (int i = 1; i <= 1e6; ++i) a.push_back(i); int s = 1, e = 1e6, res = collisions(a); while (s <= e) { int n = (s + e) / 2; int x = calc(a, n); if (x == res) return n; if (x < res) e = n - 1; else s = n + 1; } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...