Submission #3236465
Source Code Expand
#include "bits/stdc++.h" using namespace std; using ll = long long; using ld = long double; const double PI = 3.1415926535897932384626433832795; const int dx[] = { 0, 1, 0, -1 }; const int dy[] = { -1, 0, 1, 0 }; int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } int lcm(int x, int y) { return x / gcd(x, y) * y; } ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); for (auto &v : a) { cin >> v; v--; } int cnt = 0; for (int i = 0; i < (int)a.size(); i++) { int love = a[i]; if (i == a[love]) { cnt++; } } cout << cnt / 2 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | ant2357 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 767 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 | 2 ms | 384 KB |