| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1207051 | bane | Hack (APIO25_hack) | C++20 | 31 ms | 8000 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
bool check(int mid){
vector<long long>X(mid);
iota(X.begin(), X.end(), 1);
return collisions(X) >= 1;
}
int hack(){
int L = 2, R = 1'000'000;
while(L<=R){
int mid = (L+R) / 2;
if (check(mid)){
R = mid - 1;
}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... | ||||
