# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1205253 | neev4321 | Hack (APIO25_hack) | C++20 | 20 ms | 15936 KiB |
#include "hack.h"
#include <vector>
std::vector<long long> a(1000000);
int hack(){
a[0] = 0;
for (long long i = 1; i < 1000000; ++i)
a[i] = a[i - 1] + i;
return collisions(a);
}
# | 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... |