Submission #890755
Source Code Expand
#include <bits/stdc++.h> using namespace std; map< pair<int,int> , int> memo; void solve(long long N, vector<long long> A){ for(int i = 0 ; i < N ; i++){ A[i]--; int a = A[i]; int b = i; if( a < b ) swap(a,b); memo[{a,b}]++; } int ans = 0; for( auto p : memo ){ if( p.second == 2 ) ans++; } cout << ans << endl; } int main(){ ios::sync_with_stdio(false); long long N; cin >> N; vector<long long> a(N-1+1); for(int i = 0 ; i <= N-1 ; i++){ cin >> a[i]; } solve(N, a); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | kyuridenamida |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 550 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 8064 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 | 2 ms | 256 KB |
0_01.txt | AC | 2 ms | 256 KB |
0_02.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 32 ms | 4992 KB |
1_02.txt | AC | 40 ms | 8064 KB |
1_03.txt | AC | 39 ms | 7680 KB |
1_04.txt | AC | 40 ms | 8064 KB |
1_05.txt | AC | 40 ms | 8064 KB |
1_06.txt | AC | 40 ms | 8064 KB |
1_07.txt | AC | 40 ms | 8064 KB |
1_08.txt | AC | 16 ms | 3200 KB |
1_09.txt | AC | 33 ms | 6656 KB |
1_10.txt | AC | 28 ms | 5760 KB |
1_11.txt | AC | 8 ms | 1536 KB |