QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#554134	#9251. Graph Changing	acceon128^#	WA	1ms	3688kb	C++23	1.7kb	2024-09-09 07:40:11	2024-09-09 07:40:11

Judging History

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

[2024-09-09 07:40:11]
评测

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

查看

[2024-09-09 07:40:11]
提交

answer

#include <bits/stdc++.h>
using namespace std;

inline int max_dist(int a, int n) { return max(a, n - 1 - a); }

int main() {
    int q;
    cin >> q;
    while (q--) {
        int t, n, k, x, y;
        cin >> t >> n >> k >> x >> y;
        --x, --y;

        if (x > y) swap(x, y);
        int dist = y - x;

        if (t == 0) {
            cout << dist << "\n";
            continue;
        }

        if (t == 1) {
            if (dist >= k) cout << 1 << "\n";
            else if (max_dist(x, n) < k || max_dist(y, n) < k) cout << -1 << "\n";
            else if (x >= k || n - 1 - y >= k) cout << 2 << "\n";
            else cout << 3 << "\n";
            continue;
        }

        // k == 1 and k >= 4
        if (k == 1 || k >= 4) {
            cout << (k == 1 ? 1 : -1) << "\n";
            continue;
        }

        // k == 2 and k == 3 
        if (n <= 3 + k - 2) {
            cout << -1 << "\n";
            continue;
        }
        
        // odd/even t
        if (k == 2) {
            if (t % 2 == 0) cout << dist << "\n";
            else {
                if (dist >= 2) cout << 1 << "\n";
                else if (x >= 2 || n - 1 - y >= 2) cout << 2 << "\n";
                else cout << 3 << "\n";
            }
        } else if (k == 3) {
            if ((n == 5 && t == 2 && x == 1 && y == 3) ||
                (n == 6 && t == 2 && ((x == 1 && y == 3) || (x == 2 && y == 3) || (x == 2 && y == 4))) ||
                (n == 6 && t == 3 && x == 1 && y == 4) ||
                (n == 7 && t == 2 && x == 2 && y == 4)) {
                cout << 1 << "\n";
            } else {
                cout << -1 << "\n";
            }
        }
    }
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3684kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3612kb

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

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

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

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

memory: 3688kb

input:

output:

result:

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