Submission #891789
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iomanip> #include <vector> #include <queue> #include <algorithm> using namespace std; int list[100020]; bool check[100020]; int a[100020]; int N; int ans; int main(void){ scanf("%d",&N); for (int i = 1; i <= N; ++i) { scanf("%d",a+i); } for (int i = 1; i <= N; ++i) { list[i]=a[i]; } for (int i = 1; i <= N; ++i) { if(i==list[a[i]]&&!check[i]){ ans++; check[a[i]]=true; } } printf("%d\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | ksla |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 589 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:24:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] 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 | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 13 ms | 1152 KB |
1_02.txt | AC | 13 ms | 1024 KB |
1_03.txt | AC | 13 ms | 1152 KB |
1_04.txt | AC | 13 ms | 1152 KB |
1_05.txt | AC | 13 ms | 1152 KB |
1_06.txt | AC | 13 ms | 1024 KB |
1_07.txt | AC | 13 ms | 1024 KB |
1_08.txt | AC | 6 ms | 512 KB |
1_09.txt | AC | 11 ms | 896 KB |
1_10.txt | AC | 9 ms | 768 KB |
1_11.txt | AC | 4 ms | 384 KB |