| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1285718 | SmuggingSpun | Hack (APIO25_hack) | C++20 | 8 ms | 1200 KiB |
#include "hack.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int hack(){
int low = 1, high = 1e9, ans;
while(low <= high){
int mid = (low + high) >> 1, sqr = sqrt(mid);
vector<ll>p;
for(int i = 1; i < sqr; i++){
p.push_back(i);
p.push_back(sqr * i);
}
p.push_back(sqr * sqr);
if(collisions(p) > 0){
high = (ans = mid) - 1;
}
else{
low = mid + 1;
}
}
return ans;
}| # | 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... | ||||
