Submission #890795


Source Code Expand

//Daniel Grzegorzewski
#include <bits/stdc++.h>

#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace std;

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios()
{
     ios_base::sync_with_stdio(0);
     cin.tie(0);
}

const int N = (int)1e5 + 10;

int n, a[N], res;
bool vis[N];

int main()
{
    init_ios();
    cin >> n;
    for (int i = 1; i <= n; ++i)
    	cin >> a[i];
    for (int i = 1; i <= n; ++i)
    	if (!vis[i] && a[a[i]] == i) {
    		++res;
    		vis[a[i]] = true;
    	}
    cout<<res<<"\n";
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User Vax
Language C++14 (GCC 5.4.1)
Score 200
Code Size 651 Byte
Status AC
Exec Time 11 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 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
0_02.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 11 ms 768 KB
1_02.txt AC 11 ms 640 KB
1_03.txt AC 11 ms 768 KB
1_04.txt AC 11 ms 768 KB
1_05.txt AC 11 ms 768 KB
1_06.txt AC 11 ms 640 KB
1_07.txt AC 11 ms 640 KB
1_08.txt AC 6 ms 384 KB
1_09.txt AC 9 ms 640 KB
1_10.txt AC 8 ms 512 KB
1_11.txt AC 4 ms 384 KB