Submission #1688818


Source Code Expand

#include<bits/stdc++.h>
#define loop(i, a, b) for(int i = a; i < b; i++) 
#define rep(i, a) loop(i, 0, a)
using namespace std;
const int MOD = 1000000007;
const int inf = 1e8;
using vi = vector <int>;
using vvi = vector <vi>;
using vc = vector <char>;
using vvc = vector <vc>;
using vs = vector <string>;
using vvs = vector <vs>;
//g++ -std==c++14
//setprecision(10)
int n;
vi a;

int main(){
    cin >> n;
    a = vi(n);
    rep(i, n){
        cin >> a[i];
    }
    int cnt = 0;
    bool mada[n + 1] = {0};
    rep(i, n){
        if(a[a[i] - 1] == i + 1){
            if(mada[i + 1] == false && mada[a[a[i] - 1]] == false)
                cnt++;
            mada[i + 1] = true;
            mada[a[a[i] - 1]]= true;
        }
    }
    cout << cnt / 2 << endl;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User Masumi
Language C++14 (GCC 5.4.1)
Score 200
Code Size 797 Byte
Status AC
Exec Time 36 ms
Memory 768 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 36 ms 768 KB
1_02.txt AC 36 ms 768 KB
1_03.txt AC 36 ms 768 KB
1_04.txt AC 36 ms 768 KB
1_05.txt AC 36 ms 768 KB
1_06.txt AC 36 ms 768 KB
1_07.txt AC 36 ms 768 KB
1_08.txt AC 14 ms 384 KB
1_09.txt AC 30 ms 640 KB
1_10.txt AC 25 ms 640 KB
1_11.txt AC 7 ms 384 KB