PERMUT2 - Ambiguous Permutations
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
4 1 4 3 2 5 2 3 4 5 1 1 1 0
Sample Output
ambiguous not ambiguous ambiguous
hide comments
mohit_010:
2021-11-13 06:53:28
AC in second go
|
|
the_art_maniac:
2021-05-31 01:19:14
much needed confidence booster :(: |
|
coolboy7:
2020-06-02 20:55:16
abe kafi easy hai... ac in one go se kya mil rha h tum logo ko... |
|
saraswat000:
2019-08-27 21:22:05
Ac in one go! |
|
sarthak_1998:
2019-05-20 16:16:29
Did the question with structs in c++ which made the question quite easy. |
|
markaman:
2018-12-30 16:20:59
Just read problem statement carefully
|
|
cypher33:
2018-12-28 14:13:55
Easy question hai chutiyon AC in 1 go likh ke khush kya ho ja rahe ho... |
|
bugsbunnyo1:
2018-11-24 18:32:49
Be careful, wrote non instead of non resulted in WA! |
|
kundannayak51:
2018-10-17 13:10:30
wasted 3 hour because I was taking input of no. of testcases from user as we normally do in competitive coding.
|
|
phoemur:
2018-09-11 18:16:31
AC in std::numeric_limits<unsigned long long>::max() go !!! |
Added by: | Adrian Kuegel |
Date: | 2005-06-24 |
Time limit: | 10s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 VB.NET |
Resource: | own problem, used in University of Ulm Local Contest 2005 |