Sphere Online Judge

SPOJ Problem Set (classical)

379. Ambiguous Permutations

Problem code: PERMUT2

Some programming contest problems are really tricky: not only do they require a different output format from what you might have expected, but also the sample output does not show the difference. For an example, let us look at permutations.
A permutation of the integers 1 to n is an ordering of these integers. So the natural way to represent a permutation is to list the integers in this order. With n = 5, a permutation might look like 2, 3, 4, 5, 1.
However, there is another possibility of representing a permutation: You create a list of numbers where the i-th number is the position of the integer i in the permutation. Let us call this second possibility an inverse permutation. The inverse permutation for the sequence above is 5, 1, 2, 3, 4.
An ambiguous permutation is a permutation which cannot be distinguished from its inverse permutation. The permutation 1, 4, 3, 2 for example is ambiguous, because its inverse permutation is the same. To get rid of such annoying sample test cases, you have to write a program which detects if a given permutation is ambiguous or not.

Input Specification

The input contains several test cases.
The first line of each test case contains an integer n (1 ≤ n ≤ 100000). Then a permutation of the integers 1 to n follows in the next line. There is exactly one space character between consecutive integers. You can assume that every integer between 1 and n appears exactly once in the permutation.
The last test case is followed by a zero.

Output Specification

For each test case output whether the permutation is ambiguous or not. Adhere to the format shown in the sample output.

Sample Input

1 4 3 2
2 3 4 5 1

Sample Output

not ambiguous

Added by:Adrian Kuegel
Time limit:10s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: NODEJS PERL 6
Resource:own problem, used in University of Ulm Local Contest 2005

hide comments
2014-10-26 15:55:34 Gopesh Tulsyan
easy :P don't think too much
2014-10-17 08:12:55 Bala sai charan
my 100th problem
2014-09-28 22:05:36 Kid Algorist
Exceptionally lenient time limit, should ideally be less than 1s.

Last edit: 2014-09-28 22:18:34
2014-08-16 00:49:41 rituraj
Easy one to reach at my 30th :)
2014-08-04 03:12:08 Ashwin Menon
Even mine...
@Shubham Jain

1 3 2 6 4 5

Says ambiguous with this, when it should say not ambiguous, still AC.
2014-06-27 19:37:09 Shubham Jain
i sbmittd it on codechef
wen i was doing ds question again
got my mistake
2014-06-27 19:36:18 Shubham Jain
check on dis
1 4 3 2 5 7 8 6 9 10
i made a mistake in dis code bt it got submitted
check on d above test case
2014-06-25 06:32:20 drfgthyjuikjhgftrd
why it is giving wa :(
2014-06-07 15:44:36 sHaShAnK sHeKhAr
@novicecoder: it can be simply done in O(n).Think of a different approach.

Last edit: 2014-06-07 15:45:24
2014-05-26 08:49:28 Saniya Najeeb
The spelling of ambiguous cost me a WA! :-/
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.