Submission #1420290
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> P; typedef vector<int> VI; typedef vector<VI> VVI; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const int INF = numeric_limits<int>::max() / 2; const int NEG_INF = numeric_limits<int>::min() / 2; const int MOD = 1e9 + 7; int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; v[i]--; } int res = 0; for (int i = 0; i < n; i++) { int love = v[i]; if (v[love] == i) res++; } cout << res / 2 << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | zaki_ |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 644 Byte |
Status | AC |
Exec Time | 9 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 | 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 | 9 ms | 640 KB |
1_02.txt | AC | 9 ms | 640 KB |
1_03.txt | AC | 9 ms | 640 KB |
1_04.txt | AC | 9 ms | 640 KB |
1_05.txt | AC | 9 ms | 640 KB |
1_06.txt | AC | 9 ms | 640 KB |
1_07.txt | AC | 9 ms | 640 KB |
1_08.txt | AC | 4 ms | 384 KB |
1_09.txt | AC | 8 ms | 640 KB |
1_10.txt | AC | 7 ms | 512 KB |
1_11.txt | AC | 3 ms | 384 KB |