Submission #2091046
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long int #define rep(i,n) for( int i = 0; i < n; i++ ) #define dump(x) cerr << #x << " = " << (x) << endl; #define INF 2000000000 #define mod 1000000007 #define INF2 1000000000000000000 int main(void) { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; int a[N]; int A[N][N] = {}; rep(i, N) { cin >> a[i]; a[i]--; A[i][a[i]]++; } int ans = 0; rep(i, N) { for(int j = i+1; j < N; j++) { if(A[i][j] == A[j][i] && A[i][j] == 1) { ans++; break; } } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | toame |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 736 Byte |
Status | RE |
Exec Time | 98 ms |
Memory | 256 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 | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | RE | 97 ms | 256 KB |
1_02.txt | RE | 98 ms | 256 KB |
1_03.txt | RE | 97 ms | 256 KB |
1_04.txt | RE | 97 ms | 256 KB |
1_05.txt | RE | 97 ms | 256 KB |
1_06.txt | RE | 97 ms | 256 KB |
1_07.txt | RE | 97 ms | 256 KB |
1_08.txt | RE | 97 ms | 256 KB |
1_09.txt | RE | 97 ms | 256 KB |
1_10.txt | RE | 97 ms | 256 KB |
1_11.txt | RE | 97 ms | 256 KB |