QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#710690 | #8838. Jesse's Job | liaoyd | WA | 1ms | 3612kb | C++23 | 1.2kb | 2024-11-04 21:02:10 | 2024-11-04 21:02:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define pb push_back
#define pir pair<int, int>
const int P = 1e9 + 7;
const int N = 1e3 + 7;
const int inf = 0x3f3f3f3f3f3f3f3f; // longlong
const int ing = 1e18;
// const int mod = 998244353;
// cout << fixed << setprecision(5) << number << endl;
// tuple
//prev(it) next(it)
const int mod = 1e9 + 7;
int n, m, k;
int ax, bx, ay, by;
void solve()
{
cin >> n;
vector<int> vis(n + 1,0);
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int u = a[1], cnt = 1; vis[1] = 1;
//cout<<u<<" "<<vis[u]<<"?\n";
while (vis[u]==0) {
vis[u] = 1;
u=a[u];
cnt++;
}
if (cnt < n) {
cout << n << "\n" << cnt << "\n";
for (int i = 1; i <= n; i++) {
if (vis[i]) {
cout << i << " ";
}
}
cout << "\n"; return;
}
else {
cout << n - 2 << "\n";
vector<int> ans;
ans.push_back({ 1 });
int k = a[1];
while (a[k] != 2) {
ans.push_back({ k }); k = a[k];
}
for (auto e : ans) {
cout << e << " ";
}
cout << "\n";
}
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int _ = 1;
cin >> _;
while (_--)
{
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
3 2 2 1 4 2 1 4 3 6 3 5 4 2 6 1
output:
0 1 2 4 2 1 2 4 1 3
result:
ok Correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3596kb
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 6 2 1 3 6 1 1 6 1 1 6 1 1 ...
result:
wrong answer Participant didn't find permutation (test case 25)