QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#750733	#9251. Graph Changing	xxzx	WA	0ms	3644kb	C++14	1.3kb	2024-11-15 15:44:37	2024-11-15 15:44:37

Judging History

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

[2024-11-15 15:44:37]
评测

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

查看

[2024-11-15 15:44:37]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define clo 1000.*clock()/CLOCKS_PER_SEC
#ifndef xxzx
#define endl '\n'
#endif
using ll=long long;
using PII=pair<int,int>;
bool memory1;
int t,n,k,x,y;
void solve() {
    cin>>t>>n>>k>>x>>y;
    int nx=x,ny=y;
    x=abs(x-y);
    if(t==0) return cout<<x<<endl,void();
    if(k>=n) return cout<<-1<<endl,void();
    if(k==1) return cout<<1<<endl,void();
    if(k==2&&n>3) t&=1;
    if(!t) {
        if(n>=k+2) return cout<<x<<endl,void();
        return cout<<-1<<endl,void();
    }
    int f1=(nx>=k+1||nx<=n-k),f2=(ny>=k+1||ny<=n-k);
    if(x>=k) x=1;
    else if(min(nx,ny)>=k+1||max(nx,ny)<=n-k) x=2;
    else if(f1&&f2) x=3;
    else return cout<<-1<<endl,void();
    t--;
    if(!t) return cout<<x<<endl,void();
    if(t==1&&x>=k) return cout<<1<<endl,void();
    cout<<-1<<endl;
}
bool memory2;
int main() {
    // freopen("graph.in","r",stdin);
    // freopen("graph.out","w",stdout);
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int T; cin>>T;
    while(T--) solve();

    #ifdef xxzx
    cerr<<"Time: "<<clo<<"MS"<<endl;
    cerr<<"Memory: "<<abs(&memory1-&memory2)/1024./1024.<<"MB"<<endl;
    #endif
    return 0;
}
// 1 227299570 6 190980869 200220279
// 2 3 2 1 2
// 1 5 3 1 3
// 1 5 3 2 4
// 2 5 3 2 4
// 4 5 2 5 1
// 5 3 2 1 3

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

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

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

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

input:

output:

result:

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