Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
来源:互联网 发布:淘宝强制订单险类目 编辑:程序博客网 时间:2024/05/29 18:30
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.
参考出处:点击打开链接
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"#include "map"using namespace std;typedef long long ll;const int maxn = 2e5 + 5;int n, k, a[maxn];ll ans = 0;map<int, ll> dp[4];int main(int argc, char const *argv[]){cin >> n >> k;for(int i = 1; i <= n; ++i)cin >> a[i];for(int i = 1; i <= n; ++i) {int x = a[i];if(x % k == 0) {dp[3][x] += dp[2][x / k];dp[2][x] += dp[1][x / k];}dp[1][x] += 1;}map<int, ll>::iterator it = dp[3].begin();for(; it != dp[3].end(); ++it)ans += (*it).second;cout << ans << endl;return 0;}
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
- Codeforces Round #Pi (Div. 2) C. Geometric Progression (map)
- Codeforces Round #Pi (Div. 2) C. Geometric Progression dp
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(map暴力)
- 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 (离散 + DP)
- 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 567E C. Geometric Progression(dp+STL)
- 文章链接
- C++中构造函数调用顺序
- 三种工厂模式的分析以及C++实现
- Redis——持久化机制(RDB和AOF)
- 关于Android.mk和build/envsetup.sh的一些小小理解
- Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
- hive DATEDIFF NULL
- javascript
- 计算机网络
- Unity+Metaio +IOS Xcode编译出错
- Web.xml配置详解之context-param
- Asynctask解析以及注意事项
- Ext.Ajax.Request 如何将response.responseText作为函数返回值返回?
- Poj 1611 The Suspects