Submission #1986581


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
static const int64_t INFL = 0x3F3F3F3F3F3F3F3FLL;
typedef int64_t ll;
typedef vector<ll> vll;
struct Solution {
    void solve(std::istream& in, std::ostream& out) {
        ll n;
        in >> n;
        vll a(n, INFL);
        ll ans = 0;
        for (int i = 0; i < n; i++) {
            ll t;
            in >> t;
            if (a[t - 1] == i) {
                ans++;
            }
            a[i] = t - 1;
        }
        out << ans << '\n';
    }
};
void solve(std::istream& in, std::ostream& out) {
    out << std::setprecision(12);
    Solution solution;
    solution.solve(in, out);
}
#include <fstream>
#include <iostream>
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    istream& in = cin;
    ostream& out = cout;
    solve(in, out);
    return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User masakt
Language C++14 (GCC 5.4.1)
Score 200
Code Size 868 Byte
Status AC
Exec Time 9 ms
Memory 1024 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 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