Submission #890785


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> PII;
typedef long long ll;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pct __builtin_popcount

#define N 100100
int n, a[N];

int main () {
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	int S = 0;
	for (int i = 1; i <= n; i ++)
		if (a[a[i]] == i) S ++;
	cout << S/2 << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User sevenkplus
Language C++14 (GCC 5.4.1)
Score 200
Code Size 435 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 3 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 35 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 640 KB
1_11.txt AC 8 ms 256 KB