Submission #891317


Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <utility>
#include <string>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)
typedef long long ll;
typedef pair<int,int> pii;
int main(){
    int n;
    cin >> n;
    vector<int>a(n);
    rep(i,n){
        cin >> a[i];
        a[i]--;
    }
    int ans=0;
    rep(i,n){
        if(a[a[i]] == i ){
            ans++;
        }
    }
    cout << ans/2 << endl;
    
    return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User polyomino
Language C++14 (GCC 5.4.1)
Score 200
Code Size 580 Byte
Status AC
Exec Time 30 ms
Memory 640 KB

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 2 ms 256 KB
0_01.txt AC 2 ms 256 KB
0_02.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 30 ms 640 KB
1_02.txt AC 30 ms 640 KB
1_03.txt AC 30 ms 640 KB
1_04.txt AC 30 ms 640 KB
1_05.txt AC 30 ms 640 KB
1_06.txt AC 30 ms 640 KB
1_07.txt AC 30 ms 640 KB
1_08.txt AC 13 ms 384 KB
1_09.txt AC 27 ms 512 KB
1_10.txt AC 21 ms 512 KB
1_11.txt AC 7 ms 256 KB