QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#620490	#9251. Graph Changing	ucup-team5071	WA	0ms	3840kb	C++14	3.2kb	2024-10-07 18:32:13	2024-10-07 18:32:14

Judging History

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

[2024-10-07 18:32:14]
评测

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

查看

[2024-10-07 18:32:13]
提交

answer

#include <bits/stdc++.h>

using namespace std;
#define int long long
bool ava(int a,int b,int c){
    return abs(b-a) >= c;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin >> q;
    while(q--){
        int t,n,k,x,y;
        cin >> t >> n >> k >> x >> y;
        if (x > y) swap(x,y);
        if (t == 0){
            cout << y-x << "\n"; continue;
        } else if (k == 1){
            cout << 1 << "\n"; continue;
        } else if (t == 1){
            if (k >= n) {
                cout << -1 << "\n"; continue;
            } else if (y-x >= k){
                cout << 1 << "\n"; continue;
            } else {
                if (ava(x,n,k) && ava(y,n,k)){
                    cout << 2 << "\n"; continue;
                } else if (ava(x,1,k) && ava(y,1,k)){
                    cout << 2 << "\n"; continue;
                } else {
                    bool flag1 = (ava(x,1,k) || ava(x,n,k));
                    bool flag2 = (ava(y,1,k) || ava(y,n,k));
                    if (flag1 && flag2) {
                        cout << 3 << "\n"; continue;
                    } else {
                        cout << -1 << "\n"; continue;
                    }
                }
            }
        } else if (t >= 2){
            if (k == 2){
                if (n <= 3){
                    cout << -1 << "\n"; continue;
                } else {
                    if (t & 1){
                        if (n == 4 && x == 2 && y == 3) {cout << 3 << "\n";continue;}
                        else {cout << ((y-x==1)? 2 : 1)<< "\n"; continue;}
                    } else {
                        cout << y-x << "\n"; continue;
                    }
                }
            } else if (k == 3 && t == 2){
                if (n == 6){
                    // assert(1==2);
                    vector<int> a{3,5,2,4};
                    int i1 = -1,j1 = -1;
                    for(int i = 0; i < 4; ++i) {if (a[i] == x)i1=i;if(a[i]==y)j1=i;}
                    if (i1 == -1 || j1 == -1){
                        cout << "-1\n"; continue;
                    } else {
                        int ans = abs(i1-j1);
                        if (ans == 3) ans = 1;
                        cout << ans << "\n"; continue;
                    }
                }
                if (ava(x,y,k)){
                    cout << -1 << "\n"; continue;
                } else if (ava(x,n,k) && ava(y,n,k)){
                    cout << -1 << "\n"; continue;
                } else if (ava(x,1,k) && ava(y,1,k)){
                    cout << -1 << "\n"; continue;
                } else {
                    bool flag1 = (ava(x,1,k) || ava(x,n,k));
                    bool flag2 = (ava(y,1,k) || ava(y,n,k));
                    if (flag1 && flag2) {
                        cout << 1 << "\n"; continue;
                    } else {
                        cout << -1 << "\n"; continue;
                    }
                }
            } else if (k == 3 && n == 6 && t == 3){
                // assert(1==2);
                cout << ((x==2&&y==5)? 1 : -1) << "\n"; continue;
            } else {
                cout << -1 << "\n"; continue;
            }
        }
    }   
    
    return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3840kb

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

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

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

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

input:

output:

result:

wrong answer 128th lines differ - expected: '3', found: '1'