| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 315137 |
2020-10-22T03:17:08 Z |
Seanliu |
Cat (info1cup19_cat) |
C++14 |
|
285 ms |
95700 KB |
#include <iostream>
#include <vector>
#include <utility>
#define pii pair<int,int>
#define F first
#define S second
#define ericxiao ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
using namespace std;
const int maxN = 3e6 + 326;
int N, arr[maxN], pos[maxN], T, posc, ansc;
pii ans[maxN];
bool vis[maxN];
inline void makeMove(int i, int j){
swap(arr[i], arr[j]);
swap(arr[N - i + 1], arr[N - j + 1]);
}
inline void disp(){
for(int i = 1; i <= N; i++) cout << arr[i] << " \n"[i == N];
}
inline char readchar() {
static const size_t bufsize = 65536;
static char buf[bufsize];
static char *p = buf, *end = buf;
if (p == end) end = buf + fread(buf, 1, bufsize, stdin), p = buf;
return *p++;
}
inline void const Read(int & p) {
p = 0;
int tmp = 0;
char c = readchar();
tmp = !(c^'-');
while (c < '0' || c > '9') {
c = readchar();
}
while (c >= '0' && c <= '9')
p = (p<<3)+(p<<1)+(c^48), c = readchar();
p = tmp?-p:p;
}
inline void solve(){
Read(N);
for(int i = 1; i <= N; i++) Read(arr[i]);
//cout << "Jizz" << endl;
for(int i = 1; i <= N / 2; i++) if(arr[i] + arr[N - i + 1] != N + 1){
//cout << "i = " << i << " fail\n";
cout << -1 << endl;
return;
}
posc = ansc = 0;
for(int i = 1; i <= N / 2; i++) if(arr[i] > arr[N - i + 1]) {
if(arr[arr[i]] <= N / 2 && arr[arr[i]] + arr[i] != N + 1){
//cout << "Found: " << i << ", " << arr[i] << endl;
ans[ansc++] = {i, arr[i]};
makeMove(i, arr[i]);
} else pos[posc++] = i;
}
if(posc & 1){ //not sure about this
cout << -1 << endl;
return;
}
/*
cout << "have: ";
for(int x : pos) cout << x << " ";
cout << endl;
*/
for(int i = 0; i < posc; i += 2){
makeMove(pos[i], N - pos[i + 1] + 1);
ans[ansc++] = {pos[i], N - pos[i + 1] + 1};
}
//disp();
fill(vis, vis + N + 1, false);
for(int i = 1; i <= N / 2; i++){
while(i != arr[i]){
int nxt = arr[i];
makeMove(i, arr[i]);
ans[ansc++] = {i, nxt};
//disp();
}
}
cout << ansc << " " << ansc << endl;
for(int i = 0; i < ansc; i++) cout << ans[i].F << " " << ans[i].S << endl;
}
int main(){
//ericxiao
//
Read(T);
while(T--){
solve();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
136 ms |
95700 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
640 KB |
Output is correct |
| 2 |
Correct |
11 ms |
640 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
136 ms |
95700 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
640 KB |
Output is correct |
| 2 |
Correct |
11 ms |
640 KB |
Output is correct |
| 3 |
Correct |
272 ms |
10032 KB |
Output is correct |
| 4 |
Correct |
243 ms |
9464 KB |
Output is correct |
| 5 |
Correct |
285 ms |
11896 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
136 ms |
95700 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
