QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#457747 | #8838. Jesse's Job | ucup-team1525# | WA | 1ms | 3960kb | C++20 | 882b | 2024-06-29 13:53:13 | 2024-06-29 13:53:14 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t;
int n;
const int N=1000005;
int a[N];
vector<int> v;
void dfs(int x)
{
v.push_back(x);
if (a[x]!=1)
dfs(a[x]);
}
int main()
{
scanf("%d",&t);
while (t--)
{
scanf("%d",&n);
for (int i=1;i<=n;++i)
scanf("%d",&a[i]);
v.clear();
dfs(1);
if (v.size()!=n)
{
printf("%d\n%d\n",n,(int)v.size());
sort(v.begin(),v.end());
for (int x:v)
printf("%d ",x);
puts("");
}
else
{
int mnp=1;
for (int i=2;i<=n;++i)
if (abs(mnp-a[mnp])>abs(i-a[i]))
mnp=i;
int ans=n-abs(mnp-a[mnp])-1;
printf("%d\n1\n%d\n",ans,mnp);
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3960kb
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 1 3
result:
ok Correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3916kb
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...
result:
wrong answer Jury found better answer than participant (test case 143)