Submission #1419545


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int N;
  cin>>N;
  int a[N];
  FOR(i,0,N) cin>>a[i];
  int ans = 0;
  FOR(i,0,N)
  {
    if(a[a[i]-1] == i + 1) ans++;
  }
  cout << ans / 2 << endl;
  return 0;
}

Submission Info

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