Submission #897773
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)n; ++i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i) #define all(v) v.begin(), v.end() #define mset(a, n) memset(a, n, sizeof(a)) typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pii; const int INF = 1000000000; const int MOD = 1000000007; const double eps = 1e-9; int main(int argc, char *argv[]) { // cin.tie(0); // ios::sync_with_stdio(false); int N; cin >> N; vector<int> a(N); rep(i, N) cin >> a[i]; int ans = 0; rep(i, N) { if (i == a[a[i]]) ans++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | s5412039 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 779 Byte |
Status | WA |
Exec Time | 31 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 | 30 ms | 640 KB |
1_02.txt | AC | 30 ms | 640 KB |
1_03.txt | WA | 30 ms | 640 KB |
1_04.txt | WA | 31 ms | 640 KB |
1_05.txt | WA | 30 ms | 640 KB |
1_06.txt | WA | 30 ms | 640 KB |
1_07.txt | WA | 30 ms | 640 KB |
1_08.txt | WA | 13 ms | 384 KB |
1_09.txt | WA | 25 ms | 512 KB |
1_10.txt | WA | 22 ms | 512 KB |
1_11.txt | WA | 7 ms | 256 KB |