QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#457756 | #8838. Jesse's Job | ucup-team896# | WA | 1ms | 5524kb | C++14 | 991b | 2024-06-29 13:56:51 | 2024-06-29 13:56:51 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+7,inf=1e18;
int T,n,p[N],cnt=0;
bool vis[N];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>T;
while(T--){
cin>>n;
for(int i=1;i<=n;i++){
cin>>p[i];
vis[i]=0;
}
int nw=1;cnt=0;
while(!vis[nw]){
vis[nw]=1;
nw=p[nw];
cnt++;
}
if(cnt==n){
int minn=N,ps=-1;
for(int i=1;i<=n;i++){
if(abs(p[i]-i)<minn){
minn=abs(p[i]-i);
ps=i;
}
}
cout<<n-minn-1<<"\n";
cout<<"1\n";
cout<<ps<<"\n";
}else{
cout<<n<<"\n";
cout<<cnt<<"\n";
for(int i=1;i<=n;i++)
if(vis[i])cout<<i<<" ";
cout<<"\n";
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5524kb
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: 3588kb
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)