QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #762556 | #8835. Goodman | Esouling | WA | 0ms | 3776kb | C++20 | 661b | 2024-11-19 15:31:12 | 2024-11-19 15:31:13 |
Judging History
answer
#include <bits/stdc++.h>
void solve() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), vis(n + 1);
for (int i = 1; i <= n; i ++) {
std::cin >> a[i];
}
std::vector<int> ans;
for (int i = 1; i <= n; i ++) {
if (vis[i]) continue;
int cur = i;
ans.emplace_back(i);
vis[i] = 1;
while (!vis[a[cur]]) {
vis[a[cur]] = 1;
ans.emplace_back(a[cur]);
}
}
for (int i = 0; i < n; i ++) {
std::cout << ans[i] << " \n"[i == n - 1];
}
}
int main() {
int t;
std::cin >> t;
while (t --) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: -100
Wrong Answer
time: 0ms
memory: 3776kb
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 3 4 6 1 5 2 3 6 4 1 2 4 3 1 2 3 6 4 5 1 4 2 5 3 6 1 6 2 3 4 5 1 2 5 3 4 1 2 3 6 4 5 1 2 3 4 1 2 6 3 4 5 1 6 2 3 4 5 1 2 3 4 5 6 1 3 2 4 5 6 1 4 2 3 5 6 1 5 2 3 4 6 1 4 2 3 6 5 1 5 2 3 4 6 1 6 2 3 5 4 1 6 2 3 5 4 1 5 2 3 4 6 1 6 2 3 4 5 1 2 3 4 5 6 1 5 2 6 3 4 1 4 2 3 6 5 1 4 2 3 5 6 1 3 2 4 6 ...
result:
wrong answer Jury found better answer than participant (test case 1)