| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325201 | lunarecho | Hack (APIO25_hack) | C++20 | 0 ms | 332 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
int hack()
{
int n = 0;
while(true)
{
int f = n + 1, s = f + 1, t = s + 1;
if(collisions({1, f, s, t})) {
int ans = -1;
if(collisions({1, f})) {
ans = f - 1;
} else if(collisions({1, s})) {
ans = s - 1;
} else {
ans = t - 1;
}
return ans;
}
n += 3;
}
}| # | 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... | ||||
