寒假222_codeforces 290 div 2 D
2015-02-03 23:16
337 查看
序号5:想了很久的DP ,应该很简单,但是。。题目直接转化为求n个数中选一些数GCD=1且花费最小数比较大map HASH还有一点 我们知道 GCD(X,X*Y)==X;所以我的代码里不用考虑这点了pasting
#include<stdio.h> #include<algorithm> #include<string> #include<iostream> #include<queue> #include<cmath> #include<string.h> #include <vector> #include<map> using namespace std; typedef long long ll; map<int,int>mp; int a[333],b[333]; #define inf 0x3f3f3f3f map<int,int>::iterator it; int gcd(int x,int y) { if (x%y==0) return y; return gcd(y,x%y); } void dfs(int x,int y) { if (!mp[x]) mp[x]=inf; mp[x]=min(mp[x],y); for (it=mp.begin();it!=mp.end();it++) { int tmp=(*it).first; int v= (*it).second; int nw=gcd(tmp,x); if (!mp[nw]) mp[nw]=inf; mp[nw]=min(mp[nw],v+y); } } int main() { int n; cin>>n; for (int i=1;i<=n;i++) cin>>a[i]; for (int i=1;i<=n;i++) cin>>b[i]; for (int i=1;i<=n;i++) dfs(a[i],b[i]); if (mp[1]==0) mp[1]=-1; cout<<mp[1]; return 0; }
相关文章推荐
- [思路题] Codeforces 377A #222 (Div. 1) A. Maze
- Codeforces 209 div2 D. Pair of Numbers
- codeforces 160 Div2 A
- codeforces 55 div2 C.Title 模拟
- codeforces 161 Div2 B
- codeforces 154 Div2 A
- Codeforces 779D 二分求上界 Codeforces Round #402 (Div. 2)
- 【codeforces】Codeforces Round #284 (Div. 1) 【题解】
- codeforces-DIV2-B- Jzzhu and Sequences
- Codeforces Round #418 (Div. 2) Codeforces 814A-D
- [Codeforces] Round #285 (Div. 2) A、B
- codeforces 170 div2 C
- #Codeforces 381 [div2] D. Alyona and a tree 【树链剖分 + 优先队列】
- CodeForces 220(div 2)
- 【codeforces】 Round #287 (Div. 2) C. Guess Your Way Out!
- codeforces 355(Div 2)C. Vanya and Label(思维,预处理)
- 【Codeforces Round #368 (Div. 2)】Codeforces 707A Bakery
- codeforces 260 div2 A,B,C
- C. Fox And Names Codeforces Round #290 (Div. 2)
- Codeforces Round #290 (Div. 2)D