Submission #891255


Source Code Expand

/* ***********************************************
Author        :axp
Created Time  :2016/9/24 20:07:59
TASK		  :B.cpp
LANG          :C++
************************************************ */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;

typedef long long ll;
const int inf = 1<<30;
const int md = 1e9+7;
const int N = 1e5+10;
int n,m;
int T;
int ar[N];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    cin>>n;
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		ar[i]=x;
		if(ar[x]==i)
			ans++;
	}
	cout<<ans<<endl;
    return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User axp
Language C++14 (GCC 5.4.1)
Score 200
Code Size 817 Byte
Status AC
Exec Time 36 ms
Memory 768 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 36 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 768 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