Submission #890920
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> P; typedef pair<ll, ll> Pll; typedef vector<int> Vi; //typedef tuple<int, int, int> T; #define FOR(i,s,x) for(int i=s;i<(int)(x);i++) #define REP(i,x) FOR(i,0,x) #define ALL(c) c.begin(), c.end() #define DUMP( x ) cerr << #x << " = " << ( x ) << endl const int dr[4] = {-1, 0, 1, 0}; const int dc[4] = {0, 1, 0, -1}; int main() { // use scanf in CodeForces! cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; vector<int> A(N); REP(i, N) { cin >> A[i]; A[i]--; } int ans = 0; REP(i, N) { if (A[A[i]] == i) ans++; } cout << ans / 2 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | n_knuu |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 734 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 11 ms | 640 KB |
1_02.txt | AC | 11 ms | 640 KB |
1_03.txt | AC | 11 ms | 640 KB |
1_04.txt | AC | 11 ms | 640 KB |
1_05.txt | AC | 11 ms | 640 KB |
1_06.txt | AC | 11 ms | 640 KB |
1_07.txt | AC | 11 ms | 640 KB |
1_08.txt | AC | 6 ms | 384 KB |
1_09.txt | AC | 10 ms | 640 KB |
1_10.txt | AC | 8 ms | 512 KB |
1_11.txt | AC | 4 ms | 384 KB |