Submission #891420
Source Code Expand
#include <algorithm> #include <cassert> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <iostream> #include <limits> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second #define all(v) begin(v), end(v) #define debug(x) cerr<< #x <<": "<<x<<endl #define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vector<int> > vvi; typedef vector<ll> vll; typedef vector<vector<ll> > vvll; typedef vector<char> vc; typedef vector<vector<char> > vvc; typedef vector<double> vd; typedef vector<vector<double> > vvd; template<class T> using vv=vector<vector< T > >; typedef deque<int> di; typedef deque<deque<int> > ddi; typedef deque<bool> db; typedef deque<deque<bool> > ddb; // cout pair template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) { s << p.first << " " << p.second << "\n"; return s; } // cout vector<pair> template<typename T1, typename T2> ostream& operator<<(ostream& s, const vector<pair<T1, T2> >& vp) { int len = vp.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << vp[i]; } s << "\n"; return s; } // cout vector template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) { int len = v.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << v[i]; if (i < len - 1) s << "\t"; } s << "\n"; return s; } // cout deque template<typename T> ostream& operator<<(ostream& s, const deque<T>& v) { int len = v.size(); s << "\n"; for (int i = 0; i < len; ++i) { s << v[i]; if (i < len - 1) s << "\t"; } s << "\n"; return s; } // cout 2-dimentional vector template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) { int len = vv.size(); for (int i = 0; i < len; ++i) { s << vv[i]; } return s; } // cout 2-dimentional deque template<typename T> ostream& operator<<(ostream& s, const deque< deque<T> >& vv) { int len = vv.size(); for (int i = 0; i < len; ++i) { s << vv[i]; } return s; } int main() { int n; cin >> n; vi a(n); rep (i, n) { cin >> a[i]; --a[i]; } ll ans = 0; rep (i, n) { if (i == a[a[i]]) { ans += 1; } } printf("%lld\n", ans / 2); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | tspcx |
Language | C++14 (Clang 3.8.0) |
Score | 200 |
Code Size | 2801 Byte |
Status | AC |
Exec Time | 81 ms |
Memory | 888 KB |
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 | 6 ms | 888 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 81 ms | 640 KB |
1_02.txt | AC | 81 ms | 640 KB |
1_03.txt | AC | 81 ms | 640 KB |
1_04.txt | AC | 81 ms | 640 KB |
1_05.txt | AC | 81 ms | 640 KB |
1_06.txt | AC | 81 ms | 640 KB |
1_07.txt | AC | 81 ms | 640 KB |
1_08.txt | AC | 32 ms | 384 KB |
1_09.txt | AC | 67 ms | 512 KB |
1_10.txt | AC | 57 ms | 512 KB |
1_11.txt | AC | 15 ms | 384 KB |