Submission #1218103


Source Code Expand

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int N = cin.nextInt();
		int[] map = new int[N+1];
		for(int i=1;i<=N;i++) {
			map[i] = cin.nextInt();
		}
		int res = 0;
		for(int i=1;i<=N;i++) {
			if (map[map[i]] == i) {
				res++;
			}
		}
		System.out.println(res/2);
	} 
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User kelvinlu
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 382 Byte
Status AC
Exec Time 417 ms
Memory 53036 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 96 ms 21716 KB
0_01.txt AC 91 ms 21844 KB
0_02.txt AC 91 ms 19796 KB
1_00.txt AC 93 ms 21588 KB
1_01.txt AC 399 ms 51240 KB
1_02.txt AC 401 ms 53036 KB
1_03.txt AC 407 ms 43996 KB
1_04.txt AC 416 ms 45088 KB
1_05.txt AC 417 ms 50588 KB
1_06.txt AC 402 ms 50028 KB
1_07.txt AC 404 ms 46896 KB
1_08.txt AC 292 ms 46012 KB
1_09.txt AC 379 ms 48460 KB
1_10.txt AC 367 ms 43860 KB
1_11.txt AC 213 ms 36296 KB