Submission #1231167


Source Code Expand

/* 09:26 - 09:29 */

#include <iostream>
#include <vector>

using namespace std;

int main(void) {

	int n; cin >> n;
	vector<int> like(n);

	for (int i = 0; i < n; ++i) {
		cin >> like[i];
		--like[i];
	}

	int count = 0;
	for (int i = 0; i < n; ++i) {
		count += (like[like[i]] == i);
	}

	cout << count / 2 << endl;
	return 0;

}

Submission Info

Submission Time
Task B - Friendly Rabbits
User indcn20171018
Language C++14 (GCC 5.4.1)
Score 200
Code Size 357 Byte
Status AC
Exec Time 29 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 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 AC 29 ms 640 KB
1_02.txt AC 29 ms 640 KB
1_03.txt AC 29 ms 640 KB
1_04.txt AC 29 ms 640 KB
1_05.txt AC 29 ms 640 KB
1_06.txt AC 29 ms 640 KB
1_07.txt AC 29 ms 640 KB
1_08.txt AC 11 ms 384 KB
1_09.txt AC 24 ms 512 KB
1_10.txt AC 21 ms 512 KB
1_11.txt AC 5 ms 256 KB