codeforces-scrape

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

884C.md (2331B)


      1 Source: https://codeforces.com/problemset/problem/884/C
      2 
      3 C. Bertown Subway
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
     22 
     23 There are *n* stations in the subway. It was built according to the Bertown Transport Law:
     24 
     25 1. For each station *i* there exists exactly one train that goes from this station. Its destination station is *p**i*, possibly *p**i* = *i*;
     26 2. For each station *i* there exists exactly one station *j* such that *p**j* = *i*.
     27 
     28 The President will consider the convenience of subway after visiting it. The convenience is the number of ordered pairs (*x*, *y*) such that person can start at station *x* and, after taking some subway trains (possibly zero), arrive at station *y* (1 ≤ *x*, *y* ≤ *n*).
     29 
     30 The mayor of Bertown thinks that if the subway is not convenient enough, then the President might consider installing a new mayor (and, of course, the current mayor doesn't want it to happen). Before President visits the city mayor has enough time to rebuild some paths of subway, thus changing the values of *p**i* for not more than two subway stations. Of course, breaking the Bertown Transport Law is really bad, so the subway must be built according to the Law even after changes.
     31 
     32 The mayor wants to do these changes in such a way that the convenience of the subway is maximized. Help him to calculate the maximum possible convenience he can get!
     33 
     34 Input
     35 
     36 The first line contains one integer number *n* (1 ≤ *n* ≤ 100000) — the number of stations.
     37 
     38 The second line contains *n* integer numbers *p*1, *p*2, ..., *p**n* (1 ≤ *p**i* ≤ *n*) — the current structure of the subway. All these numbers are distinct.
     39 
     40 Output
     41 
     42 Print one number — the maximum possible value of convenience.
     43 
     44 Examples
     45 
     46 Input
     47 
     48 ```
     49 3  
     50 2 1 3
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 9
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 5  
     63 1 5 4 3 2
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 17
     70 ```
     71 
     72 Note
     73 
     74 In the first example the mayor can change *p*2 to 3 and *p*3 to 1, so there will be 9 pairs: (1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3).
     75 
     76 In the second example the mayor can change *p*2 to 4 and *p*3 to 5.