Submission #891681
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,s,n) for(int i=s; i<n; ++i) #define rep(i,n) REP(i,0,n) #define SORT(c) sort((c).begin(),(c).end()) #define IINF INT_MAX #define LLINF LLONG_MAX typedef long long ll; typedef pair<int, int> ii; /* class Node { public: int num; int index; bool operator<(const Node& b) const { if(num < b.num) return (num < b.num); else return index > b.index; } Node(){ num=0; index=0; } Node(int n, int i) : num(n), index(i){ } }; */ int main(){ int n; cin >> n; vector<int> num(n); rep(i, n) cin >> num[i]; int ret = 0; rep(i,n){ if(num[num[i]] == i) ret++; } cout << ret / 2 <<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | letter |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 743 Byte |
Status | WA |
Exec Time | 30 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 | WA | 2 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | WA | 3 ms | 256 KB |
1_00.txt | AC | 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 | 30 ms | 640 KB |
1_05.txt | WA | 30 ms | 640 KB |
1_06.txt | WA | 30 ms | 640 KB |
1_07.txt | AC | 30 ms | 640 KB |
1_08.txt | AC | 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 |