| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367645 | denkenneinausfahrt | Hack (APIO25_hack) | C++20 | 1102 ms | 16472 KiB |
#include "hack.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int hack() {
vector<ll> v;
for (int i = 1;i <= 1000000;i++) v.push_back(i);
ll res = collisions(v);
int l = 1, r = 1000000;
while (l < r) {
int mid = (l + r + 1) / 2;
vector<int> cnt(mid, 0);
ll all = 0;
for (int i = 1;i <= 1000000;i++) {
all += cnt[i % mid]++;
}
if (all < res) r = mid - 1;
else l = mid;
}
return l;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
