QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#597801	#9251. Graph Changing	DBsoleil	WA	1ms	3584kb	C++23	3.0kb	2024-09-28 18:52:49	2024-09-28 18:52:49

Judging History

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

[2024-09-28 18:52:49]
评测

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

查看

[2024-09-28 18:52:49]
提交

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;
    int S=q,T=0;
    while(q--){
        T++;
        cin>>t>>n>>k>>x>>y;
        // if(S==450&&T!=218)continue;
        // if(S==450&&T==218)cout<<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(t==0){
                cout<<y-x<<"\n";
            }else if(n==2)cout<<-1<<"\n";
            else if(n==3){
                if(t==1&&y-x==2)cout<<1<<"\n";
                else cout<<-1<<"\n";
            }else if(n==4){
                if(t&1){
                    if(y-x>=2)cout<<1<<"\n";
                    else if(x==2)cout<<3<<"\n";
                    else cout<<2<<"\n";
                }else cout<<y-x<<"\n";
            }else if(t&1){
                if(y-x==1)cout<<2<<"\n";
                else cout<<1<<"\n";
            }else{
                cout<<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 if(x==1&&y==2||x==4&&y==5)cout<<2<<"\n";
                    else cout<<"-1\n";
                }else if(t==2&&y==4&&x==2)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";
                }else 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 if(t==3&&x==2&&y==5)cout<<1<<"\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";
        }
    }
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3544kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3492kb

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

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: 1ms

memory: 3584kb

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: 1ms

memory: 3564kb

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

Accepted

time: 0ms

memory: 3528kb

input:

output:

result:

ok 450 lines

Test #7:

score: -100

Wrong Answer

time: 0ms

memory: 3584kb

input:

output:

result:

wrong answer 181st lines differ - expected: '1', found: '-1'