Submission #891042


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int main(){
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> A;
  rep(i,N){
    int a;
    cin >> a;
    a--;
    A.push_back(a);
  }

  int ret = 0;
  rep(i,A.size()){
    if(A[A[i]] == i){
      ret++;
      A[A[i]] = -1;
    }
  }
  cout << ret << endl;
  return 0;
}

Submission Info

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