Submission #1501178
Source Code Expand
#include<iostream> #include<iomanip> #include<math.h> #include<vector> #include<algorithm> #include<set> #include<map> #include<queue> #include<stack> #include<string> #include<complex> #define INF (long long)1000000000 #define MOD 1000000007 #define EPS 1e-8 #define REP(i, m) for(long long i = 0; i < m; ++i) #define FOR(i, n, m) for(long long i = n; i < m; ++i) #define ALL(v) v.begin(), v.end() #define pb push_back using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef long double ld; int main() { int n; cin>>n; vector<int> a(n); REP(i,n)cin>>a[i]; int c = 0; REP(i,n) { if(a[a[i]-1]-1==i)++c; } cout<<c/2<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | gazelle |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 693 Byte |
Status | AC |
Exec Time | 32 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 | 29 ms | 640 KB |
1_02.txt | AC | 29 ms | 640 KB |
1_03.txt | AC | 32 ms | 640 KB |
1_04.txt | AC | 29 ms | 640 KB |
1_05.txt | AC | 29 ms | 640 KB |
1_06.txt | AC | 29 ms | 640 KB |
1_07.txt | AC | 29 ms | 640 KB |
1_08.txt | AC | 11 ms | 384 KB |
1_09.txt | AC | 24 ms | 512 KB |
1_10.txt | AC | 20 ms | 512 KB |
1_11.txt | AC | 5 ms | 256 KB |