//#include "reverse.h"
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using int64 = int64_t;
using ld = long double;
[[maybe_unused]] int readInt() {
int x;
cin >> x;
return x;
}
[[maybe_unused]] int64 readInt64() {
int64 x;
cin >> x;
return x;
}
[[maybe_unused]] string readString() {
string s;
cin >> s;
return s;
}
[[maybe_unused]] double readDouble() {
return stod(readString());
}
[[maybe_unused]] ld readLongDouble() {
return stold(readString());
}
template<typename T1, typename T2>
[[maybe_unused]] pair<T1, T2> readPair() {
pair<T1, T2> p;
cin >> p.first >> p.second;
return p;
}
template<typename T>
[[maybe_unused]] vector<T> readVec(const int sz) {
vector<T> v(sz);
for (T &x : v) {
cin >> x;
}
return v;
}
template<typename T>
[[maybe_unused]] vector<vector<T>> readVecVec(const int n, const int m) {
vector<vector<T>> a(n);
for (vector<T> &v : a) {
v = readVec<T>(m);
}
return a;
}
const int64 kInf64 = 2e18 + 10;
const int kInf = 1e9 + 10;
const int kMod = 1e9 + 7;
vector<long long> reverse(vector<long long> a) {
reverse(a.begin(), a.end());
return a;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
296 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
288 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
2 ms |
436 KB |
Output is correct |
8 |
Correct |
4 ms |
792 KB |
Output is correct |
9 |
Correct |
10 ms |
2052 KB |
Output is correct |
10 |
Correct |
31 ms |
5900 KB |
Output is correct |