Codeforces Round #Pi (Div. 2)567C Geometric Progression(map暴力)
来源:互联网 发布:js实现点击隐藏 编辑:程序博客网 时间:2024/06/08 13:11
Polycarp loves geometric progressions very much. Since he was only three years old, he loves only the progressions of length three. He also has a favorite integer k and a sequence a, consisting of n integers.
He wants to know how many subsequences of length three can be selected from a, so that they form a geometric progression with common ratio k.
A subsequence of length three is a combination of three such indexes i1, i2, i3, that 1 ≤ i1 < i2 < i3 ≤ n. That is, a subsequence of length three are such groups of three elements that are not necessarily consecutive in the sequence, but their indexes are strictly increasing.
A geometric progression with common ratio k is a sequence of numbers of the form b·k0, b·k1, ..., b·kr - 1.
Polycarp is only three years old, so he can not calculate this number himself. Help him to do it.
The first line of the input contains two integers, n and k (1 ≤ n, k ≤ 2·105), showing how many numbers Polycarp's sequence has and his favorite number.
The second line contains n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — elements of the sequence.
Output a single number — the number of ways to choose a subsequence of length three, such that it forms a geometric progression with a common ratio k.
5 21 1 2 2 4
4
3 11 1 1
1
10 31 2 6 2 3 6 9 18 3 9
6
In the first sample test the answer is four, as any of the two 1s can be chosen as the first element, the second element can be any of the 2s, and the third element of the subsequence must be equal to 4.
给出n, k问从下面的n个数中能组合出几组数能构成等比数列,公比为k。
参考了:点击打开链接
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"#include "map"using namespace std;typedef long long ll;const int maxn = 2e5 + 5;map<ll, ll> mp;map<ll, ll> mp2;ll a[maxn], n, k, ans;int main(int argc, char const *argv[]){cin >> n >> k;for(int i = 1; i <= n; ++i) {cin >> a[i];if(mp.count(a[i]) == 0) mp[a[i]] = 1;else mp[a[i]]++;}if(mp2.count(a[n]) == 0) mp2[a[n]] = 1;else mp2[a[n]]++;for(int i = n - 1; i > 1; --i) {if(mp2.count(a[i]) == 0) mp2[a[i]] = 1;else mp2[a[i]]++;ll x;if(a[i] == a[i] * k) x = mp2[a[i] * k] - 1;else x = mp2[a[i] * k];if(a[i] % k == 0) ans += ((mp[a[i] / k] - mp2[a[i] / k]) * x);}cout << ans << endl;return 0;}
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(map暴力)
- Codeforces Round #Pi (Div. 2) C. Geometric Progression (map)
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
- Codeforces Round #Pi (Div. 2) C. Geometric Progression dp
- Codeforces Round #Pi (Div. 2) C. Geometric Progression
- C. Geometric Progression- Codeforces Round #Pi (Div. 2)-
- Codeforces Round #Pi (Div. 2) —— C-Geometric Progression
- CodeForces #Pi C.Geometric Progression
- codeforces 567C Geometric Progression (map维护)
- CodeForces 567C Geometric Progression【思维+map】
- codeforces(567C)-- Geometric Progression
- codeforces 567C Geometric Progression
- Codeforces 567C Geometric Progression
- CodeForces 567C Geometric Progression
- CodeForces 567C Geometric Progression
- CodeForces 567C. Geometric Progression(map 数学啊)
- codeforces#314C&567C Geometric Progression
- codeforce 567c Geometric Progression(map)
- 变态跳台阶
- Jetty容器下完成solr的安装相关
- iOS -- NSdata 与 NSString,Byte数组,UIImage 的相互转换
- sockaddr和sockaddr_in的区别
- zoj1091
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(map暴力)
- Ubuntu下VirtualBox虚拟机与主机机互相ping通的简单配置心得
- UVALive 5031
- UISegmentedControl的详细使用
- grunt实现用户输入及继续运行
- mysql关联查询
- Android静态编译LOCAL_FORCE_STATIC_EXECUTABLE
- 标准工程文件夹的放置以及MVC
- 如何通过个推SDK实现IM功能