| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1300201 | farica | Hack (APIO25_hack) | C++20 | 168 ms | 1288 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
const int R = 1e9;
int hack(){
int l=1, r=R;
while(l<r) {
int m = (l+r)/2, x = (m-l+1), sq = sqrt(x);
vi v;
for(int i=1; i<=sq; ++i) v.push_back(i);
int cnt = m+1;
while(cnt > sq) {
v.push_back(cnt);
cnt -= sq;
if(l >= cnt) break;
}
if(collisions(v) > 0) r = m;
else l = m + 1;
}
return r;
}| # | 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... | ||||
