Submission #891058
Source Code Expand
#include <iostream> #include <iosfwd> #include <iomanip> #include <cstdio> #include <cstring> #include <cstdlib> #include <ctime> #include <cmath> #include <cassert> #include <cctype> #include <climits> #include <vector> #include <bitset> #include <set> #include <queue> #include <stack> #include <map> #include <deque> #include <string> #include <list> #include <iterator> #include <sstream> #include <complex> #include <fstream> #include <functional> #include <numeric> #include <utility> #include <algorithm> #include <assert.h> #include <unordered_map> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef double ld; typedef vector < long long > vll; typedef pair <long long, long long> pll; typedef pair <int, int> pii; typedef vector < int > vii; typedef complex < double > Point; #define csl ios_base::sync_with_stdio(false); cin.tie(NULL) #define mp make_pair #define fst first #define snd second ll t, n, m, u, v, q, r, ql, qr, k, l, s, w, z, x, y, d, p, c, L, b; const int N = 1e5 + 500; const int LN = 21; const long long mod = 1e9 + 7; const long long INF = 1LL << 52LL; string str; int a[N]; int main() { csl; cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; } int sol = 0; for (int i = 1; i <= n; ++i) { if (a[i] > i && a[a[i]] == i) sol++; } cout << sol << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | SameerGulati |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1462 Byte |
Status | AC |
Exec Time | 11 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 | 3 ms | 256 KB |
0_01.txt | AC | 2 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 11 ms | 640 KB |
1_02.txt | AC | 11 ms | 640 KB |
1_03.txt | AC | 11 ms | 640 KB |
1_04.txt | AC | 11 ms | 640 KB |
1_05.txt | AC | 11 ms | 640 KB |
1_06.txt | AC | 11 ms | 640 KB |
1_07.txt | AC | 11 ms | 640 KB |
1_08.txt | AC | 6 ms | 384 KB |
1_09.txt | AC | 9 ms | 640 KB |
1_10.txt | AC | 8 ms | 512 KB |
1_11.txt | AC | 4 ms | 384 KB |