Submission #1152714
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define ff first #define ss second typedef pair<int,int>pii; const int maxn=1e5+55; int a[maxn]; int main() { // freopen("Task.in","r",stdin);freopen("Task.out","w",stdout); int n; cin>>n; // map<int,set<int> >mpp; for(int i=1 ; i<=n ; i++) { cin>>a[i]; } int cnt=0; /*for(map<int,int>::iterator it=mpp.begin() ; it!=mpp.end() ; it++) { int u=it->ff; for(set<int>::iterator it2=it->ss.begin() ; it2!=it->ss.end() ; it2++) { int v=*it2; if(mpp[v].find(u)!=mpp.end()) { ++cnt; mpp[v].erase(u); break; } } mpp[u].erase(v); } */ for (int i=1 ; i<=n ; i++) { if(a[a[i]]==i) cnt++; } cnt/=2; cout<<cnt<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Friendly Rabbits |
User | killjee |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 808 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 640 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 | 36 ms | 640 KB |
1_02.txt | AC | 36 ms | 640 KB |
1_03.txt | AC | 36 ms | 640 KB |
1_04.txt | AC | 36 ms | 640 KB |
1_05.txt | AC | 36 ms | 640 KB |
1_06.txt | AC | 36 ms | 640 KB |
1_07.txt | AC | 36 ms | 640 KB |
1_08.txt | AC | 14 ms | 384 KB |
1_09.txt | AC | 30 ms | 512 KB |
1_10.txt | AC | 25 ms | 512 KB |
1_11.txt | AC | 7 ms | 256 KB |