OUC_Summer Training_ DIV2_#11 722
企鹅很忙系列~(可惜只会做3道题T_T)
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two segments of this set intersect. In one move Polo can either widen any segment of the set 1 unit to the left or 1 unit to the right, that is transform [l; r] to either segment[l - 1; r], or to segment [l; r + 1].
The value of a set of segments that consists of n segments [l1; r1], [l2; r2], ..., [ln; rn] is the number of integers x, such that there is integer j, for which the following inequality holds, lj ≤ x ≤ rj.
Find the minimum number of moves needed to make the value of the set of Polo's segments divisible by k.
Input
The first line contains two integers n and k (1 ≤ n, k ≤ 105). Each of the following n lines contain a segment as a pair of integers li andri ( - 105 ≤ li ≤ ri ≤ 105), separated by a space.
It is guaranteed that no two segments intersect. In other words, for any two integers i, j (1 ≤ i < j ≤ n) the following inequality holds,min(ri, rj) < max(li, lj).
Output
In a single line print a single integer — the answer to the problem.
Sample Input
2 3
1 2
3 4
2
3 7
1 2
3 3
4 7
0
这个题我看了好久才明白意思啊,英语真拙计,核心意思就是先给出一个数K,再给出n个区间,使得这n个区间的整数的个数和能整除k,如果不能,就要做改变,每一次改变只能增加一个整数,回答最少需要做改变的次数。
#include<stdio.h>
int main()
{
int sum = ,n,k,a,b,i,j;
scanf("%d%d",&n,&k);
while(n--)
{
scanf("%d%d",&a,&b);
sum += b - a + ;
}
if(sum % k == )printf("0\n");
else
{
printf("%d\n",k - sum %k);//k减去k的余数就是这个数还要加几才能达到k,该题中就是要改变的次数
}
return ;
}
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
Little penguin Polo has an n × m matrix, consisting of integers. Let's index the matrix rows from 1 to n from top to bottom and let's index the columns from 1 to m from left to right. Let's represent the matrix element on the intersection of row i and column j as aij.
In one move the penguin can add or subtract number d from some matrix element. Find the minimum number of moves needed to make all matrix elements equal. If the described plan is impossible to carry out, say so.
Input
The first line contains three integers n, m and d (1 ≤ n, m ≤ 100, 1 ≤ d ≤ 104) — the matrix sizes and the d parameter. Next n lines contain the matrix: the j-th integer in the i-th row is the matrix element aij (1 ≤ aij ≤ 104).
Output
In a single line print a single integer — the minimum number of moves the penguin needs to make all matrix elements equal. If that is impossible, print "-1" (without the quotes).
Sample Input
2 2 2
2 4
6 8
4
1 2 7
6 7
-1
给一个M*N的矩阵及一个数D,小企鹅喜欢矩阵,但是喜欢每个数都一样,不过它每次都只能把矩阵中的数加或者减D,输出最少的改变次数,使矩阵的数变成一样的。如果不能达到目标就输出-1,否则输出最少的次数。
用一维数组存矩阵好了(有时候不要被题目欺骗了,一维数组就能做的时候不要只想着开二维数组),然后把数组排序,中间的数就是所有的数希望变成的数(这样改变的次数才能最小)。然后计算次数。最后要说一下怎么判断这个数组不能达到目标呢。因为我写的代码是在存入数组的时候就要判断是否能达到目标,这个时候还不知道所有的数希望变成的数是什么。不如设所有的数希望变成的数是m好了,则a1 + n1 * d = m,a2 + n2 * d = m,两式相减可得(a1 - a2) / d = n2 - n1由此可以得到矩阵中任两个数的差一定是d的倍数,如果存在不是这样的数,则这个矩阵就不符合要求。
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int a[];
int main()
{ int m,n,d,i,x,y = ,sum = ;
cin >> m>> n>> d;
for(i = ;i < n*m;i++)
{
cin >> a[i];
if(i == )continue;
else if((a[i] - a[i - ]) % d != && y==)
{
y = ;
}
}
if(y == )cout << -<<endl;
else
{
sort(a,a+n*m);
int mid = n*m /;
for(i = ;i < n*m;i++)
{
x = abs(a[mid] - a[i]);
sum += x/d;
}
cout << sum<<endl;
}
return ;
}
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
Little penguin Polo adores strings. But most of all he adores strings of length n.
One day he wanted to find a string that meets the following conditions:
- The string consists of n lowercase English letters (that is, the string's length equals n), exactly k of these letters are distinct.
- No two neighbouring letters of a string coincide; that is, if we represent a string as s = s1s2... sn, then the following inequality holds, si ≠ si + 1(1 ≤ i < n).
- Among all strings that meet points 1 and 2, the required string is lexicographically smallest.
Help him find such string or state that such string doesn't exist.
String x = x1x2... xp is lexicographically less than string y = y1y2... yq, if either p < q and x1 = y1, x2 = y2, ... , xp = yp, or there is such number r(r < p, r < q), that x1 = y1, x2 = y2, ... , xr = yr and xr + 1 < yr + 1. The characters of the strings are compared by their ASCII codes.
Input
A single line contains two positive integers n and k(1 ≤ n ≤ 106, 1 ≤ k ≤ 26) — the string's length and the number of distinct letters.
Output
In a single line print the required string. If there isn't such string, print "-1" (without the quotes).
Sample Input
7 4
ababacd
4 7
-1
小企鹅喜欢字符串,给定字符串长度n,字符串中还必须包括k个不同的字符,相邻字符还不一样。输出符合这些条件的最小字符(按字典序排列)。很明显字符串前面肯定是ab的组合,在结尾递增的加上剩余字符即可。这个题要注意的地方有 除了1 1输出是a外,其他k == 1时输出都为-1,因为不能用一个字符组成一个前后字符不相等的字符串。(虽然是很浅显的特殊情况,但有时候就是容易忽略,今后要避免这样的情况发生)。
不过这个题我要抱怨一下,一开始编译的时候,str[i] = str[i - 1] + 1;这行代码得到的不是我想要的结果,除了前面的ab其他的打印出来都是笑脸,你难道想让我陪你玩一会在提交?笑什么笑。。。不过后来在演示这一奇葩现象的时候又恢复了正常了。亏我在代码中还用了强制转换,其实根本用不上好吗。
#include<stdio.h>
char str[];
int main()
{
int n,k,i,j,m;
scanf("%d%d",&n,&k);
if(n == && k==)printf("a\n");
else if(k > n || k==)printf("-1\n");
else if(k == n)
{
for(i = ;i < n;i++)
{
if(i == )
str[] = 'a';
else
str[i] = (char)((int)str[i-] +);
}
str[n] = '\0';
printf("%s\n",str);
}
else if(k < n)
{
m =n - (k - );
if(m % == )
{
for(i = ;i < m-;i = i+)
{
str[i] = 'a';
str[i+] = 'b';
}
for(;i < n;i++)
str[i] = (char)((int)str[i-] +);
}
else
{
for(i = ;i < m-;i = i+)
{
str[i] = 'a';
str[i+] = 'b';
}
str[i++] = 'a';
str[i++] = 'c';
for(;i < n;i++)
str[i] = (char)((int)str[i-] +);
}
str[n] = '\0';
printf("%s\n",str);
}
return ;
}
当然,这个题不用字符串存起来也行,可惜当时只想到用字符串的方法。
感觉自己写题解废话越来越多了,多写上了自己的感受,和wa的原因,主要还是因为写的这些东西都是为了留下纪念,所以废话多一点的话今后看起来比较亲切。若有路过的大神不要嫌弃啊(其实我这些渣题不会有大神来看的啦~)。
OUC_Summer Training_ DIV2_#11 722的更多相关文章
- OUC_Summer Training_ DIV2_#14 724
又落下好多题解啊...先把今天的写上好了. A - Snow Footprints Time Limit:1000MS Memory Limit:262144KB 64bit IO F ...
- OUC_Summer Training_ DIV2_#16 725
今天做了这两道题真的好高兴啊!!我一直知道自己很渣,又贪玩不像别人那样用功,又没有别人有天赋.所以感觉在ACM也没有学到什么东西,没有多少进步.但是今天的B题告诉我,进步虽然不明显,但是只要坚持努力的 ...
- OUC_Summer Training_ DIV2_#13 723afternoon
A - Shaass and Oskols Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I ...
- OUC_Summer Training_ DIV2_#12(DP1) 723
这一次是做练习,主要了解了两个算法,最大子矩阵和,最长上升子序列. 先看题好啦. A - To The Max Time Limit:1000MS Memory Limit:32768KB ...
- OUC_Summer Training_ DIV2_#2之解题策略 715
这是第一天的CF,是的,我拖到了现在.恩忽视掉这个细节,其实这一篇只有一道题,因为这次一共做了3道题,只对了一道就是这一道,还有一道理解了的就是第一篇博客丑数那道,还有一道因为英语实在太拙计理解错了题 ...
- OUC_Summer Training_ DIV2_#7 718
是18号做的题啦,现在才把报告补上是以前不重视报告的原因吧,不过现在真的很喜欢写报告,也希望能写一些有意义的东西出来. A - Dragons Time Limit:2000MS Memory ...
- OUC_Summer Training_ DIV2_#9 719
其实自己只会做很简单的题,有时都不想写解题报告,觉得不值得一写,但是又想到今后也许就不会做ACM了,能留下来的东西只有解题报告了,所以要好好写,很渣的题也要写,是今后的纪念. B - B Time L ...
- OUC_Summer Training_ DIV2_#5
这是做的最好的一次了一共做了4道题 嘻嘻~ A - Game Outcome Time Limit:2000MS Memory Limit:262144KB 64bit IO For ...
- OUC_Summer Training_ DIV2_#4之数据结构
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26100#problem/A A - A Time Limit:1000MS Me ...
随机推荐
- 无法删除登录名 '***',因为该用户当前正处于登录状态。 (Microsoft SQL Server,错误: 15434)
问题描述: 当删除数据库用户时,有时会得到这样的提示: 无法删除登录名 '***',因为该用户当前正处于登录状态. (Microsoft SQL Server,错误: 15434) 解决办法: 1.首 ...
- 发送短信——java
闲来无事研究一下调用第三方接口发送短信的技术 这一次我们使用阿里的短信服务 一.进行平台相关服务的注册和设置 下面请参照阿里的短信服务文档进行设置,只要按照文档步骤来差不多30分钟就能搞定服务注册: ...
- tempfile:临时文件系统对象
介绍 想要安全的创建名字唯一的临时文件,以防止被试图破坏应用或窃取数据的人猜出,这很有难度.tempfile模块提供了多个函数来安全创建临时文件系统资源.TemporaryFile函数打开并返回一个未 ...
- web开发:jquery高级
一.jq选择器 二.属性操作 三.jq轮播图 四.样式操作 五.jq动事件 六.jq动画 七.自定义动画 八.jq动画案例 一.jq选择器 - css3语法选择器 ```js$('css3选择器位') ...
- java8 常用语法小结
// 判空 // 排序 //映射 //序列化
- Base64编码与解码的作用
1.便于网络传输. 2.不可见性. 3.适合在http,mime协议下快速传输数据. 4 区别于加密,Base64是可以解码的,编码是 公开的,Base 64编码,任何人都可以解码
- Introduction to Go Modules
转:https://roberto.selbach.ca/intro-to-go-modules/ git init git add * git commit -am "First comm ...
- JVM命令jinfo
jinfo也是jvm中参与的一个命令,可以查看运行中jvm的全部参数,还可以设置部分参数. 格式 jinfo [ option ] pid jinfo [ opti ...
- 洛谷-P3796-AC自动机加强版
链接: https://www.luogu.org/problem/P3796 题意: 有NN个由小写字母组成的模式串以及一个文本串TT.每个模式串可能会在文本串中出现多次.你需要找出哪些模式串在文本 ...
- 【SaltStack官方版】—— returners——返回器
ETURNERS 返回器 By default the return values of the commands sent to the Salt minions are returned to t ...