QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#559497 | #8835. Goodman | Amanicus# | TL | 234ms | 11376kb | C++14 | 759b | 2024-09-11 22:32:38 | 2024-09-11 22:32:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llt __int128_t
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N = 1e2+10;
const int M = 1e6 + 7;
const int MAX = 0x3f3f3f3f;
const ll maxn = 1e18;
ll h,s1,vv,u,mi,mx,fz,fm,ans,item,f;
ll m,n,x,y,x2,y2,z,z2,d,gcd,l,r,T,p,cnt;
ll sum;
ll c[M];
ll a[N];
vector<ll>b;
void solve() {
memset(c,0,sizeof(c));
b.clear();
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
}
for(ll i=1;i<=n;i++){
if(c[i]){
continue;
}
ll k=i;
while(!c[k]){
b.push_back(k);
c[k]=1;
k=a[k];
}
}
for(auto it:b){
cout<<it<<" ";
}
cout<<'\n';
}
int main() {
IOS;
T=1;
cin>>T;
while(T--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 11344kb
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: 0
Accepted
time: 234ms
memory: 11376kb
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 5 6 3 4 1 5 3 6 2 4 1 2 4 3 1 2 3 6 4 5 1 4 3 2 5 6 1 6 3 2 4 5 1 2 5 3 4 1 2 3 6 4 5 1 2 3 4 1 2 6 5 3 4 1 6 4 5 2 3 1 2 3 4 5 6 1 3 2 4 5 6 1 4 2 3 5 6 1 5 6 3 2 4 1 4 2 3 6 5 1 5 6 2 3 4 1 6 3 5 2 4 1 6 3 5 4 2 1 5 4 6 2 3 1 6 3 2 4 5 1 2 3 4 6 5 1 5 2 6 3 4 1 4 2 3 6 5...
result:
ok Correct (873 test cases)
Test #3:
score: -100
Time Limit Exceeded
input:
46233 7 2 1 7 5 3 4 6 7 5 6 2 4 3 7 1 4 3 4 1 2 7 4 5 1 6 3 2 7 8 4 2 6 5 1 3 8 7 8 3 4 8 6 7 5 2 1 7 6 2 4 3 7 1 5 8 8 1 3 2 7 4 6 5 8 6 5 4 2 1 3 7 8 8 8 3 5 6 2 7 1 4 8 7 3 6 1 8 5 2 4 8 2 3 4 5 8 6 1 7 8 5 8 2 4 7 3 1 6 8 3 4 8 2 7 5 6 1 8 2 8 3 5 7 4 6 1 8 8 4 5 7 6 1 2 3 8 5 2 6 3 4 7 8 1 8 2 ...
output:
1 2 3 7 6 4 5 1 5 3 2 6 7 4 1 3 2 4 1 4 6 2 5 3 7 1 4 5 2 3 6 7 8 1 3 8 2 4 6 5 7 1 6 2 3 4 5 7 1 8 5 7 6 4 2 3 1 6 3 4 2 5 7 8 1 8 4 6 7 2 3 5 1 7 2 3 6 5 8 4 1 2 3 4 5 8 7 6 1 5 7 2 8 6 3 4 1 3 8 2 4 5 7 6 1 2 8 3 4 5 7 6 1 8 3 5 6 2 4 7 1 5 4 3 6 7 8 2 1 2 4 7 3 5 6 8 1 5 6 3 2 ...