Submission #890987
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define REP(i,n) for (int i=1;i<=(n);++i)
#define FOR(i,a,b) for (int i=(a);i<=(b);++i)
#define ROF(i,a,b) for (int i=(a);i>=(b);--i)
#define FEC(p,u) for (edge*p=head[u];p;p=p->nxt)
using namespace std;
typedef long long LL;
int n, a[110000], ans;
int main(){
scanf("%d", &n);
REP(i,n) scanf("%d", a+i);
REP(i,n) if (a[a[i]] == i) ++ans;
printf("%d\n", ans/2);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Friendly Rabbits |
User |
crx |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
515 Byte |
Status |
AC |
Exec Time |
12 ms |
Memory |
768 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:17:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n) scanf("%d", a+i);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
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 |
12 ms |
640 KB |
1_02.txt |
AC |
12 ms |
768 KB |
1_03.txt |
AC |
12 ms |
640 KB |
1_04.txt |
AC |
12 ms |
640 KB |
1_05.txt |
AC |
12 ms |
640 KB |
1_06.txt |
AC |
12 ms |
640 KB |
1_07.txt |
AC |
12 ms |
640 KB |
1_08.txt |
AC |
6 ms |
384 KB |
1_09.txt |
AC |
10 ms |
512 KB |
1_10.txt |
AC |
9 ms |
512 KB |
1_11.txt |
AC |
4 ms |
256 KB |