Submission #1649621
Source Code Expand
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
signed main() {
int N; cin >> N;
vector<int> v(N);
rep(i,0,N) cin >> v[i], v[i]--;
int ans = 0;
rep(i,0,N) {
int to = v[i];
if(v[to] == i) ans++;
}
cout << ans / 2 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Friendly Rabbits |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1319 Byte |
Status |
AC |
Exec Time |
29 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 |
29 ms |
1024 KB |
1_02.txt |
AC |
29 ms |
1024 KB |
1_03.txt |
AC |
29 ms |
1024 KB |
1_04.txt |
AC |
29 ms |
1024 KB |
1_05.txt |
AC |
29 ms |
1024 KB |
1_06.txt |
AC |
29 ms |
1024 KB |
1_07.txt |
AC |
29 ms |
1024 KB |
1_08.txt |
AC |
11 ms |
512 KB |
1_09.txt |
AC |
24 ms |
896 KB |
1_10.txt |
AC |
20 ms |
768 KB |
1_11.txt |
AC |
5 ms |
384 KB |