Submission #1590380
Source Code Expand
#include<iostream> #include<string> #include<string.h> #include<algorithm> #include<stdio.h> #include<cmath> #include<vector> #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) using namespace std; int main(void) { int n; int count = 0; int* a; int* flag; cin >> n; a = new int[n + 1]; flag = new int[n + 1](); FOR(i, 1, n) { cin >> a[i]; } FOR(i, 1, n) { if (flag[i] == 1) { continue; } if (a[a[i]] == i) { count++; flag[a[i]] = 1; } } cout << count << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 583 Byte |
Status | AC |
Exec Time | 37 ms |
Memory | 1024 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 | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 37 ms | 1024 KB |
1_02.txt | AC | 36 ms | 1024 KB |
1_03.txt | AC | 36 ms | 1024 KB |
1_04.txt | AC | 36 ms | 1024 KB |
1_05.txt | AC | 36 ms | 1024 KB |
1_06.txt | AC | 37 ms | 1024 KB |
1_07.txt | AC | 36 ms | 1024 KB |
1_08.txt | AC | 14 ms | 512 KB |
1_09.txt | AC | 31 ms | 896 KB |
1_10.txt | AC | 25 ms | 768 KB |
1_11.txt | AC | 6 ms | 384 KB |