QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#554171	#9251. Graph Changing	ucup-team3555	WA	0ms	3708kb	C++20	1.0kb	2024-09-09 08:11:13	2024-09-09 08:11:13

Judging History

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

[2024-09-09 08:11:13]
评测

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

查看

[2024-09-09 08:11:13]
提交

answer

#include <bits/stdc++.h>
using namespace std;

int t,n,k,x,y;

void calc(){
  if(y-x>=k) cout<<"1\n";
  else if(x>k||n-y>=k) cout<<"2\n";
  else if((x<=k&&n-x<k)||(y<=k&&n-y<k)) cout<<"-1\n";
  else cout<<"3\n";	
}

void SOLVE(){
  cin>>t>>n>>k>>x>>y;
  if(x>y) swap(x,y);

  if(!t) cout<<y-x<<'\n';
  else if(k>3){
	if(t>=2) cout<<"-1\n";
	else calc();
  }else if(k==3){
	if(n<=3) cout<<"-1\n";
	else if(t==1) calc();
	else if((t==2&&n==5&&x==2&&y==4)||(t==2&&n==7&&x==3&&y==5)||(t==3&&n==6&&x==2&&y==5)) cout<<"1\n";
    else if(n==6&&t==2){
      if(x==1||y==6) cout<<"-1\n";
	  else if(x==2&&y==5) cout<<"3\n";
	  else if(y<=3||x>3) cout<<"1\n";
	  else cout<<"2\n";
	}else cout<<"-1\n";
  }else if(k==2){
	if(n<=2) cout<<"-1\n";
    else if(n==3){
	  if(t==1&&x==1&&y==3) cout<<"1\n";
	  else cout<<"-1\n";
	}else{
	  if(t&1) calc();
	  else cout<<y-x<<'\n';
	}
  }else cout<<"1\n";
}

int main(){
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int _;cin>>_;
  while(_--) SOLVE();
  return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3700kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3556kb

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

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

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

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

input:

output:

result:

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