QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#785415	#8838. Jesse's Job	Esouling	WA	0ms	3780kb	C++20	1.2kb	2024-11-26 17:53:18	2024-11-26 17:53:19

Judging History

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

[2024-11-26 17:53:19]
评测

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

查看

[2024-11-26 17:53:18]
提交

answer

#include <bits/stdc++.h>

using loint = long long;
using db = double;

void solve() {
    
    int n;
    std::cin >> n;
    std::vector<int> a(n + 1);
    for (int i = 1; i <= n; i ++) {
        std::cin >> a[i];
    }

    int cnt = 0, cur = 1;
    std::vector<int> vis(n + 1);
    while (!vis[cur]) {
        vis[cur] ++;
        cnt ++;
        cur = a[cur];
    }

    if (cnt != n) {
        std::cout << n << '\n';
        std::cout << cnt << '\n';
        for (int i = 1; i <= n; i ++) {
            if (vis[i]) {
                std::cout << i << ' ';
            }
        }
        std::cout << '\n';
        return;
    }

    int ans = 0, p = 1;
    for (int i = 1; i <= n; i ++) {
        int l = std::min(i, a[i]), r = std::max(i, a[i]);
        int len = r - l + 1;
        if (n - len > ans) {
            ans = n - len;
            p = i;
        }
    }

    std::cout << ans << '\n';
    std::cout << 1 << '\n';
    std::cout << p << '\n';
}

int main() {

    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

    int _;
    _ = 1;
    std::cin >> _;
    while(_--)
        solve();

    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3544kb

input:

3
2
2 1
4
2 1 4 3
6
3 5 4 2 6 1

output:

result:

ok Correct (3 test cases)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3780kb

input:

872
6
1 5 2 6 3 4
6
5 2 1 3 4 6
4
2 1 3 4
6
2 3 1 4 5 6
6
4 5 1 6 2 3
6
6 2 3 1 4 5
5
2 1 3 4 5
6
1 2 6 4 3 5
4
2 1 4 3
6
1 6 4 2 5 3
6
6 1 3 5 4 2
6
2 1 4 5 6 3
6
3 4 1 5 6 2
6
4 1 5 3 2 6
6
5 2 1 6 3 4
6
4 1 6 2 5 3
6
5 1 3 6 2 4
6
6 2 5 4 3 1
6
6 2 5 3 1 4
6
5 2 4 1 3 6
6
6 1 3 2 4 5
6
2 3 4 6 5 ...

output:

result:

wrong answer Jury found better answer than participant (test case 143)