oj.uz

답안 #315102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
315102 2020-10-22T02:31:49 Z Seanliu Cat (info1cup19_cat) C++14
24 / 100
 1000 ms 7288 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 void solve(){
	cin >> N;
	for(int i = 1; i <= N; i++) cin >> arr[i];
	for(int i = 1; i <= N / 2; i++) if(arr[i] + arr[N - i + 1] != N + 1){
		cout << -1 << endl;
		return;
	}
	posc = ansc = 0;
	for(int i = 1; i <= N / 2; i++) if(arr[i] > arr[N - i + 1]) 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
	cin >> T;
	while(T--){
		solve();
	}
}

Subtask #1
5.25 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 24 ms 384 KB Valid reconstruction

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 504 KB Output is correct
2 Correct 75 ms 504 KB Output is correct

Subtask #3
8.75 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 24 ms 384 KB Valid reconstruction
2 Correct 77 ms 504 KB Output is correct
3 Correct 75 ms 504 KB Output is correct
4 Partially correct 80 ms 636 KB Valid reconstruction
5 Partially correct 31 ms 504 KB Valid reconstruction
6 Partially correct 26 ms 384 KB Valid reconstruction

Subtask #4
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 504 KB Output is correct
2 Correct 75 ms 504 KB Output is correct
3 Execution timed out 1084 ms 7288 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 24 ms 384 KB Valid reconstruction
2 Correct 77 ms 504 KB Output is correct
3 Correct 75 ms 504 KB Output is correct
4 Partially correct 80 ms 636 KB Valid reconstruction
5 Partially correct 31 ms 504 KB Valid reconstruction
6 Partially correct 26 ms 384 KB Valid reconstruction
7 Execution timed out 1084 ms 7288 KB Time limit exceeded
8 Halted 0 ms 0 KB -