Codeforces Round #367 (Div. 2) C Hard problem(DP)
2016-08-12 15:50
417 查看
思路:由于字符串之间的顺序是固定的,也就是转移的顺序也固定了,令dp[i][0]为第i个字符串不反转的最小费用,dp[i][1]为反转的最小费用,直接转移就可以了
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100000+5;
#define LL long long
#define inf 1e18
LL dp[maxn][2];
int w[maxn];
string s[maxn];
string t[maxn];
int main()
{
int n;
//int flag = 0;
scanf("%d",&n);
for(int i = 1;i<=n;i++)
scanf("%d",&w[i]);
for(int i= 1;i<=n;i++)
{
cin >> s[i];
t[i]=s[i];
reverse(t[i].begin(),t[i].end());
dp[i][0]=dp[i][1]=inf;
}
dp[1][0]=0;
dp[1][1]=w[1];
for(int i = 2;i<=n;i++)
{
if(s[i]>=s[i-1])
dp[i][0]=dp[i-1][0];
if(s[i]>=t[i-1])
dp[i][0]=min(dp[i][0],dp[i-1][1]);
if(t[i]>=s[i-1])
dp[i][1]=dp[i-1][0]+w[i];
if(t[i]>=t[i-1])
dp[i][1]=min(dp[i-1][1]+w[i],dp[i][1]);
}
LL ans = min(dp
[0],dp
[1]);
if(ans==inf)
printf("-1\n");
else
cout <<ans <<endl;
}
C. Hard problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so he asks you to help.
Vasiliy is given n strings consisting of lowercase English letters. He wants them to be sorted in lexicographical order (as in the
dictionary), but he is not allowed to swap any of them. The only operation he is allowed to do is to reverse any of them (first character becomes last, second becomes one before last and so on).
To reverse the i-th string Vasiliy has to spent ci units
of energy. He is interested in the minimum amount of energy he has to spent in order to have strings sorted in lexicographical order.
String A is lexicographically smaller than string B if
it is shorter than B (|A| < |B|)
and is its prefix, or if none of them is a prefix of the other and at the first position where they differ character in A is smaller
than the character in B.
For the purpose of this problem, two equal strings nearby do not break the condition of sequence being sorted lexicographically.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) —
the number of strings.
The second line contains n integers ci (0 ≤ ci ≤ 109),
the i-th of them is equal to the amount of energy Vasiliy has to spent in order to reverse the i-th
string.
Then follow n lines, each containing a string consisting of lowercase English letters. The total length of these strings doesn't exceed100 000.
Output
If it is impossible to reverse some of the strings such that they will be located in lexicographical order, print - 1. Otherwise, print the
minimum total amount of energy Vasiliy has to spent.
Examples
input
output
input
output
input
output
input
output
Note
In the second sample one has to reverse string 2 or string 3.
To amount of energy required to reverse the string 3 is smaller.
In the third sample, both strings do not change after reverse and they go in the wrong order, so the answer is - 1.
In the fourth sample, both strings consists of characters 'a' only, but in the sorted order string "aa"
should go before string "aaa", thus the answer is - 1.
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100000+5;
#define LL long long
#define inf 1e18
LL dp[maxn][2];
int w[maxn];
string s[maxn];
string t[maxn];
int main()
{
int n;
//int flag = 0;
scanf("%d",&n);
for(int i = 1;i<=n;i++)
scanf("%d",&w[i]);
for(int i= 1;i<=n;i++)
{
cin >> s[i];
t[i]=s[i];
reverse(t[i].begin(),t[i].end());
dp[i][0]=dp[i][1]=inf;
}
dp[1][0]=0;
dp[1][1]=w[1];
for(int i = 2;i<=n;i++)
{
if(s[i]>=s[i-1])
dp[i][0]=dp[i-1][0];
if(s[i]>=t[i-1])
dp[i][0]=min(dp[i][0],dp[i-1][1]);
if(t[i]>=s[i-1])
dp[i][1]=dp[i-1][0]+w[i];
if(t[i]>=t[i-1])
dp[i][1]=min(dp[i-1][1]+w[i],dp[i][1]);
}
LL ans = min(dp
[0],dp
[1]);
if(ans==inf)
printf("-1\n");
else
cout <<ans <<endl;
}
C. Hard problem
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Vasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so he asks you to help.
Vasiliy is given n strings consisting of lowercase English letters. He wants them to be sorted in lexicographical order (as in the
dictionary), but he is not allowed to swap any of them. The only operation he is allowed to do is to reverse any of them (first character becomes last, second becomes one before last and so on).
To reverse the i-th string Vasiliy has to spent ci units
of energy. He is interested in the minimum amount of energy he has to spent in order to have strings sorted in lexicographical order.
String A is lexicographically smaller than string B if
it is shorter than B (|A| < |B|)
and is its prefix, or if none of them is a prefix of the other and at the first position where they differ character in A is smaller
than the character in B.
For the purpose of this problem, two equal strings nearby do not break the condition of sequence being sorted lexicographically.
Input
The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) —
the number of strings.
The second line contains n integers ci (0 ≤ ci ≤ 109),
the i-th of them is equal to the amount of energy Vasiliy has to spent in order to reverse the i-th
string.
Then follow n lines, each containing a string consisting of lowercase English letters. The total length of these strings doesn't exceed100 000.
Output
If it is impossible to reverse some of the strings such that they will be located in lexicographical order, print - 1. Otherwise, print the
minimum total amount of energy Vasiliy has to spent.
Examples
input
2 1 2 ba ac
output
1
input
3
1 3 1aa
ba
ac
output
1
input
2 5 5 bbb aaa
output
-1
input
2 3 3 aaa aa
output
-1
Note
In the second sample one has to reverse string 2 or string 3.
To amount of energy required to reverse the string 3 is smaller.
In the third sample, both strings do not change after reverse and they go in the wrong order, so the answer is - 1.
In the fourth sample, both strings consists of characters 'a' only, but in the sorted order string "aa"
should go before string "aaa", thus the answer is - 1.
相关文章推荐
- 利用wireshark对zigbee及6lowpan进行抓包分析
- RBTree
- mysql 将null转为0
- android 解决软键盘遮挡popwindow问题
- 数据结构实验之二叉树五:层序遍历
- java 在项目根目录创建文件
- 2016.08.12【初中部 NOIP提高组 】模拟赛C
- mongodb--入门知识点
- HDU 5821 Ball
- 利用Python进行数据分析(13) pandas基础: 数据重塑/轴向旋转
- dos命令删除文件夹下的文件 和隐藏文件
- iOS设备唯一标识获取策略
- winsock recv函数使用注意
- Javascript中的对象和原型(二)
- 给Jquery动态添加的元素添加事件
- mysql 日期
- Handler
- datagrid批量删除的部分代码
- IM模块-UiCollectionView列表显示气泡文本
- 电信行业的容器化改造之道