QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#457785	#8838. Jesse's Job	ucup-team3678^#	WA	1ms	5916kb	C++14	1.6kb	2024-06-29 14:03:11	2024-06-29 14:03:11

Judging History

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

[2024-06-29 14:03:11]
评测

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

查看

[2024-06-29 14:03:11]
提交

answer

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int p[N], vis[N];

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", &p[i]), vis[i] = 0;
        int flg = 0;
        for (int i = 1; i <= n; ++i) if (p[i] == i) {
            printf("%d\n", n);
            printf("%d\n", n - 1);
            for (int j = 1; j <= n; ++j) {
                if (j != i) printf("%d ", j);
            }
            puts("");
            flg = 1;
            break;
        }
        if (flg) continue;
        for (int i = 1; i <= n; ++i) {
            if (!vis[i]) {
                vector<int> p;
                while (!vis[i]) {
                    vis[i] = 1;
                    p.push_back(i), i = ::p[i];
                }
                if (p.size() < n) {
                    printf("%d\n", n);
                    printf("%d\n", p.size());
                    for (auto x : p) {
                        printf("%d ", x);
                    }
                    puts("");
                    flg = 1;
                    break;
                }
            }
        }
        if (flg) continue;
        pair<int, int> res = make_pair(0, 0);
        for (int i = 1; i <= n; ++i) {
            res = max(res, make_pair(n - abs(p[i] - i) - 1, i));
        }
        printf("%d\n", res.first);
        printf("%d\n", n - 1);
        for (int i = 1; i <= n; ++i) {
            if (i != res.second) {
                printf("%d ", i);
            }
        }
        puts("");
    }
    return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 5916kb

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

memory: 5840kb

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)