Submission #891181


Source Code Expand

#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#define LL long long
using namespace std;
const int M = 1e5 + 5, INF = 0x3f3f3f3f, mod = 1000007;
int A[M];
int main() {
    int n;
    scanf("%d",&n);
    for(int j=1;j<=n;j++) scanf("%d",&A[j]);
    int ans=0;
    for(int j=1;j<=n;j++){
        if(j==A[A[j]]) ans++;
    }
    printf("%d\n",ans/2);
    return 0;
}

Submission Info

Submission Time
Task B - Friendly Rabbits
User lajiniunai
Language C++14 (GCC 5.4.1)
Score 200
Code Size 769 Byte
Status AC
Exec Time 12 ms
Memory 768 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:29:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int j=1;j<=n;j++) scanf("%d",&A[j]);
                                            ^

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 2 ms 256 KB
0_01.txt AC 2 ms 256 KB
0_02.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 12 ms 640 KB
1_02.txt AC 12 ms 640 KB
1_03.txt AC 12 ms 640 KB
1_04.txt AC 12 ms 768 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