codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

347B.md (1460B)


      1 Source: https://codeforces.com/problemset/problem/347/B
      2 
      3 B. Fixed Points
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 A permutation of length *n* is an integer sequence such that each integer from 0 to (*n* - 1) appears exactly once in it. For example, sequence [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] are not.
     22 
     23 A fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer *i* is a fixed point of permutation *a*0, *a*1, ..., *a**n* - 1 if and only if *a**i* = *i*. For example, permutation [0, 2, 1] has 1 fixed point and permutation [0, 1, 2] has 3 fixed points.
     24 
     25 You are given permutation *a*. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation.
     26 
     27 Input
     28 
     29 The first line contains a single integer *n* (1 ≤ *n* ≤ 105). The second line contains *n* integers *a*0, *a*1, ..., *a**n* - 1 — the given permutation.
     30 
     31 Output
     32 
     33 Print a single integer — the maximum possible number of fixed points in the permutation after at most one swap operation.
     34 
     35 Examples
     36 
     37 Input
     38 
     39 ```
     40 5  
     41 0 1 3 4 2
     42 ```
     43 
     44 Output
     45 
     46 ```
     47 3
     48 ```