Submission #891128
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long LL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef long double LD; typedef pair<LD, LD> PLDLD; typedef pair<char, char> PCC; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define CLR(a) memset((a), 0 ,sizeof(a)) #define ALL(a) a.begin(),a.end() LL MOD = 1e9+7; LL INF = 1e17; double EPS=1.0e-9; double PI=atan2(0,-1); int main() { int n; cin>>n; vector<int> a(n+1); FOR(i,1,n+1) cin>>a[i]; int cnt=0; FOR(i,1,n+1) { if(a[a[i]]==i) cnt++; } cout<<(cnt/2)<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | suginamiku |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 670 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 768 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 | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 30 ms | 640 KB |
1_02.txt | AC | 30 ms | 640 KB |
1_03.txt | AC | 30 ms | 640 KB |
1_04.txt | AC | 30 ms | 640 KB |
1_05.txt | AC | 31 ms | 640 KB |
1_06.txt | AC | 30 ms | 640 KB |
1_07.txt | AC | 30 ms | 768 KB |
1_08.txt | AC | 13 ms | 384 KB |
1_09.txt | AC | 25 ms | 512 KB |
1_10.txt | AC | 22 ms | 512 KB |
1_11.txt | AC | 7 ms | 256 KB |