Submission #891031


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define FORD(i,a,b) for (ll i = (b)-1; i >= (a); i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define has(c,i) ((c).find(i) != end(c))
#define DBGDO(X) ({ if(1) cerr << "DBGDO: " << (#X) << " = " << (X) << endl; })

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

	ll n; cin >> n;
	vl a(n);
	FOR(i,0,n) cin >> a[i], a[i]--;
	
	ll res = 0;
	FOR(i,0,n) if (a[i] > i && a[a[i]] == i) res++;
	cout << res << endl;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User pwild
Language C++14 (GCC 5.4.1)
Score 200
Code Size 885 Byte
Status AC
Exec Time 11 ms
Memory 1024 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 2 ms 256 KB
1_01.txt AC 11 ms 1024 KB
1_02.txt AC 11 ms 1024 KB
1_03.txt AC 11 ms 1024 KB
1_04.txt AC 11 ms 1024 KB
1_05.txt AC 11 ms 1024 KB
1_06.txt AC 11 ms 1024 KB
1_07.txt AC 11 ms 1024 KB
1_08.txt AC 6 ms 512 KB
1_09.txt AC 10 ms 896 KB
1_10.txt AC 9 ms 768 KB
1_11.txt AC 4 ms 384 KB