Submission #890902


Source Code Expand

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

int main() {
  int n;
  int a[100000];
  int x = 0;
  std::cin >> n;
  for (int ni = 0; ni < n; ++ni) {
    std::cin >> a[ni];
  }
  for (int ni = 0; ni < n; ++ni) {
    if (a[a[ni] - 1] == ni + 1) {
      ++x;
    }
  }
  std::cout << x / 2 << std::endl;
  return 0;
}

Submission Info

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