Submission #7099610
Source Code Expand
#include <iostream> #include <algorithm> #include <numeric> #include <cmath> #include <string> #include <vector> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <unordered_map> #include <unordered_set> #include <iomanip> #include <functional> // std::function<void(int)> using namespace std; #define int long long #define All(v) (v).begin(),(v).end() int dy[4] = {-1,0,1,0}; int dx[4] = {0,1,0,-1}; int Dy[8] = {-1,-1,0,1,1,1,0,-1}; int Dx[8] = {0,1,1,1,0,-1,-1,-1}; const int mod = 1000000007; const int inf = mod*mod; const int d5 = 111111; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin>>n; int res=0; vector<int> a(n); for(int i=0;i<n;i++)cin>>a[i]; for(int i=0;i<n;i++)a[i]--; for(int i=0;i<n;i++){ if(a[a[i]]==i&&a[a[a[i]]]==a[i])res++; } cout<<res/2<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | bio4eta |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 917 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 1024 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 | 9 ms | 1024 KB |
1_02.txt | AC | 9 ms | 1024 KB |
1_03.txt | AC | 9 ms | 1024 KB |
1_04.txt | AC | 9 ms | 1024 KB |
1_05.txt | AC | 9 ms | 1024 KB |
1_06.txt | AC | 9 ms | 1024 KB |
1_07.txt | AC | 9 ms | 1024 KB |
1_08.txt | AC | 4 ms | 512 KB |
1_09.txt | AC | 8 ms | 896 KB |
1_10.txt | AC | 7 ms | 768 KB |
1_11.txt | AC | 2 ms | 384 KB |