Problem:
Score : 800 points

Problem Statement

There is a directed graph with N vertices and N edges. The vertices are numbered 1, 2, ..., N.

The graph has the following N edges: (p_1, 1), (p_2, 2), ..., (p_N, N), and the graph is weakly connected. Here, an edge from Vertex u to Vertex v is denoted by (u, v), and a weakly connected graph is a graph which would be connected if each edge was bidirectional.

We would like to assign a value to each of the vertices in this graph so that the following conditions are satisfied. Here, a_i is the value assigned to Vertex i.

Each a_i is a non-negative integer.

For each edge (i, j), a_i \neq a_j holds.

For each i and each integer x(0 ≤ x < a_i), there exists a vertex j such that the edge (i, j) exists and x = a_j holds.

Determine whether there exists such an assignment.

Constraints

2 ≤ N ≤ 200 000

1 ≤ p_i ≤ N

p_i \neq i

The graph is weakly connected.

Input

Input is given from Standard Input in the following format:

N
p_1 p_2 ... p_N

Output

If the assignment is possible, print POSSIBLE; otherwise, print IMPOSSIBLE.

Sample Input 1

4
2 3 4 1

Sample Output 1

POSSIBLE

The assignment is possible: {a_i} = {0, 1, 0, 1} or {a_i} = {1, 0, 1, 0}.

Sample Input 2

3
2 3 1

Sample Output 2

IMPOSSIBLE

Sample Input 3

4
2 3 1 1

Sample Output 3

POSSIBLE

The assignment is possible: {a_i} = {2, 0, 1, 0}.

Sample Input 4

6
4 5 6 5 6 4

Sample Output 4

IMPOSSIBLE

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::collections::BTreeSet;

fn main() {
    let s = std::io::stdin();
    let mut sc = Scanner { reader: s.lock() };

    let n = sc.read();
    let mut graph = vec![vec![]; n];
    let mut parents = vec![0; n];
    for i in 0..n {
        let p = sc.read::<usize>() - 1;
        graph[p].push(i);
        parents[i] = p;
    }

    let mut leaf = n;
    for i in 0..n {
        if graph[i].is_empty() {
            leaf = i;
            break;
        }
    }

    if leaf == n {
        // big one cycle
        if n % 2 == 0 {
            println!("POSSIBLE");
        } else {
            println!("IMPOSSIBLE");
        }
        return;
    }

    let mut vis = vec![false; n];
    vis[leaf] = true;
    let mut cur = parents[leaf];
    loop {
        if vis[cur] {
            break;
        }
        vis[cur] = true;
        cur = parents[cur];
    }

    let mut is_cycle = vec![false; n];
    loop {
        if is_cycle[cur] {
            break;
        }
        is_cycle[cur] = true;
        cur = parents[cur];
    }

    let mut grundy = vec![n; n];
    for i in 0..n {
        if is_cycle[i] {
            for &next in graph[i].iter() {
                if !is_cycle[next] {
                    dfs(next, &graph, &mut grundy);
                }
            }
        }
    }

    let mut first = n;
    for i in 0..n {
        if is_cycle[i] {
            first = i;
            break;
        }
    }
    let second = parents[first];

    if solve(first, grundy.clone(), &parents, &graph) || solve(second, grundy, &parents, &graph) {
        println!("POSSIBLE");
    } else {
        println!("IMPOSSIBLE");
    }
}

fn solve(v: usize, mut grundy: Vec<usize>, parents: &Vec<usize>, graph: &Vec<Vec<usize>>) -> bool {
    let mut cur = v;
    loop {
        let mut set = BTreeSet::new();
        for &next in graph[cur].iter() {
            set.insert(grundy[next]);
        }
        for i in 0.. {
            if !set.contains(&i) {
                grundy[cur] = i;
                break;
            }
        }
        cur = parents[cur];
        if cur == v {
            break;
        }
    }
    let mut set = BTreeSet::new();
    for &next in graph[v].iter() {
        set.insert(grundy[next]);
    }
    for i in 0.. {
        if !set.contains(&i) {
            if grundy[v] == i {
                return true;
            } else {
                return false;
            }
        }
    }
    unreachable!()
}

fn dfs(v: usize, graph: &Vec<Vec<usize>>, grundy: &mut Vec<usize>) {
    let mut set = BTreeSet::new();
    for &next in graph[v].iter() {
        dfs(next, graph, grundy);
        set.insert(grundy[next]);
    }
    for i in 0.. {
        if set.contains(&i) {
            continue;
        }
        grundy[v] = i;
        break;
    }
}

pub struct Scanner<R> {
    reader: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .reader
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n')
            .take_while(|&b| b != b' ' && b != b'\n')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}