QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#517982	#6511. Balancing Sequences	DaiRuiChen007	WA	469ms	4120kb	C++17	924b	2024-08-13 15:01:50	2024-08-13 15:01:51

Judging History

你现在查看的是最新测评结果

[2024-08-13 15:01:51]
评测

测评结果：WA
用时：469ms
内存：4120kb

查看

[2024-08-13 15:01:50]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int MAXN=4005;
int n,a[MAXN],b[MAXN],p[MAXN],q[MAXN];
vector <array<int,4>> wys;
void opr(int x,int y) {
	swap(a[x],a[y]),swap(p[a[x]],p[a[y]]);
	wys.push_back({x/n+1,x%n+1,y/n+1,y%n+1});
}
int op(int x) { return x<n?x+n:x-n; }
void solve() {
	scanf("%d",&n);
	for(int i=0;i<2*n;++i) scanf("%d",&a[i]),p[--a[i]]=i;
	for(int i=0;i<2*n;++i) scanf("%d",&b[i]),q[--b[i]]=i;
	for(int i=0;i<2*n;++i) if(a[q[i]]!=i) {
		if(a[op(p[i])]>i) return puts("-1"),void();
		if(a[q[i]]>a[op(q[i])]) opr(p[i],q[i]);
		else {
			int z=0;
			for(int j=i+1;j<a[q[i]];++j) if(j>a[op(p[j])]) { z=p[j]; break; }
			if(!z) return puts("-1"),void();
			else opr(z,op(q[i])),opr(q[i],p[i]);
		}
	}
	printf("%d\n",(int)wys.size());
	for(auto z:wys) printf("%d %d %d %d\n",z[0],z[1],z[2],z[3]);
}
signed main() {
	int T; scanf("%d",&T);
	while(T--) solve();
	return 0;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3924kb

input:

output:

-1
1
2 1 2 2

result:

ok correct plan (nYES = 1, nNO = 1) (2 test cases)

Test #2:

score: -100

Wrong Answer

time: 469ms

memory: 4120kb

input:

output:

-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
2
1 3 1 1
2 3 1 1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
1 3 1 1
2 3 1 1
2 2 1 1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-...

result:

wrong answer you didn't find a solution but jury did. (test case 50)