| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366124 | djsksbrbf | Hack (APIO25_hack) | C++20 | 146 ms | 4424 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
int hack(){
int l = 1, r = 5e5 + 1;
int ans = 0;
while(l <= r){
int mid = (l + r) >> 1;
std::vector<long long> x = {};
for(int i = 1; i <= mid ; i++)x.push_back(i);
int t = collisions(x);
if(t == 0)l = mid + 1;
else{
ans = mid;
r = mid - 1;
}
}
return ans - 1;
}| # | 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... | ||||
