QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #597541 | #9251. Graph Changing | DBsoleil | WA | 0ms | 3656kb | C++23 | 2.6kb | 2024-09-28 17:59:40 | 2024-09-28 17:59:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int q,t,n,k,x,y;
int to[8][8][8];
int main(){
ios_base::sync_with_stdio(false);
cin>>q;
while(q--){
cin>>t>>n>>k>>x>>y;
if(n==2&&k>1){cout<<"-1\n";continue;}
if(x>=y)swap(x,y);
if(k==1){
if(t==0){
cout<<y-x<<"\n";
}else cout<<1<<"\n";
}else if(k==2){
if(n==2){
cout<<"-1\n";
}else
if(t&1){
if(n==3){
if(x==1&&y==3)cout<<"1\n";
else cout<<"-1\n";
}else if(n==4) {
if(y-x==2)cout<<"1\n";
else if(y==3&&x==2)cout<<"3\n";
else cout<<"-1\n";
}else{
if(y-x==1)cout<<2<<"\n";
else cout<<"1\n";
}
}else cout<<(n==2?-1:y-x)<<"\n";
}else if(k==3&&n<7){
if(n<=3){
if(t==0)cout<<y-x<<"\n";
else cout<<"-1\n";
}else if(n==4){
if(t==0)cout<<y-x<<"\n";
else if(t==1){
if(y-x==3)cout<<1<<"\n";
else cout<<"-1\n";
}else cout<<"-1\n";
}else if(n==5){
if(t==0)cout<<y-x<<"\n";
else if(t==1){
if(y-x>=3)cout<<1<<"\n";
else if(y==4&&x==2)cout<<3<<"\n";
else cout<<"-1\n";
}else cout<<"-1\n";
}else if(n==6){
if(t==0)cout<<y-x<<"\n";
else if(t==1){
if(y-x>=3)cout<<1<<"\n";
else if(y-x==1&&x!=3)cout<<2<<"\n";
else if(x==1||y==6)cout<<2<<"\n";
else cout<<3<<"\n";
}if(t==2){
if(x==1||y==6)cout<<-1<<"\n";
else{
if(x==3)x=4;
else if(x==4)x=3;
if(y==3)y=4;
else if(y==4)y=3;
cout<<abs(y-x)<<"\n";
}
}else cout<<-1<<"\n";
}
}else{
if(t==0)cout<<y-x<<"\n";
else if(t==1){
if(y-x>=k)cout<<"1\n";
else if(x>k||n-y>=k){
cout<<"2\n";
}else if(y>k&&n-x>=k){
cout<<"3\n";
}else cout<<"-1\n";
}else cout<<"-1\n";
}
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
input:
5 1 5 3 2 4 1 10 4 2 4 2 10 5 2 4 1 3 2 1 3 1 3 2 1 2
output:
3 2 -1 1 -1
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
30 1 2 1 1 2 1 2 2 1 2 1 2 3 1 2 1 2 4 1 2 1 2 5 1 2 1 2 6 1 2 2 2 1 1 2 2 2 2 1 2 2 2 3 1 2 2 2 4 1 2 2 2 5 1 2 2 2 6 1 2 3 2 1 1 2 3 2 2 1 2 3 2 3 1 2 3 2 4 1 2 3 2 5 1 2 3 2 6 1 2 4 2 1 1 2 4 2 2 1 2 4 2 3 1 2 4 2 4 1 2 4 2 5 1 2 4 2 6 1 2 5 2 1 1 2 5 2 2 1 2 5 2 3 1 2 5 2 4 1 2 5 2 5 1 2 5 2 6 1 2
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: -100
Wrong Answer
time: 0ms
memory: 3596kb
input:
90 1 3 1 1 2 1 3 1 1 3 1 3 1 2 3 1 3 2 1 2 1 3 2 1 3 1 3 2 2 3 1 3 3 1 2 1 3 3 1 3 1 3 3 2 3 1 3 4 1 2 1 3 4 1 3 1 3 4 2 3 1 3 5 1 2 1 3 5 1 3 1 3 5 2 3 1 3 6 1 2 1 3 6 1 3 1 3 6 2 3 2 3 1 1 2 2 3 1 1 3 2 3 1 2 3 2 3 2 1 2 2 3 2 1 3 2 3 2 2 3 2 3 3 1 2 2 3 3 1 3 2 3 3 2 3 2 3 4 1 2 2 3 4 1 3 2 3 4 2...
output:
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 -1 -1 -1 -1 -1 -1 -1 -1 -1 -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 -1 -1 -1 -1 -1 -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:
wrong answer 22nd lines differ - expected: '-1', found: '1'