QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#522781	#8838. Jesse's Job	ucup-team3723^#	WA	1ms	3664kb	C++17	1.1kb	2024-08-17 13:57:55	2024-08-17 13:57:55

Judging History

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

[2024-08-17 13:57:55]
评测

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

查看

[2024-08-17 13:57:55]
提交

answer

#include <bits/stdc++.h>

using namespace std;
using ll = long long;


void solve() {
    int n;
    cin >> n;
    vector<int> p(n);
    for (int i = 0; i < n; i++) cin >> p[i];
    for (int i = 0; i < n; i++) --p[i];

    vector<bool> used(n);
    int tmp = 0;
    vector<int> ans;
    while (!used[tmp]) {
        used[tmp] = true;
        ans.push_back(tmp);
        tmp = p[tmp];
    }

    if (ans.size() < n) {
        cout << n << endl;
        cout << ans.size() << endl;
        sort(ans.begin(),ans.end());
        for (int i = 0; i < ans.size(); i++) {
            cout << ans[i]+1 << " \n"[i == ans.size()-1];
        }
    }
    else {
        int ret = INT_MAX;
        int pos = -1;
        for (int i = 0; i < n; i++) {
            if (ret > abs(p[i]-i)) {
                pos = i;
                ret = abs(p[i]-i);
            }
        }
        ret = n-1 - ret;
        cout << ret << endl;
        cout << 1 << endl;
        cout << pos+1 << endl;
    }
}

int main(void) {
    int t;
    cin >> t;

    while (t--) {
        solve();
    }
    
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3624kb

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

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:

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

result:

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