Submission #1971328
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> #include<queue> #include<complex> #define lol(i,n) for(int i=0;i<n;i++) #define mod 1000000007 typedef long long ll; using namespace std; int main(){ int n,a[100010]; cin>>n; int ans=0; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]<i){ if(a[a[i]]==i)ans++; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | ynymxiaolongbao |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 382 Byte |
Status | AC |
Exec Time | 38 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 | 37 ms | 640 KB |
1_03.txt | AC | 36 ms | 640 KB |
1_04.txt | AC | 36 ms | 640 KB |
1_05.txt | AC | 38 ms | 640 KB |
1_06.txt | AC | 36 ms | 640 KB |
1_07.txt | AC | 37 ms | 640 KB |
1_08.txt | AC | 14 ms | 384 KB |
1_09.txt | AC | 30 ms | 512 KB |
1_10.txt | AC | 26 ms | 512 KB |
1_11.txt | AC | 7 ms | 256 KB |