Submission #1603469


Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<utility>
#include<cmath>
#define put(a) cout<<(a)<<endl
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,x,n) for(int i=(x);i<(n);i++)
#define EREP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int main(){
	long long int n,a[100010],some[100010],some2[100010],count=0;
	cin>>n;
	for(int i=0;i<100000;i++){
		some[i]=0;
		some2[i]=0;
	}
	for(int i=0;i<n;i++){
		cin>>a[i];
		some[i]=1;
		some2[a[i]-1]=1;
	}
	for(int i=0;i<n;i++){
		if(some[i]==some2[i]){
			count++;
		}
	}
	cout<<count/2<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User mamime19
Language C++14 (GCC 5.4.1)
Score 0
Code Size 648 Byte
Status WA
Exec Time 31 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
WA × 1
AC × 4
WA × 11
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 2 ms 1792 KB
0_01.txt WA 2 ms 1792 KB
0_02.txt AC 2 ms 1792 KB
1_00.txt AC 2 ms 1792 KB
1_01.txt AC 31 ms 2560 KB
1_02.txt WA 30 ms 2560 KB
1_03.txt WA 30 ms 2560 KB
1_04.txt WA 30 ms 2560 KB
1_05.txt WA 29 ms 2560 KB
1_06.txt WA 30 ms 2560 KB
1_07.txt WA 29 ms 2560 KB
1_08.txt WA 12 ms 2048 KB
1_09.txt WA 25 ms 2432 KB
1_10.txt WA 21 ms 2304 KB
1_11.txt WA 6 ms 2432 KB