QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#459140	#8838. Jesse's Job	ucup-team3474^#	WA	40ms	5908kb	C++23	1.7kb	2024-06-29 23:07:44	2024-06-29 23:07:46

Judging History

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

[2024-06-29 23:07:46]
评测

测评结果：WA
用时：40ms
内存：5908kb

查看

[2024-06-29 23:07:44]
提交

answer

#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
const int N=1919810,mod=998244353;
int n,m;
char s[N];
int p[N];
bool tf[N];



void __(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&p[i]);
    for(int i=1;i<=n;i++){
        tf[i]=0;
    }
    int cnt=0;
    int root=-1;
    for(int i=1;i<=n;i++){
        if(p[i]==i){
            root=i;
            break;
        }
    }
    vector<int> v;
    for(int i=1;i<=n;i++){
        int pp=i;
        if(tf[i]) continue;
        vector<int> vv; 
        cnt++;
        while(!tf[pp]){
            // cout<<pp<<endl;
            tf[pp]=1;
            vv.push_back(pp);
            pp=p[pp];

        } 
        if(!v.size()) v=vv;
    }
    if(cnt>=2){
        printf("%d\n",n);
        printf("%d\n",v.size());
        for(auto x:v) printf("%d ",x);
        printf("\n");
    }else{
        
        if(root==-1){
            printf("%d\n",n-2);
            for(int i=1;i<=n;i++){
                if(abs(p[i]-i)==1){
                    puts("1");
                    printf("%d\n",i);
                    return;
                }
            }


            
            for(int i = 2 ; i <= n ; i ++)
                if(p[p[i]] > p[i] and p[i] < i and abs(p[p[i]] - i) <= 1)
                {
                    puts("2");
                    printf("%d %d\n" , min(i,p[i]) , max(i,p[i])) ;
                    return;
                }
        } 
        else{
            printf("%d\n",n);
            puts("1");
            printf("%d\n",root);
            
        } 
    }

}


int main()
{
    int _;
    cin>>_;
    while(_--){
        __();
    }

}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 5908kb

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: 0

Accepted

time: 1ms

memory: 3656kb

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:

ok Correct (872 test cases)

Test #3:

score: -100

Wrong Answer

time: 40ms

memory: 5832kb

input:

46232
7
2 1 7 5 3 6 4
7
5 6 2 4 7 1 3
4
3 4 2 1
7
4 5 1 6 3 7 2
8
4 2 6 5 1 7 3 8
8
3 4 8 7 1 2 5 6
7
6 2 4 3 7 5 1
8
8 1 3 2 7 5 4 6
8
6 5 4 2 1 3 8 7
8
8 3 5 6 2 7 4 1
8
7 3 6 1 8 5 4 2
8
2 3 4 5 8 6 7 1
8
5 8 2 4 7 3 6 1
8
3 4 8 2 7 6 1 5
8
2 8 3 5 7 6 1 4
8
8 4 5 7 6 1 3 2
8
5 2 6 3 4 8 1 7
8
2 ...

output:

7
2
1 2 
7
6
1 5 7 3 2 6 
2
1
3
5
1
6
8
3
1 4 5 
6
7
4
1 6 5 7 
8
7
1 8 6 5 7 4 2 
8
6
1 6 3 4 2 5 
8
2
1 8 
8
3
1 7 4 
8
6
1 2 3 4 5 8 
8
7
1 5 7 6 3 2 8 
8
5
1 3 8 5 7 
8
6
1 2 8 4 5 7 
6
1
5
8
7
1 5 4 3 6 8 7 
8
6
1 2 4 7 6 8 
6
1
5
7
1
1 
8
7
1 2 6 8 4 3 5 
4
1
2
8
1
1 
8
1
1 
8
6
1 6 8 5 3 7 
8...

result:

wrong answer Participant didn't find permutation (test case 6)