Submission #894724
Source Code Expand
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int n;
cin >> n;
vector<long int> friends;
friends.resize(n);
for(long int i = 0 ; i < n ; i++) {
friends[i] = 0;
}
for(long int i = 0 ; i < n ; i++) {
long int place;
cin >> place;
friends[i] = place-1;
}
long int counter = 0;
for(long int j = 0 ; j < n ; j++) {
if(friends[friends[j]] == j) {
counter++;
}
}
cout << counter/2;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Friendly Rabbits |
| User | davidstrouk |
| Language | C++14 (GCC 5.4.1) |
| Score | 200 |
| Code Size | 489 Byte |
| Status | AC |
| Exec Time | 31 ms |
| Memory | 1024 KiB |
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 | 3 ms | 256 KiB |
| 0_01.txt | AC | 3 ms | 256 KiB |
| 0_02.txt | AC | 3 ms | 256 KiB |
| 1_00.txt | AC | 3 ms | 256 KiB |
| 1_01.txt | AC | 31 ms | 1024 KiB |
| 1_02.txt | AC | 31 ms | 1024 KiB |
| 1_03.txt | AC | 31 ms | 1024 KiB |
| 1_04.txt | AC | 31 ms | 1024 KiB |
| 1_05.txt | AC | 31 ms | 1024 KiB |
| 1_06.txt | AC | 31 ms | 1024 KiB |
| 1_07.txt | AC | 31 ms | 1024 KiB |
| 1_08.txt | AC | 13 ms | 512 KiB |
| 1_09.txt | AC | 26 ms | 896 KiB |
| 1_10.txt | AC | 22 ms | 768 KiB |
| 1_11.txt | AC | 7 ms | 384 KiB |