코드트리 - 카드 사이클 만들기

sol.cpp

#include <iostream>
#include <vector>
using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> arr(n);
  vector<int> graph(n, 0);

  for (int i = 0; i < n; i++) 
    cin >> arr[i];

  int k;
  for (int i = 0; i < n; i++) {
    cin >> k;
    if (k != arr[i]) 
      graph[k] = arr[i];
  }

  int cycleCount = 0;
  int maxCycleSize = -1;

  vector<bool> visited(n, false);

  for (int cur : arr) {
    if (!visited[cur] && graph[cur] != 0) {
      cycleCount++;

      int cycleSize = 0;
      while (!visited[cur]) {
        visited[cur] = true;
        cycleSize++;
        cur = graph[cur];
      }

      maxCycleSize = max(maxCycleSize, cycleSize);
    }
  }

  cout << cycleCount << " " << maxCycleSize;
}