#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<string> vs;
#define PB push_back
#define pb pop_back
const unsigned int M = 1000000007;
vi reverse(vi v){
ll s = 0, e = v.size() - 1;
while(s < e){
int temp = v[s];
v[s] = v[e];
v[e] = temp;
s++;
e--;
}
return v;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
376 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |