# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
170341 | 2019-12-24T20:14:58 Z | ngmh | 뒤집기 (IOI16_reverse) | C++11 | 50 ms | 5996 KB |
#include "reverse.h" #include <vector> #include <algorithm> std::vector<long long> reverse (std::vector<long long> a) { for(int i = 0; i < a.size()/2; i++){ long long temp = a[i]; a[i] = a[a.size()-i-1]; a[a.size()-i-1] = temp; } return a; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 380 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 3 ms | 504 KB | Output is correct |
8 | Correct | 7 ms | 888 KB | Output is correct |
9 | Correct | 17 ms | 2168 KB | Output is correct |
10 | Correct | 50 ms | 5996 KB | Output is correct |