QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#563894	#9251. Graph Changing	ucup-team3519	WA	1ms	3728kb	C++20	2.1kb	2024-09-14 16:52:26	2024-09-14 16:52:26

Judging History

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

[2024-09-14 16:52:26]
评测

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

查看

[2024-09-14 16:52:26]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define V vector
#define all0(x) (x).begin(),(x).end()
#define all1(x) (x).begin()+1,(x).end()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define cin std::cin
#define cout std::cout
typedef long long LL;
typedef pair<int, int> pi;
typedef pair<LL, LL> pl;

//const int MN = 2e5 + 20;
const int INF = 2e9 + 1000;//INF
const LL INFLL = 8e18 + 1000;//INF long long 
mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve() {
    int t, n, k, x, y; cin >> t >> n >> k >> x >> y;
    if(x > y) swap(x, y);

    if(t == 0) {
        cout << y - x << endl;
        return;
    }
    if(t == 1) {
        if(y - x >= k) {
            cout << 1 << endl;
            return;
        }
        if(max(x - 1, n - x) < k || max(y - 1, n - y) < k) {
            cout << -1 << endl;
            return;
        }
        if(min(x - k, y - k) < 1 && max(x + k, y + k) > n) {
            cout << 3 << endl;
            return;
        }
        cout << 2 << endl;
        return;
    }
    if(k > 3) {
        cout << -1 << endl;
        return;
    }

    if(k == 1) {
        cout << 1 << endl;
        return;
    }
    if(k == 2) {
        if(n < 4) {
            cout << -1 << endl;
            return;
        }
        if(t & 1) {
            if(n == 4 && x == 2 && y == 3) {
                cout << 3 << endl;
                return;
            }
            if(y - x == 1) cout << 2 << endl;
            else cout << 1 << endl;
        } else {
            cout << y - x << endl;
            return;
        }
    }
    if(k == 3) {
        if(t == 2 && ((n == 5 && x == 2 && y == 4) || (n == 6 && x == 3 && y == 4) || (n == 7 && x == 3 && y == 5))) {
            cout << 1 << endl;
            return;
        }
        cout << -1 << endl;
        return;
    }
}

int32_t main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t=1;
    cin >> t;
    while (t--) 
    solve();
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3576kb

input:

output:

result:

ok 5 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3728kb

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

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

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

input:

output:

result:

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