Submission #891060
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long using namespace std; typedef pair<int, int> P; signed main(){ int n; cin >> n; vector<int> a(n); rep(i, 0, n){ cin >> a[i]; a[i]--; } int ans = 0; rep(i, 0, n){ int id = a[i]; if(a[id] == i) ans++; } cout << ans / 2 << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 496 Byte |
Status | AC |
Exec Time | 31 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 | 2 ms | 256 KB |
0_01.txt | AC | 2 ms | 256 KB |
0_02.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 31 ms | 1024 KB |
1_02.txt | AC | 31 ms | 1024 KB |
1_03.txt | AC | 31 ms | 1024 KB |
1_04.txt | AC | 31 ms | 1024 KB |
1_05.txt | AC | 31 ms | 1024 KB |
1_06.txt | AC | 31 ms | 1024 KB |
1_07.txt | AC | 31 ms | 1024 KB |
1_08.txt | AC | 13 ms | 512 KB |
1_09.txt | AC | 26 ms | 896 KB |
1_10.txt | AC | 22 ms | 768 KB |
1_11.txt | AC | 7 ms | 384 KB |