QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#480354 | #8838. Jesse's Job | ucup-team4361# | WA | 1ms | 7980kb | C++14 | 849b | 2024-07-16 14:31:50 | 2024-07-16 14:31:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0' && c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
const int N=1e6+5;
int n;
int p[N];
bool vis[N];
int len=0, re[N];
int main()
{
int T=read();
while(T--)
{
n=read();
for(int i=1;i<=n;i++) p[i]=read(), vis[i]=false;
int now=1;
len=0;
while(!vis[now])
{
re[++len]=now;
vis[now]=true;
now=p[now];
}
if(len!=n)
{
printf("%d\n",n);
printf("%d\n",len);
for(int i=1;i<=len;i++) printf("%d ",re[i]);
printf("\n");
}
else
{
printf("%d\n",n-2);
printf("%d\n",len/2);
for(int i=1;i<=len/2;i++) printf("%d ",re[i]);
printf("\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 7980kb
input:
3 2 2 1 4 2 1 4 3 6 3 5 4 2 6 1
output:
0 1 1 4 2 1 2 4 3 1 3 4
result:
ok Correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 5868kb
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 5 4 3 4 2 1 2 6 3 1 2 3 6 4 1 4 6 3 6 4 1 6 5 4 5 2 1 2 6 1 1 4 2 1 2 6 1 1 6 3 1 6 2 6 2 1 2 6 2 1 3 6 5 1 4 3 5 2 6 3 1 5 3 6 3 1 4 2 6 3 1 5 2 6 2 1 6 6 5 1 6 4 3 5 6 4 1 5 3 4 6 5 1 6 5 4 2 6 5 1 2 3 4 6 6 5 1 5 3 2 6 6 2 1 4 4 3 1 4 2 6 2 1 3 6 1 1 6 1 1 ...
result:
wrong answer Participant didn't find permutation (test case 25)