Freshman's Database

#include <iostream>
#include <cstring>
using namespace std;
static const int N =1E6+1;
int n, val, ink[N]; 
bool visited[N], visited_this[N];
int main() {
    cin >> n;
    for (int i=0; i<n; i++) {
        int val;
        cin >> val;
        ink[i+1] = val;
    }
    int cnt = 0;
    for (int i=1; i<=n; i++) {
        if (visited[i]) continue;
        int j = i;
        cnt++;
        while (!visited[j]) {
            visited_this[j] = true;
            visited[j] = true;
            j = ink[j];
        }
        if (!visited_this[j]) cnt--; 
        memset(visited_this, 0, sizeof(visited_this));
    }
    cout << cnt << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED