Submission #891295
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> #include <functional> using namespace std; #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) for (int i=0;i<(n);i++) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) int N; vector <int > a; vector <bool> b; int main() { cin >> N ; int ans=0; a.resize(N+1); b.resize(N+1); REP(i,N){ cin >> a[i]; b[i] = false; } REP(i,N){ if(b[i]) continue; if(a[a[i]] == i){ ans++; b[a[i]] = true; } } cout << ans; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | atm314 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 625 Byte |
Status | WA |
Exec Time | 35 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 3 ms | 256 KB |
1_01.txt | WA | 35 ms | 640 KB |
1_02.txt | AC | 35 ms | 640 KB |
1_03.txt | WA | 35 ms | 640 KB |
1_04.txt | WA | 35 ms | 640 KB |
1_05.txt | WA | 35 ms | 640 KB |
1_06.txt | WA | 35 ms | 640 KB |
1_07.txt | WA | 35 ms | 640 KB |
1_08.txt | WA | 14 ms | 384 KB |
1_09.txt | WA | 29 ms | 512 KB |
1_10.txt | WA | 25 ms | 512 KB |
1_11.txt | WA | 8 ms | 256 KB |