Submission #6927339
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <stdio.h> #include <algorithm> #define _USE_MATH_DEFINES #include <cmath> #include <numeric> #include <iomanip> #include <deque> #include <tuple> #include <queue> #include <stack> #include <map> #include <set> #include <cstdint> #include <unordered_map> #include <sstream> #include <boost/multiprecision/cpp_int.hpp> #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define all(x) (x).begin(), (x).end() #define F first #define S second #define pb push_back #define pf push_front namespace mp = boost::multiprecision; using cpp_int = mp::cpp_int; using ll = long long; using namespace std; ll M = 1000000007; typedef pair<int, int> P; bool ps1(const P &element1, const P &element2) { //first昇順 return element1.first < element2.first; } bool ps2(const P &element1, const P &element2) { //first降順 return element1.first > element2.first; } bool ps3(const P &element1, const P &element2) { //second昇順 return element1.second < element2.second; } bool ps4(const P &element1, const P &element2) { //second降順 return element1.second > element2.second; } int digits(int n) { int count = 0; while (n > 0) { n /= 10; count++; } return count; } int digit(int n) { int ans = 0; while (n > 0) { ans += n % 10; n /= 10; } return ans; } ll combination(ll n, ll r) { if (r * 2 > n) r = n - r; ll dividend = 1; ll divisor = 1; for (ll i = 1; i <= r; ++i) { dividend *= (n - i + 1); divisor *= i; } return dividend / divisor; } int GCD(int x, int y) { return x ? GCD(y % x, x) : y; } vector<int> divisor(int n) { vector<int> value; FOR(i, 1, pow(n, 0.5) + 1) { if (i <= sqrt(n)) { if (n % i == 0) { value.push_back(i); if (i * i != n) { value.push_back(n / i); } } } } return value; } int main() { int n; cin>>n; vector<int>a(n); map<int,int>b; rep(i,n){ cin>>a[i]; b[i+1]=a[i]; } int cou=0; rep(i,n){ if(b[a[i]]==i+1){ cou++; } } cout<<cou/2<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | hakoshie |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 2213 Byte |
Status | AC |
Exec Time | 90 ms |
Memory | 5376 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 | 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 | AC | 86 ms | 5376 KB |
1_02.txt | AC | 89 ms | 5376 KB |
1_03.txt | AC | 90 ms | 5376 KB |
1_04.txt | AC | 85 ms | 5376 KB |
1_05.txt | AC | 85 ms | 5376 KB |
1_06.txt | AC | 86 ms | 5376 KB |
1_07.txt | AC | 87 ms | 5376 KB |
1_08.txt | AC | 27 ms | 2176 KB |
1_09.txt | AC | 68 ms | 4480 KB |
1_10.txt | AC | 56 ms | 3840 KB |
1_11.txt | AC | 11 ms | 1024 KB |