Submission #2242358


Source Code Expand

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,P> PP;

//-----------------------------------------------------------------------------

int n,a[100000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	FOR(i,1,n+1) {
		cin>>a[i];
	}
	int cnt=0;
	FOR(i,1,n+1) {
		if(a[a[i]]==i) cnt++;
	}
	cout<<cnt/2<<endl;

	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User moko_freedom
Language C++14 (GCC 5.4.1)
Score 0
Code Size 734 Byte
Status WA
Exec Time 9 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
AC × 11
WA × 4
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt WA 9 ms 640 KB
1_02.txt AC 9 ms 640 KB
1_03.txt WA 9 ms 640 KB
1_04.txt WA 9 ms 640 KB
1_05.txt WA 9 ms 640 KB
1_06.txt AC 9 ms 640 KB
1_07.txt AC 9 ms 640 KB
1_08.txt AC 4 ms 384 KB
1_09.txt AC 8 ms 640 KB
1_10.txt AC 7 ms 512 KB
1_11.txt AC 2 ms 384 KB