Submission #891662
Source Code Expand
import java.util.Scanner; /** * Created on 16/09/24. */ public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] a = new int[N]; for (int i=0; i<N; i++) { a[i] = sc.nextInt(); } int result = solve(N, a); System.out.println(result); } private static int solve(int N, int[] a) { int num = 0; for (int i=0; i<N; i++) { if(a[i] > (i+1) && a[a[i]-1] == i+1) { num++; } } return num; } }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | moc |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 650 Byte |
Status | AC |
Exec Time | 497 ms |
Memory | 32132 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 135 ms | 10188 KB |
0_01.txt | AC | 124 ms | 9676 KB |
0_02.txt | AC | 125 ms | 9680 KB |
1_00.txt | AC | 124 ms | 9680 KB |
1_01.txt | AC | 459 ms | 32104 KB |
1_02.txt | AC | 497 ms | 31984 KB |
1_03.txt | AC | 418 ms | 31860 KB |
1_04.txt | AC | 492 ms | 31560 KB |
1_05.txt | AC | 485 ms | 31204 KB |
1_06.txt | AC | 469 ms | 32132 KB |
1_07.txt | AC | 469 ms | 32012 KB |
1_08.txt | AC | 331 ms | 29576 KB |
1_09.txt | AC | 449 ms | 31172 KB |
1_10.txt | AC | 419 ms | 31556 KB |
1_11.txt | AC | 284 ms | 26744 KB |