| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1205142 | hackstar | Hack (APIO25_hack) | C++20 | 129 ms | 1280 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
int hack(){
int low = 1;
int high = 1e9;
while(low<high){
int mid = (low+high)/2;
int s = sqrt(mid-low+1);
vector<long long> query;
for(int i=0;i<s;i++){
query.push_back(i+1);
}
for(int i=0;low+s*(i+1)<=mid;i++){
query.push_back(low+s*(i+1));
}
query.push_back(mid+1);
if(collisions(query)){
high = mid;
}
else{
low = mid+1;
}
}
return low;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
