Codeforces Round #290 (Div. 2)D
2015-02-10 16:12
363 查看
D. Fox And Jumping
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length li and
cost ci. If
she pays ci dollars
then she can apply i-th card. After applying i-th
card she becomes able to make jumps of length li,
i. e. from cell x to cell (x - li) or
cell (x + li).
She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible.
If this is possible, calculate the minimal cost.
Input
The first line contains an integer n (1 ≤ n ≤ 300),
number of cards.
The second line contains n numbers li (1 ≤ li ≤ 109),
the jump lengths of cards.
The third line contains n numbers ci (1 ≤ ci ≤ 105),
the costs of cards.
Output
If it is impossible to buy some cards and become able to jump to any cell, output -1. Otherwise output the minimal cost of buying such set of cards.
Sample test(s)
input
output
input
output
input
output
input
output
Note
In first sample test, buying one card is not enough: for example, if you buy a card with length 100, you can't jump to any cell whose index is not a multiple of 100. The best way is to buy first and second card, that will make you be able to jump to any cell.
In the second sample test, even if you buy all cards, you can't jump to any cell whose index is not a multiple of 10, so you should output -1.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void rv(int n, vector<T>& xs) {
T x;
while(n--) {
cin >> x;
xs.push_back(x);
}
}
int main() {
int n; cin >> n;
vector<int> l, c;
rv(n, l);
rv(n, c);
map<int,int> f;
f[0] = 0;
for (int i = 0; i < n; ++i) {
for (map<int,int>::iterator it=f.begin();it!=f.end();++it) {
int g = __gcd((*it).first, l[i]);
f[g] = min(f[g]?f[g]:1<<29, (*it).second + c[i]);
}
}
cout << (f[1]? f[1] : -1);
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length li and
cost ci. If
she pays ci dollars
then she can apply i-th card. After applying i-th
card she becomes able to make jumps of length li,
i. e. from cell x to cell (x - li) or
cell (x + li).
She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible.
If this is possible, calculate the minimal cost.
Input
The first line contains an integer n (1 ≤ n ≤ 300),
number of cards.
The second line contains n numbers li (1 ≤ li ≤ 109),
the jump lengths of cards.
The third line contains n numbers ci (1 ≤ ci ≤ 105),
the costs of cards.
Output
If it is impossible to buy some cards and become able to jump to any cell, output -1. Otherwise output the minimal cost of buying such set of cards.
Sample test(s)
input
3 100 99 9900 1 1 1
output
2
input
5 10 20 30 40 50 1 1 1 1 1
output
-1
input
7 15015 10010 6006 4290 2730 2310 1 1 1 1 1 1 1 10
output
6
input
8
4264 4921 6321 6984 2316 8432 6120 10264264 4921 6321 6984 2316 8432 6120 1026
output
7237
Note
In first sample test, buying one card is not enough: for example, if you buy a card with length 100, you can't jump to any cell whose index is not a multiple of 100. The best way is to buy first and second card, that will make you be able to jump to any cell.
In the second sample test, even if you buy all cards, you can't jump to any cell whose index is not a multiple of 10, so you should output -1.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void rv(int n, vector<T>& xs) {
T x;
while(n--) {
cin >> x;
xs.push_back(x);
}
}
int main() {
int n; cin >> n;
vector<int> l, c;
rv(n, l);
rv(n, c);
map<int,int> f;
f[0] = 0;
for (int i = 0; i < n; ++i) {
for (map<int,int>::iterator it=f.begin();it!=f.end();++it) {
int g = __gcd((*it).first, l[i]);
f[g] = min(f[g]?f[g]:1<<29, (*it).second + c[i]);
}
}
cout << (f[1]? f[1] : -1);
}
相关文章推荐
- Codeforces Round #290 (Div. 1) A. Fox And Names
- C. Fox And Names Codeforces Round #290 (Div. 2)
- Codeforces Round #290 (Div. 2)(A,B,C)
- Codeforces Round #290 (Div. 2) C. Fox And Names 拓扑排序
- Codeforces Round #290 (Div. 2) A B C
- Codeforces Round #290 (Div. 2)
- Codeforces Round #290 (Div. 2) E Fox And Dinner
- Codeforces Round #290 (Div. 2) A. Fox And Snake 水题
- Codeforces Round #290 (Div. 2) B. Fox And Two Dots
- Codeforces Round #290 (Div. 2)B - Fox And Two Dots——并查集/搜索
- C. Fox And Names(Codeforces Round #290 (Div. 2))
- Codeforces Round #290 (Div. 2) C. Fox And Names dfs
- Codeforces Round #290 (Div. 1)B. Fox And Jumping
- Codeforces Round #290 (Div. 2) D. Fox And Jumping dp
- Codeforces Round #290 (Div. 2) b
- Codeforces Round #290 (Div. 2)-C. Fox And Names
- Codeforces Round #290 (Div. 2) - C. Fox And Names (拓扑排序)
- Codeforces Round #313 (Div. 1) B. Equivalent Strings
- Codeforces Round #297 (Div. 2) 525C Ilya and Sticks(脑洞)
- Codeforces Round #169 (Div. 2):E - Little Girl and Problem on Trees