#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
#include "reverse.h"
vector<ll> reverse(vector<ll> a) {
vector<ll> res;
for (int i = a.size() - 1; i >= 0; i--) {
res.pb(a[i]);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
300 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
444 KB |
Output is correct |
8 |
Correct |
3 ms |
996 KB |
Output is correct |
9 |
Correct |
12 ms |
2264 KB |
Output is correct |
10 |
Correct |
24 ms |
6048 KB |
Output is correct |