# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
64894 | 2018-08-06T05:09:51 Z | qkxwsm | 뒤집기 (IOI16_reverse) | C++17 | 87 ms | 7176 KB |
/* PROG: source LANG: C++11 _____ .' '. / 0 0 \ | ^ | | \ / | \ '---' / '._____.' */ // #include <bits/stdc++.h> // #include <ext/pb_ds/tree_policy.hpp> // #include <ext/pb_ds/assoc_container.hpp> #include "reverse.h" #include <vector> using namespace std; typedef long long ll; vector<ll> reverse(vector<ll> v) { vector<ll> res(v.size()); for (int i = 0; i < v.size(); i++) { res[i] = v[v.size() - 1 - i]; } return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 496 KB | Output is correct |
3 | Correct | 3 ms | 496 KB | Output is correct |
4 | Correct | 3 ms | 496 KB | Output is correct |
5 | Correct | 2 ms | 516 KB | Output is correct |
6 | Correct | 2 ms | 696 KB | Output is correct |
7 | Correct | 5 ms | 776 KB | Output is correct |
8 | Correct | 10 ms | 1352 KB | Output is correct |
9 | Correct | 25 ms | 2768 KB | Output is correct |
10 | Correct | 87 ms | 7176 KB | Output is correct |