QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#716205	#9251. Graph Changing	OFforest_1273	WA	0ms	3748kb	C++14	1.8kb	2024-11-06 14:39:59	2024-11-06 14:40:01

Judging History

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

[2024-11-06 14:40:01]
评测

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

查看

[2024-11-06 14:39:59]
提交

answer

#include<bits/stdc++.h>
#define LL long long
using namespace std;
template<typename T> inline void read(T &x){x=0;int f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();x*=f;}
template<typename T> inline void write(T x){if(x>9)write(x/10);putchar(x%10+'0');}
int q,t,n,k,x,y;
int mypow(LL a,LL b,int lim){
    LL res=1;
    while(b){
        if(res>=lim)return -1;
        if(b&1)res*=a;
        a*=a,b>>=1;
    }
    return res;
}
void solve(){
    read(t),read(n),read(k),read(x),read(y);
    if(x>y)swap(x,y);
    if(!t)return write(y-x),putchar('\n'),void();
    if(k==1)return printf("1\n"),void();
    if(n<=k)return printf("-1\n"),void();
    if(n<=2)return printf("-1\n"),void();
    if(k==2){
        if(n==3){
            if(t==1){
                if(x==1&&y==3)printf("1\n");
                else printf("-1\n");
                return;
            }
            if(t>=2)printf("-1\n");
            return;
        }
        if(t&1){
            if(y-x>=k)printf("1\n");
            else{
                if((x>n-k&&x<=k)||(y>n-k&&y<=k))return printf("-1\n"),void();
                if((x<=k&&y<=k)||(x>k&&y>k))return printf("2\n"),void();
                return printf("3\n"),void();
            }
        }else write(y-x),putchar('\n');
        return;
    }
    if(k>3&&t>1)return printf("-1\n"),void();
    if(t==1){
        if(y-x>=k)return printf("1\n"),void();
        if((x>n-k&&x<=k)||(y>n-k&&y<=k))return printf("-1\n"),void();
        if((x<=k&&y<=k)||(x>k&&y>k))return printf("2\n"),void();
        return printf("3\n"),void();
    }
    if(n>=2*k)return printf("-1\n"),void();
    if(n==5&&t==2&&x==2&&y==4)return printf("1\n"),void();
    return printf("-1\n"),void();
}
int main(){
    read(q);
    while(q--)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: 3692kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3680kb

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

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

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

Wrong Answer

time: 0ms

memory: 3748kb

input:

output:

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

wrong answer 15th lines differ - expected: '2', found: '3'