#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5+5;
vector<long long> reverse(vector<long long> a) {
int i = 0, j = a.size()-1;
while(i < j) {
swap(a[i], a[j]);
++i, --j;
}
return a;
}
/*int main() {
ios::sync_with_stdio(false); cin.tie(0);
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 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 |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
2 ms |
364 KB |
Output is correct |
8 |
Correct |
5 ms |
620 KB |
Output is correct |
9 |
Correct |
13 ms |
1516 KB |
Output is correct |
10 |
Correct |
41 ms |
3948 KB |
Output is correct |