codeforces-scrape

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

1027D.md (3146B)


      1 Source: https://codeforces.com/problemset/problem/1027/D
      2 
      3 D. Mouse Hunt
      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 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Medicine faculty of Berland State University has just finished their admission campaign. As usual, about $80\%$ of applicants are girls and majority of them are going to live in the university dormitory for the next $4$ (hopefully) years.
     22 
     23 The dormitory consists of $n$ rooms and a single mouse! Girls decided to set mouse traps in some rooms to get rid of the horrible monster. Setting a trap in room number $i$ costs $c_i$ burles. Rooms are numbered from $1$ to $n$.
     24 
     25 Mouse doesn't sit in place all the time, it constantly runs. If it is in room $i$ in second $t$ then it will run to room $a_i$ in second $t + 1$ without visiting any other rooms inbetween ($i = a_i$ means that mouse won't leave room $i$). It's second $0$ in the start. If the mouse is in some room with a mouse trap in it, then the mouse get caught into this trap.
     26 
     27 That would have been so easy if the girls actually knew where the mouse at. Unfortunately, that's not the case, mouse can be in any room from $1$ to $n$ at second $0$.
     28 
     29 What it the minimal total amount of burles girls can spend to set the traps in order to guarantee that the mouse will eventually be caught no matter the room it started from?
     30 
     31 Input
     32 
     33 The first line contains as single integers $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of rooms in the dormitory.
     34 
     35 The second line contains $n$ integers $c_1, c_2, \dots, c_n$ ($1 \le c_i \le 10^4$) — $c_i$ is the cost of setting the trap in room number $i$.
     36 
     37 The third line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$) — $a_i$ is the room the mouse will run to the next second after being in room $i$.
     38 
     39 Output
     40 
     41 Print a single integer — the minimal total amount of burles girls can spend to set the traps in order to guarantee that the mouse will eventually be caught no matter the room it started from.
     42 
     43 Examples
     44 
     45 Input
     46 
     47 ```
     48 5  
     49 1 2 3 2 10  
     50 1 3 4 3 3
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 3
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 4  
     63 1 10 2 10  
     64 2 4 2 2
     65 ```
     66 
     67 Output
     68 
     69 ```
     70 10
     71 ```
     72 
     73 Input
     74 
     75 ```
     76 7  
     77 1 1 1 1 1 1 1  
     78 2 2 2 3 6 7 6
     79 ```
     80 
     81 Output
     82 
     83 ```
     84 2
     85 ```
     86 
     87 Note
     88 
     89 In the first example it is enough to set mouse trap in rooms $1$ and $4$. If mouse starts in room $1$ then it gets caught immideately. If mouse starts in any other room then it eventually comes to room $4$.
     90 
     91 In the second example it is enough to set mouse trap in room $2$. If mouse starts in room $2$ then it gets caught immideately. If mouse starts in any other room then it runs to room $2$ in second $1$.
     92 
     93 Here are the paths of the mouse from different starts from the third example:
     94 
     95 * $1 \rightarrow 2 \rightarrow 2 \rightarrow \dots$;
     96 * $2 \rightarrow 2 \rightarrow \dots$;
     97 * $3 \rightarrow 2 \rightarrow 2 \rightarrow \dots$;
     98 * $4 \rightarrow 3 \rightarrow 2 \rightarrow 2 \rightarrow \dots$;
     99 * $5 \rightarrow 6 \rightarrow 7 \rightarrow 6 \rightarrow \dots$;
    100 * $6 \rightarrow 7 \rightarrow 6 \rightarrow \dots$;
    101 * $7 \rightarrow 6 \rightarrow 7 \rightarrow \dots$;
    102 
    103 So it's enough to set traps in rooms $2$ and $6$.