| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 474721 |
2021-09-19T14:27:59 Z |
hhhhaura |
Cat (info1cup19_cat) |
C++14 |
|
559 ms |
32980 KB |
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
using namespace std;
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#ifdef wiwihorz
#define print(a...) cerr << "Line: " << __LINE__, kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R)cerr << *L << " \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
int n;
vector<int> a,vis, b;
vector<pii> ans;
void init_(int _n) {
n = _n;
ans.clear();
a.assign(n + 1, 0);
vis.assign(n + 1, 0);
}
void solve() {
int cnt = 0;
rep(i, 1, n / 2) if(a[i] != i && !vis[i]) {
int cur = a[i];
b.clear(), b.push_back(i);
vis[i] = 1;
while(cur != i) {
b.push_back(cur);
vis[cur] = 1;
cur = a[cur];
assert(b.size() <= n);
}
rrep(j, 0, signed(b.size()) - 2) {
ans.push_back({b[j], b[j + 1]});
swap(a[b[j]], a[b[j + 1]]);
swap(a[n - b[j] + 1], a[n - b[j + 1] + 1]);
}
}
rep(i, 1, n) if(a[i - 1] + 1 != a[i]) {
cout << "-1\n";
return;
}
cout << ans.size() << " " << ans.size() << "\n";
for(auto i : ans) {
cout << i.first << " " << i.second << "\n";
}
return;
}
};
using namespace solver;
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int t; cin >> t;
while(t--) {
int n; cin >> n;
init_(n);
rep(i, 1, n) cin >> a[i];
solve();
}
return 0;
}
Compilation message
cat.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
4 | #pragma loop-opt(on)
|
cat.cpp:20:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
20 | void vprint(auto L, auto R) { while(L < R)cerr << *L << " \n"[next(L) == R], ++L; }
| ^~~~
cat.cpp:20:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
20 | void vprint(auto L, auto R) { while(L < R)cerr << *L << " \n"[next(L) == R], ++L; }
| ^~~~
In file included from /usr/include/c++/10/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
from cat.cpp:2:
cat.cpp: In function 'void solver::solve()':
cat.cpp:47:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
47 | assert(b.size() <= n);
| ~~~~~~~~~^~~~
cat.cpp:38:7: warning: unused variable 'cnt' [-Wunused-variable]
38 | int cnt = 0;
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
332 KB |
Wrong answer |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
556 KB |
Output is correct |
| 2 |
Correct |
24 ms |
992 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
332 KB |
Wrong answer |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
556 KB |
Output is correct |
| 2 |
Correct |
24 ms |
992 KB |
Output is correct |
| 3 |
Correct |
546 ms |
29876 KB |
Output is correct |
| 4 |
Correct |
528 ms |
29212 KB |
Output is correct |
| 5 |
Correct |
559 ms |
32980 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
332 KB |
Wrong answer |
