# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
551386 | 2022-04-20T14:33:19 Z | Olympia | 홀-짝 수열 (IZhO11_oddeven) | C++17 | 1 ms | 468 KB |
#include <iostream> #include <vector> #include <iomanip> #include <algorithm> #include <cassert> #include <map> #include <complex> #include <cmath> #include <set> #include <queue> using namespace std; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") int main () { ios_base::sync_with_stdio(false); cin.tie(NULL); //int t; //cin >> t; //while (t--) { int64_t n; cin >> n; int64_t sq = (1 + sqrt(1 + 8 * n))/2; if (n == 1) { cout << 1 << '\n'; } else if (n == 4) { cout << "5\n"; } else { assert(sq * (sq + 1)/2 >= n); assert((sq - 1) * sq/2 <= n); cout << sq * sq + 2 *(n - (sq + 1) * sq/2) << '\n'; } //} }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 212 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
14 | Halted | 0 ms | 0 KB | - |