Submission #2161696
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep2(i,n) for(int i=1;i<=(int)(n);i++) #define rep3(i,n) for(int i=0;i<=(int)(n);i++) #define REP(i,m,n) for(int i=m;i<(int)(n);i++) #define repll(i,n) for(ll i=0;i<(ll)(n);i++) #define repll2(i,n) for(ll i=1;i<=(ll)(n);i++) #define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++) #define INF (int)1e9 // #define LINF (ll)4e18 // #define MOD (1e9)+7 #define MP make_pair #define YES(n) cout << ((n) ? "YES" : "NO" ) << endl #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define PI 3.1415926535898 //------------------------------------------------------ int main() { int n; cin >> n; int a[n]; rep(i, n) cin >> a[i]; int cnt = 0; rep(i, n) { if (a[a[i] - 1] == i + 1) cnt++; } cout << cnt / 2 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | stoq |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 991 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 | 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 | 36 ms | 640 KB |
1_02.txt | AC | 36 ms | 640 KB |
1_03.txt | AC | 36 ms | 640 KB |
1_04.txt | AC | 36 ms | 640 KB |
1_05.txt | AC | 35 ms | 640 KB |
1_06.txt | AC | 36 ms | 640 KB |
1_07.txt | AC | 36 ms | 640 KB |
1_08.txt | AC | 14 ms | 384 KB |
1_09.txt | AC | 30 ms | 512 KB |
1_10.txt | AC | 25 ms | 512 KB |
1_11.txt | AC | 6 ms | 256 KB |