QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#641605	#9251. Graph Changing	11d10xy	WA	0ms	3948kb	C++14	872b	2024-10-14 21:33:49	2024-10-14 21:33:49

Judging History

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

[2024-10-14 21:33:49]
评测

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

查看

[2024-10-14 21:33:49]
提交

answer

#include<bits/stdc++.h>
using namespace std;
void solve(){
   int t,n,k,x,y;
   scanf("%d%d%d%d%d",&t,&n,&k,&x,&y);
   if(t==0)return printf("%d\n",abs(x-y)),void();
   if(k==1)puts("1");
   else if(k==2){
      if(n==4&&t&1&&min(x,y)==2&&max(x,y)==3)puts("3");
      else if(n<=3){
         if(t==1)puts(abs(x-y)==2?"1":"-1");
         else puts("-1");
      }else{
         if(t&1)puts(abs(x-y)==1?"2":"1");
         else printf("%d\n",abs(x-y));
      }
   }else{
      bool a=abs(x-y)>=k,b=min(x,y)-k>=1||max(x,y)+k<=n;
      if(k==3&&t==2&&!a&&!b&&min(x,y)+k<=n&&max(x,y)-k>=1)puts("1");
      else if(t==1&&!a&&!b&&min(x,y)+k<=n&&max(x,y)-k>=1)puts("3");
      else if(t>1)puts("-1");
      else if(a)puts("1");
      else if(b)puts("2");
      else puts("-1");
   }
}
int main(){
   int T;for(scanf("%d",&T);T--;)solve();
   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: 3640kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3688kb

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: 3624kb

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: 3948kb

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: 3896kb

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: 3764kb

input:

output:

result:

wrong answer 126th lines differ - expected: '2', found: '-1'