QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#458724	#8835. Goodman	ucup-team3608^#	WA	1ms	3612kb	C++17	877b	2024-06-29 18:43:05	2024-06-29 18:43:06

Judging History

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

[2024-06-29 18:43:06]
评测

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

查看

[2024-06-29 18:43:05]
提交

answer

#include"bits/stdc++.h"
#include"bits/stdc++.h"

using lint = int64_t;

using namespace std;

void solve(){
    int n; cin>>n;
    vector<int> p(n), rev(n);
    vector<bool> used(n);
    for(int i = 0; i <n; i++){
        cin>>p[i];
        p[i]--;
        rev[p[i]] = i;
    }
    vector<int> ans; ans.reserve(n);
    for(int i = 0; i <n; i++){
        int r = rev[i];
        if(!used[r] && !used[i]){
            ans.push_back(i);
            if(i != r)
                ans.push_back(r);
            //cerr<<"i "<<i<<endl;
            used[r] = used[i] = true;
        }
    }
    for(int i = 0; i <n; i++){
        if(!used[i]) ans.push_back(i);
    }
    for(int a : ans) cout<<a+1<<" ";
    cout<<"\n";
    
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    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: 0ms

memory: 3612kb

input:

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

output:

1 2 3 4 
1 6 2 5 3 4

result:

ok Correct (2 test cases)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3504kb

input:

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

output:

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

result:

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