| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299989 | farica | Hack (APIO25_hack) | C++20 | 238 ms | 4428 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
int hack(){
int l = 1, r = 5e5+1;
while(l < r) {
int mid = (l+r)/2;
vi v;
if(l != 1) v.push_back(1);
for(int i=l; i<=mid; ++i) v.push_back(i);
int x = collisions(v);
if(x) r = mid;
else l = mid + 1;
}
return r-1;
}
| # | 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... | ||||
