Submission #3784650


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std ;

typedef long long ll ;
#define rep (i , n ) for ( int i =0; i < n ; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define pb push_back
#define DEBUG(x) cout << #x << ": " << x << endl;

/*
__attribute__((constructor))
void initial()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);
}
*/

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

	int N;
	cin >> N;
	int a[N+1];
	a[0] = 0;
	for (int i = 1; i <= N; i++)
	{
		cin >> a[i];
	}

	int count = 0;
	for (int i = 1; i <= N; i++)
	{
		//cout << "i=" << i << "; a[i]=" << a[i] << "; a[a[i]]=" << a[a[i]] << endl;
		if (i > a[i])
		{
			continue;
		}

		if (i == a[a[i]])
		{
			count++;
		}
	}
	
	cout << count << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User yly
Language C++14 (GCC 5.4.1)
Score 200
Code Size 890 Byte
Status AC
Exec Time 9 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 9 ms 640 KB
1_02.txt AC 9 ms 640 KB
1_03.txt AC 9 ms 640 KB
1_04.txt AC 9 ms 640 KB
1_05.txt AC 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 3 ms 384 KB