Submission #891633


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int a[100001];
int main(){
	int n;
	cin >> n;
	REP(i,n) cin >> a[i];
	int cnt = 0;
	REP(i,n){
		if(a[a[i]-1] == i+1) cnt++;
	} 
	cout << cnt/2 << endl;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User lp6m
Language C++14 (GCC 5.4.1)
Score 200
Code Size 653 Byte
Status AC
Exec Time 35 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 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 2 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 35 ms 640 KB
1_02.txt AC 35 ms 640 KB
1_03.txt AC 35 ms 640 KB
1_04.txt AC 35 ms 640 KB
1_05.txt AC 35 ms 640 KB
1_06.txt AC 35 ms 640 KB
1_07.txt AC 34 ms 640 KB
1_08.txt AC 15 ms 384 KB
1_09.txt AC 29 ms 512 KB
1_10.txt AC 25 ms 512 KB
1_11.txt AC 8 ms 256 KB