Submission #891097


Source Code Expand

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	int N; cin >> N;
	vector<int> a(N);
	rep(i, 0, N) { cin >> a[i]; a[i]--; }
	int cnt = 0;
	rep(i, 0, N) {
		if (i == a[a[i]])cnt++;
	}
	cout << cnt / 2 << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User minaminao
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1048 Byte
Status AC
Exec Time 31 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 2 ms 256 KB
0_01.txt AC 2 ms 256 KB
0_02.txt AC 2 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 30 ms 640 KB
1_02.txt AC 30 ms 640 KB
1_03.txt AC 30 ms 640 KB
1_04.txt AC 30 ms 640 KB
1_05.txt AC 31 ms 640 KB
1_06.txt AC 30 ms 640 KB
1_07.txt AC 30 ms 640 KB
1_08.txt AC 13 ms 384 KB
1_09.txt AC 25 ms 512 KB
1_10.txt AC 22 ms 512 KB
1_11.txt AC 7 ms 256 KB