A. Supermarket
We often go to supermarkets to buy some fruits or vegetables, and on the tag there prints the price for a kilo. But in some supermarkets, when asked how much the items are, the clerk will say that a yuan for b kilos (You don't need to care about what "yuan" is), the same as a / b yuan for a kilo.

Now imagine you'd like to buy m kilos of apples. You've asked n supermarkets and got the prices. Find the minimum cost for those apples.

You can assume that there are enough apples in all supermarkets.

Input

The first line contains two positive integers n and m (1 ≤ n ≤ 5 000, 1 ≤ m ≤ 100), denoting that there are n supermarkets and you want to buy m kilos of apples.

The following n lines describe the information of the supermarkets. Each line contains two positive integers a, b (1 ≤ a, b ≤ 100), denoting that in this supermarket, you are supposed to pay a yuan for b kilos of apples.

Output

The only line, denoting the minimum cost for m kilos of apples. Please make sure that the absolute or relative error between your answer and the correct answer won't exceed 10 - 6.

Formally, let your answer be x, and the jury's answer be y. Your answer is considered correct if .

Examples
input
3 5
1 2
3 4
1 3
output
1.66666667
input
2 1
99 100
98 99
output
0.98989899
Note

In the first sample, you are supposed to buy 5 kilos of apples in supermarket 3. The cost is 5 / 3 yuan.

In the second sample, you are supposed to buy 1 kilo of apples in supermarket 2. The cost is 98 / 99 yuan.

找最便宜的超市买东西即可。

#include <bits/stdc++.h>

using namespace std;

int main()
{ int n;
double m;
scanf("%d%lf",&n,&m); double minx = 0x3f3f3f3f;
for(int i = ; i < n; i++) {
double a,b;
scanf("%lf%lf",&a,&b);
minx = min(minx,a/b);
} printf("%lf\n",m*minx); return ;
}
B. Perfect Number

We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.

Input

A single line with a positive integer k (1 ≤ k ≤ 10 000).

Output

A single number, denoting the k-th smallest perfect integer.

Examples
input
1
output
19
input
2
output
28
Note

The first perfect integer is 19 and the second one is 28.

暴力打表

#include <bits/stdc++.h>

using namespace std;

bool calc(int x) {
int sum = ;
while(x) {
sum+=(x%);
x/=;
}
return sum==;
} int main()
{
vector<int> ans;
for(int i = ; i < ; i++) {
if(calc(i))
ans.push_back(i);
}
//printf("%d\n",ans.size());
int k;
scanf("%d",&k);
printf("%d\n",ans[k-]); return ;
}
C. Seat Arrangements

Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, you surprisingly find that many seats there are already occupied. Today you and your friends went for class, and found out that some of the seats were occupied.

The classroom contains n rows of seats and there are m seats in each row. Then the classroom can be represented as an n × m matrix. The character '.' represents an empty seat, while '*' means that the seat is occupied. You need to find k consecutive empty seats in the same row or column and arrange those seats for you and your friends. Your task is to find the number of ways to arrange the seats. Two ways are considered different if sets of places that students occupy differs.

Input

The first line contains three positive integers n, m, k (1 ≤ n, m, k ≤ 2 000), where n, m represent the sizes of the classroom and k is the number of consecutive seats you need to find.

Each of the next n lines contains m characters '.' or '*'. They form a matrix representing the classroom, '.' denotes an empty seat, and '*' denotes an occupied seat.

Output

A single number, denoting the number of ways to find k empty seats in the same row or column.

Examples
input
2 3 2
**.
...
output
3
input
1 2 2
..
output
1
input
3 3 4
.*.
*.*
.*.
output
0
Note

In the first sample, there are three ways to arrange those seats. You can take the following seats for your arrangement.

  • (1, 3), (2, 3)
  • (2, 2), (2, 3)
  • (2, 1), (2, 2)

k连坐

做的时候把我做傻了,一步三坑。以至于我算重复了。

1 ,行数只有一行

2 ,k = 1

搞得我换了两种写法。第二种好看一点。

#include <bits/stdc++.h>

using namespace std;

const int maxn = ;
char maps[maxn][maxn]; int main()
{
//freopen("in.txt","r",stdin);
int n,m,K;
scanf("%d%d%d",&n,&m,&K);
int ans = ;
for(int i = ; i < n; i++) scanf("%s",maps[i]);
if(K == ) {
for(int i = ; i < n; i++) {
for(int j = ; j < m; j++) {
if(maps[i][j]=='.')
ans++;
}
}
printf("%d\n",ans);
return ;
} for(int i = ; i < n; i++) {
for(int j = ; j < m; j++)
{
if(maps[i][j]=='.') {
int cnt = ;
int k;
for(k = j; k < m; k++) {
if(maps[i][k]=='.')
cnt++;
else break;
}
if(cnt>=K) {
ans = ans + cnt-K+;
}
j = k;
}
}
} if(n!=) {
for(int j = ; j < m; j++) {
for(int i = ; i < n; i++)
{
if(maps[i][j]=='.') {
int cnt = ;
int k;
for(k = i; k < n; k++) {
if(maps[k][j]=='.')
cnt++;
else break;
}
if(cnt>=K)
ans=ans + cnt - K +;
i = k;
}
}
}
} printf("%d\n",ans);
return ;
}
#include <bits/stdc++.h>

using namespace std;

const int maxn = ;
char maps[maxn][maxn]; int main()
{
//freopen("in.txt","r",stdin);
int n,m,K;
scanf("%d%d%d",&n,&m,&K); for(int i = ; i < n; i++) scanf("%s",maps[i]); if(K == ) {
int ans = ;
for(int i = ; i < n; i++) {
for(int j = ; j < m; j++) {
if(maps[i][j]=='.')
ans++;
}
}
printf("%d\n",ans);
return ;
} int ans = ;
int cnt = ;
int i,j;
for(i = ; i < n; i++)
{
cnt = ;
for(j = ; j < m; j++)
{
if(maps[i][j]=='*'||maps[i][j+]=='\0')
{
if(maps[i][j]=='.') cnt++;
ans += cnt>=K ? cnt - K + :;
cnt = ;
continue;
}
cnt ++;
}
}
if(n!=)
{
for(i = ; i < m; i++)
{
cnt = ;
for(j = ; j < n; j++)
{
if(maps[j][i]=='*'||maps[j+][i]=='\0')
{
if(maps[j][i]=='.') cnt++;
ans += cnt>=K ? cnt - K + :;
cnt = ;
continue;
}
cnt++;
}
}
} printf("%d\n",ans);
return ;
}
D. Substring

You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are "abaca", then the value of that path is 3. Your task is find a path whose value is the largest.

Input

The first line contains two positive integers n, m (1 ≤ n, m ≤ 300 000), denoting that the graph has n nodes and m directed edges.

The second line contains a string s with only lowercase English letters. The i-th character is the letter assigned to the i-th node.

Then m lines follow. Each line contains two integers x, y (1 ≤ x, y ≤ n), describing a directed edge from x to y. Note that x can be equal to y and there can be multiple edges between x and y. Also the graph can be not connected.

Output

Output a single line with a single integer denoting the largest value. If the value can be arbitrarily large, output -1 instead.

Examples
input
5 4
abaca
1 2
1 3
3 4
4 5
output
3
input
6 6
xzyabc
1 2
3 1
2 3
5 4
4 3
6 4
output
-1
input
10 14
xzyzyzyzqx
1 2
2 4
3 5
4 5
2 6
6 8
6 5
2 10
3 9
10 9
4 6
1 10
2 8
3 7
output
4
Note

In the first sample, the path with largest value is 1 → 3 → 4 → 5. The value is 3 because the letter 'a' appears 3 times.

题意:

给定 n 个点,m条边,每个点上都有字母,求一条路径上,最多字母的那条路径,那个字母有多少。

我开始的思路是,先拓扑判断是否有环,然后回溯法,d[u] : u 结点出发的最优解,那么 d[u] 和 d[v] 之间转移。

v 结点有多解,那么要根据 u 来选择其中一个,也就是说,对于每一个u的最优解,都得是一个vector类型的pair 数据。

这样是比较麻烦的。

看官方题解的做法:

他的状态定义就不一样了,f[i][j]​ :当前顶点是 i 时,字母 j 是顶点的路径上的最优值。

大神的代码就是厉害了,判环和求解写在一起。

直接深搜下去,注意边界。

然后如果有环,用特殊值标记。学习了!

#include <bits/stdc++.h>

using namespace std;

const int MAXN = ;
int f[MAXN][],n,m;
vector<int> G[MAXN];
char s[MAXN]; int dfs(int u,int c) {
if(f[u][c]==-) {
puts("-1");
exit();
}
if(f[u][c]!=-)
return f[u][c];
f[u][c] = -;
int res = ;
for(int i = ; i <(int)G[u].size(); i++) {
int v = G[u][i];
res = max(res,dfs(v,c));
} res += s[u]-'a'==c;
f[u][c] = res;
return res;
} int main()
{
scanf("%d%d",&n,&m);
scanf("%s",s+); for(int i = ; i<= m; i++) {
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
} memset(f,-,sizeof(f));
int ans = ;
for(int i = ; i<= n; i++)
for(int j = ; j <; j++)
ans = max(ans,dfs(i,j));
printf("%d\n",ans); return ;
}

Codeforces Round #460 (Div. 2)的更多相关文章

  1. Codeforces Round #460 (Div. 2) ABCDE题解

    原文链接http://www.cnblogs.com/zhouzhendong/p/8397685.html 2018-02-01 $A$ 题意概括 你要买$m$斤水果,现在有$n$个超市让你选择. ...

  2. Codeforces Round #460 (Div. 2) E. Congruence Equation (CRT+数论)

    题目链接: http://codeforces.com/problemset/problem/919/E 题意: 让你求满足 \(na^n\equiv b \pmod p\) 的 \(n\) 的个数. ...

  3. Codeforces Round #460 (Div. 2) 前三题

    Problem A:题目传送门 题目大意:给你N家店,每家店有不同的价格卖苹果,ai元bi斤,那么这家的苹果就是ai/bi元一斤,你要买M斤,问最少花多少元. 题解:贪心,找最小的ai/bi. #in ...

  4. Codeforces Round #460 (Div. 2): D. Substring(DAG+DP+判环)

    D. Substring time limit per test 3 seconds memory limit per test 256 megabytes input standard input ...

  5. Codeforces Round #460 (Div. 2).E 费马小定理+中国剩余定理

    E. Congruence Equation time limit per test 3 seconds memory limit per test 256 megabytes input stand ...

  6. Codeforces Round #460 (Div. 2)-D. Substring

    D. Substring time limit per test3 seconds memory limit per test256 megabytes Problem Description You ...

  7. Codeforces Round #460 (Div. 2)-C. Seat Arrangements

    C. Seat Arrangements time limit per test1 second memory limit per test256 megabytes Problem Descript ...

  8. Codeforces Round #460 (Div. 2)-B. Perfect Number

    B. Perfect Number time limit per test2 seconds memory limit per test256 megabytes Problem Descriptio ...

  9. Codeforces Round #460 (Div. 2)-A. Supermarket

    A. Supermarket time limit per test2 seconds memory limit per test256 megabytes Problem Description W ...

随机推荐

  1. vue组件中camelCased (驼峰式) 命名与 kebab-case(短横线命名)

    HTML 特性是不区分大小写的.所以,当使用的不是字符串模版,camelCased (驼峰式) 命名的 prop 需要转换为相对应的 kebab-case (短横线隔开式) 命名: 如果你使用字符串模 ...

  2. RabbitMQ之消息持久化

    消息的可靠性是RabbitMQ的一大特色,那么RabbitMQ是如何保证消息可靠性的呢——消息持久化. 为了保证RabbitMQ在退出或者crash等异常情况下数据没有丢失,需要将queue,exch ...

  3. windows环境下MySQL-5.7.12-winx64下载安装与配置

    系统:64位Win-7 官网压缩包:mysql-5.7.12-winx64.zip 前后花了一些时间,以前都是下载软件直接安装在本地,现在这个不一样,下载压缩包后要解压缩到安装目录,然后在控制台下配置 ...

  4. gcc链接非标准(non-standard)命名库

    标准命名库: -lnamespace 标准链接库以lib开头, 并以so/a结尾. example gcc test.c -o test -L. -lhello 非标准命名库: -l:libname ...

  5. SpringBoot集成JWT 实现接口权限认证

    JWT介绍 Json web token (JWT), 是为了在网络应用环境间传递声明而执行的一种基于JSON的开放标准((RFC 7519).该token被设计为紧凑且安全的, 特别适用于分布式站点 ...

  6. Python高级用法------字典无需提前定义key

    from collections import defaultdict import json def tree(): return defaultdict(tree) categories = tr ...

  7. 深入理解JavaScript系列(28):设计模式之工厂模式

    介绍 与创建型模式类似,工厂模式创建对象(视为工厂里的产品)时无需指定创建对象的具体类. 工厂模式定义一个用于创建对象的接口,这个接口由子类决定实例化哪一个类.该模式使一个类的实例化延迟到了子类.而子 ...

  8. python的元组及其书写规矩

    1.元组 (1)元组看起来犹如列表,但使用圆括号而不是方括号来标识.定义元组后,就可以使用索引来访问其元素,就像访问列表元素一样. (2)元组的元素不可修改,但是可以赋值. 2.规矩 (1)缩进:建议 ...

  9. scss-@else if指令

    @else if语句用来与@if指令一起使用.当 @if 语句失败时,则 @else if 语句测试,如果它们也无法测试满足时再 @else 执行. 语法: @if expression { // C ...

  10. (转)原生ajax的写法

    1.创建XMLHttpRequest对象 function createXMLHTTPRequest() { //1.创建XMLHttpRequest对象 //这是XMLHttpReuquest对象无 ...