Submission #891942

Source Code Expand

#include <bits/stdc++.h>
//#include <stdio.h>
#define ll long long
#define S second
#define F first
using namespace std;
const ll N = 1e5 + 100, P = 1e9 + 7;

int n;
int t[N];

int main(){
    ios_base::sync_with_stdio(false);
   // freopen("crypt.in", "r", stdin);
   // freopen("crypt.out", "w", stdout);
    ll ans = 0;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> t[i];
    }
    for(int i = 1; i <= n; i++){
        if(t[t[i]] == i) ans++;
    }
    cout << ans / 2;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User klinchuh
Language C++14 (GCC 5.4.1)
Score 200
Code Size 516 Byte
Status AC
Exec Time 11 ms
Memory 640 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 256 KiB
0_01.txt AC 3 ms 256 KiB
0_02.txt AC 2 ms 256 KiB
1_00.txt AC 3 ms 256 KiB
1_01.txt AC 11 ms 640 KiB
1_02.txt AC 11 ms 640 KiB
1_03.txt AC 11 ms 640 KiB
1_04.txt AC 11 ms 640 KiB
1_05.txt AC 11 ms 640 KiB
1_06.txt AC 11 ms 640 KiB
1_07.txt AC 11 ms 640 KiB
1_08.txt AC 6 ms 384 KiB
1_09.txt AC 10 ms 640 KiB
1_10.txt AC 8 ms 512 KiB
1_11.txt AC 4 ms 384 KiB