Submission #891139


Source Code Expand

import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			int n=sc.nextInt();
			int[] a=new int[n];
			for(int i=0;i<n;i++) a[i]=sc.nextInt()-1;
			int ans=0;
			for(int i=0;i<n;i++){
				if(a[a[i]]==i) ans++;
			}
			System.out.println(ans/2);
		}
	}
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User mits58
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 356 Byte
Status AC
Exec Time 472 ms
Memory 32656 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 130 ms 9668 KB
0_01.txt AC 123 ms 9680 KB
0_02.txt AC 125 ms 9676 KB
1_00.txt AC 124 ms 9680 KB
1_01.txt AC 472 ms 32152 KB
1_02.txt AC 470 ms 32420 KB
1_03.txt AC 462 ms 31332 KB
1_04.txt AC 445 ms 32252 KB
1_05.txt AC 441 ms 31760 KB
1_06.txt AC 460 ms 32656 KB
1_07.txt AC 469 ms 31996 KB
1_08.txt AC 345 ms 30352 KB
1_09.txt AC 451 ms 31660 KB
1_10.txt AC 413 ms 31080 KB
1_11.txt AC 292 ms 26820 KB