#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> s;
vector<int> state; // 0 = nem látogatot, 1 = látogatjuk, 2 = megvan
void dfs(int u, int &cycles) {
state[u] = 1;
int v = s[u];
if (state[v] == 0) {
dfs(v, cycles);
} else if (state[v] == 1) {
cycles++;
}
state[u] = 2;
}
int count_cycles() {
int cycles = 0;
for (int i = 1; i <= n; i++) {
if (state[i] == 0) {
dfs(i, cycles);
}
}
return cycles;
}
void print_seating() {
for (int i = 1; i <= n; i++) {
cout << i << " ";
}
cout << "\n";
}
int main() {
cin >> n;
s.resize(n + 1);
state.assign(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
int cycles = count_cycles();
int M = n - cycles;
cout << M << "\n";
print_seating();
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Wrong answer | 1ms | 500 KiB | ||||
| 2 | Wrong answer | 4ms | 316 KiB | ||||
| subtask2 | 0/5 | ||||||
| 3 | Wrong answer | 1ms | 500 KiB | ||||
| 4 | Wrong answer | 1ms | 316 KiB | ||||
| 5 | Wrong answer | 1ms | 316 KiB | ||||
| 6 | Partially correct | 1ms | 316 KiB | ||||
| 7 | Partially correct | 1ms | 316 KiB | ||||
| subtask3 | 0/5 | ||||||
| 8 | Wrong answer | 1ms | 316 KiB | ||||
| 9 | Wrong answer | 1ms | 316 KiB | ||||
| 10 | Wrong answer | 1ms | 500 KiB | ||||
| 11 | Wrong answer | 1ms | 368 KiB | ||||
| 12 | Wrong answer | 1ms | 328 KiB | ||||
| subtask4 | 0/5 | ||||||
| 13 | Wrong answer | 1ms | 552 KiB | ||||
| 14 | Wrong answer | 1ms | 316 KiB | ||||
| 15 | Wrong answer | 1ms | 508 KiB | ||||
| 16 | Wrong answer | 1ms | 316 KiB | ||||
| 17 | Wrong answer | 1ms | 316 KiB | ||||
| subtask5 | 5/10 | ||||||
| 18 | Partially correct | 1ms | 316 KiB | ||||
| 19 | Partially correct | 1ms | 316 KiB | ||||
| 20 | Partially correct | 2ms | 316 KiB | ||||
| 21 | Partially correct | 1ms | 316 KiB | ||||
| 22 | Partially correct | 1ms | 316 KiB | ||||
| 23 | Partially correct | 1ms | 316 KiB | ||||
| 24 | Partially correct | 1ms | 316 KiB | ||||
| 25 | Partially correct | 1ms | 316 KiB | ||||
| 26 | Partially correct | 4ms | 472 KiB | ||||
| 27 | Partially correct | 4ms | 476 KiB | ||||
| subtask6 | 5/10 | ||||||
| 28 | Partially correct | 2ms | 316 KiB | ||||
| 29 | Partially correct | 2ms | 316 KiB | ||||
| 30 | Partially correct | 3ms | 500 KiB | ||||
| 31 | Partially correct | 3ms | 508 KiB | ||||
| 32 | Partially correct | 3ms | 316 KiB | ||||
| 33 | Partially correct | 3ms | 564 KiB | ||||
| 34 | Partially correct | 3ms | 564 KiB | ||||
| 35 | Partially correct | 4ms | 568 KiB | ||||
| 36 | Partially correct | 4ms | 564 KiB | ||||
| 37 | Partially correct | 4ms | 564 KiB | ||||
| subtask7 | 0/40 | ||||||
| 38 | Wrong answer | 2ms | 316 KiB | ||||
| 39 | Wrong answer | 2ms | 508 KiB | ||||
| 40 | Wrong answer | 3ms | 316 KiB | ||||
| 41 | Wrong answer | 3ms | 316 KiB | ||||
| 42 | Wrong answer | 3ms | 316 KiB | ||||
| 43 | Wrong answer | 3ms | 480 KiB | ||||
| 44 | Wrong answer | 4ms | 316 KiB | ||||
| 45 | Wrong answer | 4ms | 508 KiB | ||||
| 46 | Wrong answer | 4ms | 316 KiB | ||||
| 47 | Wrong answer | 4ms | 316 KiB | ||||
| 48 | Wrong answer | 4ms | 316 KiB | ||||
| 49 | Wrong answer | 4ms | 316 KiB | ||||
| 50 | Wrong answer | 4ms | 472 KiB | ||||
| 51 | Wrong answer | 4ms | 316 KiB | ||||
| 52 | Wrong answer | 4ms | 316 KiB | ||||
| 53 | Wrong answer | 4ms | 564 KiB | ||||
| 54 | Wrong answer | 4ms | 500 KiB | ||||
| 55 | Wrong answer | 4ms | 408 KiB | ||||
| 56 | Wrong answer | 4ms | 508 KiB | ||||
| 57 | Wrong answer | 4ms | 512 KiB | ||||