Submission #891394
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <sstream> #include <map> #include <set> #include <queue> #include <algorithm> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> using namespace std; using ll = long long; #define all(c) (c).begin(), (c).end() #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define pb(e) push_back(e) #define mp(a, b) make_pair(a, b) #define fr first #define sc second const ll INF = 1e9; const ll MOD = 1e9 + 7; int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; int N; int a[100005]; int main() { cin >> N; rep(i, N) cin >> a[i]; rep(i, N) a[i]--; int ans = 0; rep(i, N) { if (i == a[a[i]]) ans++; } cout << ans / 2 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | odan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 809 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 640 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 | 5 ms | 384 KB |
1_01.txt | AC | 35 ms | 640 KB |
1_02.txt | AC | 36 ms | 640 KB |
1_03.txt | AC | 35 ms | 640 KB |
1_04.txt | AC | 35 ms | 640 KB |
1_05.txt | AC | 35 ms | 640 KB |
1_06.txt | AC | 35 ms | 640 KB |
1_07.txt | AC | 35 ms | 640 KB |
1_08.txt | AC | 14 ms | 384 KB |
1_09.txt | AC | 29 ms | 512 KB |
1_10.txt | AC | 25 ms | 512 KB |
1_11.txt | AC | 8 ms | 256 KB |