Submission #1420894


Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<random>
#include<unordered_set>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=1000000007;
const llint big=1e9+10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(b==0){return a;}return gcd(b,a%b);}//a>b
llint lcm(llint a,llint b){return (a/gcd(max(a,b),min(a,b)))*b;}
int main(void){
	int i,n,ans=0;cin>>n;
	vector<int>a;
	for(i=0;i<n;i++){cin>>a[i];a[i]--;}
	for(i=0;i<n;i++){if(i==a[a[i]]){ans++;}}
	ans/=2;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User WA_TLE
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1085 Byte
Status RE
Exec Time 135 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
RE × 3
RE × 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 RE 135 ms 256 KB
0_01.txt RE 100 ms 256 KB
0_02.txt RE 98 ms 256 KB
1_00.txt RE 97 ms 256 KB
1_01.txt RE 97 ms 256 KB
1_02.txt RE 97 ms 256 KB
1_03.txt RE 99 ms 256 KB
1_04.txt RE 98 ms 256 KB
1_05.txt RE 98 ms 256 KB
1_06.txt RE 99 ms 256 KB
1_07.txt RE 97 ms 256 KB
1_08.txt RE 98 ms 256 KB
1_09.txt RE 97 ms 256 KB
1_10.txt RE 99 ms 256 KB
1_11.txt RE 101 ms 256 KB