QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#586952	#9251. Graph Changing	vme50	WA	0ms	3944kb	C++17	955b	2024-09-24 16:44:52	2024-09-24 16:44:52

Judging History

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

[2024-09-24 16:44:52]
评测

测评结果：WA
用时：0ms
内存：3944kb

查看

[2024-09-24 16:44:52]
提交

answer

#include <bits/stdc++.h>
using namespace std;
int T,x,n,m,u,v,d;
int f(int u) {return u==3 || u==4?7-u:u;}
void slv()
{
	scanf("%d %d %d %d %d",&x,&n,&m,&u,&v);
	if(u>v) swap(u,v);d=v-u;
	if(!x) printf("%d\n",d);
	else if((u<=m && u>n-m) || (v<=m && v>n-m)) puts("-1");
	else if(x==1)
	{
		if(d>=m) puts("1");
		else if(u>m || v<=n-m) puts("2");else puts("3");
	}
	else if(m==1) puts("1");
	else if(m==2)
	{
		if(n<4) puts("-1");
		else if(n==4 && x&1 && u==2 && v==3) puts("3"); 
		else printf("%d\n",x&1?(d>1?1:2):d);
	}
	else if(m==3)
	{
		if(n<5) puts("-1");
		else if(n==5) puts(x==2 && u==2 && v==4?"1":"-1");
		else if(n==6)
		{
			if(x==2) printf("%d\n",u>=2 && u<=5?abs(f(u)-f(v)):-1);
			else if(x==3) puts(u==2 && v==5?"1":"-1");else puts("-1");
		}
		else if(n==7) puts(x==2 && u==3 && v==5?"1":"-1");
		else puts("-1");
	}
	else puts("-1");
}
int main()
{
	scanf("%d",&T);
	while(T--) slv();return 0;
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3832kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3720kb

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

result:

ok 30 lines

Test #3:

score: 0

Accepted

time: 0ms

memory: 3712kb

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
-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

result:

ok 90 lines

Test #4:

score: 0

Accepted

time: 0ms

memory: 3944kb

input:

output:

1
1
1
1
1
1
2
1
1
3
1
2
-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
3
1
2
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
1
3
1
2
-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...

result:

ok 180 lines

Test #5:

score: 0

Accepted

time: 0ms

memory: 3944kb

input:

output:

1
1
1
1
1
1
1
1
1
1
2
1
1
1
2
1
1
2
1
2
2
-1
1
1
-1
3
1
-1
-1
2
-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
3
4
1
2
3
1
2
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
...

result:

ok 300 lines

Test #6:

score: -100

Wrong Answer

time: 0ms

memory: 3944kb

input:

output:

result:

wrong answer 129th lines differ - expected: '-1', found: '4'