Submission #891241


Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N;
int a[100000];

int main(int argc, char **argv) {
	cin >> N;
	REP(i, N) {
		cin >> a[i];
		--a[i];
	}
	int res = 0;
	REP(i, N) if (a[a[i]] == i) ++res;
	cout << (res / 2) << endl;
	return 0;
}

Submission Info

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