Submission #6906541


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1000000000;
const int MOD = 1000000007;
const double eps = 1e-9;

int main(int argc, char *argv[]) {
    // cin.tie(0);
    // ios::sync_with_stdio(false);
    int N; cin >> N;
    vector<int> a(N);
    rep(i, N) cin >> a[i], a[i]--;

    int ans = 0;
    rep(i, N) {
        int j = a[i];
        if (i == a[j]) ans++;
    }
    cout << ans / 2 << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User s5412039
Language C++14 (GCC 5.4.1)
Score 200
Code Size 811 Byte
Status AC
Exec Time 30 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 15
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 640 KB
1_02.txt AC 30 ms 640 KB
1_03.txt AC 29 ms 640 KB
1_04.txt AC 29 ms 640 KB
1_05.txt AC 29 ms 640 KB
1_06.txt AC 29 ms 640 KB
1_07.txt AC 29 ms 640 KB
1_08.txt AC 11 ms 384 KB
1_09.txt AC 24 ms 512 KB
1_10.txt AC 21 ms 512 KB
1_11.txt AC 5 ms 256 KB