QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#462275 | #8835. Goodman | ucup-team2307# | WA | 0ms | 3876kb | C++20 | 1017b | 2024-07-03 16:54:17 | 2024-07-03 16:54:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
#define int ll
const int mod = 1e9+7;
//int bpow(int a, int b)
//{
//
//}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int q;
cin>>q;
while (q--)
{
int n;
cin>>n;
vector<int> p(n+1);
for (int i=1; i<=n; i++)
cin>>p[i];
vector<int> q(n+1);
for (int i=1; i<=n; i++)
if (q[i] == 0)
{
vector<int> v;
int c = i;
while (true)
{
v.pb(c);
c = p[c];
if (c == i)
break;
}
int m = v.size();
for (int j=0; j<m; j++)
q[v[j]] = p[v[(j+1)%m]];
}
for (int i=1; i<=n; i++)
cout<<q[i]<<" ";
cout<<"\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3876kb
input:
2 4 1 2 3 4 6 6 5 4 3 2 1
output:
1 2 3 4 1 2 3 4 5 6
result:
wrong answer Jury found better answer than participant (test case 2)