QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#265827	#6838. Assumption is All You Need	kokomiisbest	WA	1ms	3720kb	C++14	801b	2023-11-25 21:28:46	2023-11-25 21:28:46

Judging History

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

[2023-11-25 21:28:46]
评测

测评结果：WA
用时：1ms
内存：3720kb

查看

[2023-11-25 21:28:46]
提交

answer

#include<bits/stdc++.h>
using namespace std;
struct node{
	int l,r;
}ans[2500];
int a[2500],b[2500],p[2500],tar[2500];
int main()
{
	int n,i,j,k,t;
	cin>>t;
	while(t--)
	{
		cin>>n;int flag=1;
		for(i=1;i<=n;i++)
		{
			cin>>a[i];p[a[i]]=i;
		}
		for(i=1;i<=n;i++)
		{
			cin>>b[i];tar[b[i]]=i;
		}
		int cnt=0;
		for(i=n;i>=1;i--)
		{
			if(tar[i]<p[i])
			{
				flag=0;break;
			}
			if(tar[i]>p[i])
			{
				ans[++cnt].l=p[i];ans[cnt].r=tar[i];
				swap(a[p[i]],a[tar[i]]);
			//	cout<<a[1]<<a[2]<<a[3]<<a[4]<<endl;
				p[a[p[i]]]=p[i];
				p[a[tar[i]]]=tar[i];
			//	cout<<p[1]<<p[2]<<p[3]<<p[4]<<endl;
			}
		}
		if(!flag) cout<<"-1\n";
		else 
		{
			cout<<cnt<<'\n';
			for(i=1;i<=cnt;i++) cout<<ans[i].l<<" "<<ans[i].r<<'\n';
		}
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3720kb

input:

3
2
1 2
2 1
4
4 1 2 3
1 3 2 4
8
8 7 6 5 4 3 2 1
1 8 7 6 5 4 3 2

output:

result:

ok T=3

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3592kb

input:

315
10
8 4 6 1 2 9 7 5 10 3
6 7 8 10 5 1 3 2 9 4
10
10 8 2 9 6 5 7 4 3 1
7 1 3 5 9 8 4 10 6 2
6
4 6 5 3 1 2
1 5 4 6 2 3
12
5 9 12 8 10 6 11 4 2 3 1 7
9 2 3 1 5 12 4 7 6 10 8 11
10
4 7 3 2 8 9 6 10 5 1
1 4 8 10 3 7 9 6 2 5
7
1 2 4 5 6 7 3
4 3 5 6 7 2 1
3
1 3 2
2 1 3
7
1 5 3 7 6 4 2
6 5 2 1 3 4 7
1
1
...

output:

-1
-1
-1
-1
-1
-1
-1
-1
0
-1
-1
-1
3
4 5
1 2
1 6
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
3
2 4
1 2
1 5
-1
-1
-1
-1
-1
-1
0
0
-1
-1
-1
-1
-1
-1
0
0
-1
-1
0
-1
-1
-1
1
1 2
4
3 6
2 5
3 4
1 3
2
1 3
1 2
-1
-1
0
-1
-1
2
2 4
2 3
-1
-1
-1
0
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
0
-1...

result:

wrong answer Case #2: Jury has the answer but participant has not