Submission details
Task:Freshman's Database
Sender:team_a
Submission time:2020-10-03 13:37:02 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#20.01 sdetails
#30.32 sdetails
#40.36 sdetails
#50.36 sdetails
#60.36 sdetails
#70.36 sdetails
#80.36 sdetails
#90.36 sdetails
#100.36 sdetails

Code

#include <iostream>

using namespace std;


int main() {
    int n;
    cin >> n;

    int c = 0;
    
    std::ios::sync_with_stdio(true);

    int *p = new int[n];
    int *v = new int[n];
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        v[i] = 0;
    }

    for(int i = 0; i <  n; i++) {
        if (v[i]) continue; // HAS BEEN VISITED
        int j = p[i];
        while(j != i && !v[j]) {
            v[j] = 1;
            j = p[j];
        }
        if (j == i) c++;
    }

    cout << c << endl;
    
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
16
2 3 4 5 6 1 4 7 7 4 12 11 14 1...

correct output
3

user output
3

Test 2

Verdict:

input
2
2 1

correct output
1

user output
2

Test 3

Verdict:

input
1000000
906853 1 1 1 3 4 3 2 5 5 5 10 ...

correct output
1

user output
14

Test 4

Verdict:

input
1000000
227998 891986 290950 887622 37...

correct output
6736

user output
0

Test 5

Verdict:

input
1000000
832833 455297 341097 88590 258...

correct output
16

user output
0

Test 6

Verdict:

input
1000000
635299 635243 476863 88031 195...

correct output
73

user output
0

Test 7

Verdict:

input
1000000
444011 366349 710148 901981 81...

correct output
244

user output
0

Test 8

Verdict:

input
1000000
248398 271880 881725 521008 33...

correct output
332

user output
1

Test 9

Verdict:

input
999999
938280 731633 536902 381480 65...

correct output
6771

user output
0

Test 10

Verdict:

input
999999
196127 288846 245904 406819 13...

correct output
105

user output
0