2018 Multi-University Training Contest 1
比赛链接:2018 Multi-University Training Contest 1
6301 Distinct Values
题意:输出一个长度为n的序列,要求满足m个区间的数都不相同,并且字典序最小
思路:首先在草稿纸上模拟填充过程,从左往右填充,发现规律,有最小的数则取出最小的数。越过某些区间时,某些数字又可以重复使用利用set来维护这个待取出的集合
代码:
#include<cstdio>
#include<iostream>
#include<set>
using namespace std;
const int maxn=1e5+10;
int pre[maxn],ans[maxn];
int main()
{
int T;
cin>>T;
while(T--)
{ int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
ans[i]=1;
pre[i]=i;
} for(int i=1;i<=m;i++)
{
int a,b;
scanf("%d %d",&a,&b);
pre[b]=min(pre[b],a);
// cout<<a<<" "<<b<<endl;
} for(int i=n-1;i>=1;i--)
{
pre[i]=min(pre[i],pre[i+1]);
}
set<int>M;
for(int i=2;i<=n;i++)M.insert(i);
ans[1]=1;
for(int i=2;i<=n;i++)
{
for(int j=pre[i-1];j<pre[i];j++)
{
M.insert(ans[j]);
}
ans[i]=*M.begin();
M.erase(ans[i]);
}
for(int i=1;i<=n;i++)
printf("%d%c",ans[i]," \n"[i==n]);
}
return 0;
}
6308 Time Zone
题意:给出时间和时区,转换成UTC+8的时间
思路:将所有的时间都转换成分钟,输出用%02d,可是当时卡在了精度上面
double mm=off*60.0-480.0将时间偏差转化成分钟
mm转化成整数时,由于精度损失,1.0可能被表示成0.99999,导致1.0变成0(一般精度损失是减小原数字)
特别注意:当mm为正数时,需要将mm先加0.00001,而mm为负数是应该减掉0.00001
ac代码:
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int T,h,m;
double off;
cin>>T;
while(T--)
{
scanf("%d %d UTC%lf",&h,&m,&off);
double mm=off*60.0-480.0;
int mk;
if(mm>0)mk=mm+0.0001;
else mk=mm-0.0001;
int now=h*60+m+mk;
if(now>=0)now%=(24*60);
else now+=(24*60);
printf("%02d:%02d\n",now/60,now%60);
}
return 0;
}
2018 Multi-University Training Contest 1的更多相关文章
- 2018 Nowcoder Multi-University Training Contest 2
目录 Contest Info Solutions A. run D. monrey G. transform H. travel I. car J. farm Contest Info Practi ...
- 2018 Nowcoder Multi-University Training Contest 1
Practice Link J. Different Integers 题意: 给出\(n\)个数,每次询问\((l_i, r_i)\),表示\(a_1, \cdots, a_i, a_j, \cdo ...
- 2018 Nowcoder Multi-University Training Contest 5
Practice Link A. gpa 题意: 有\(n\)门课程,每门课程的学分为\(s_i\),绩点为\(c_i\),要求最多删除\(k\)门课程,使得gpa最高. gpa计算方式如下: \[ ...
- 2018 Nowcoder Multi-University Training Contest 10
Practice Link J. Rikka with Nickname 题意: 给出\(n\)个字符串,要求依次合并两个串\(s, t\),满足将\(t\)合并到\(s\)中变成\(r\),使得\( ...
- HDU 2018 Multi-University Training Contest 3 Problem A. Ascending Rating 【单调队列优化】
任意门:http://acm.hdu.edu.cn/showproblem.php?pid=6319 Problem A. Ascending Rating Time Limit: 10000/500 ...
- 2018 Multi-University Training Contest 2
题目链接:2018 Multi-University Training Contest 2 6318 Swaps and Inversions 题意:sum=x*逆序个数+交换次数*y,使sum最小 ...
- hdu 6301 Distinct Values (2018 Multi-University Training Contest 1 1004)
Distinct Values Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)T ...
- 2018 Multi-University Training Contest 4 Problem J. Let Sudoku Rotate 【DFS+剪枝+矩阵旋转】
任意门:http://acm.hdu.edu.cn/showproblem.php?pid=6341 Problem J. Let Sudoku Rotate Time Limit: 2000/100 ...
- 2018 Multi-University Training Contest 4 Problem K. Expression in Memories 【模拟】
任意门:http://acm.hdu.edu.cn/showproblem.php?pid=6342 Problem K. Expression in Memories Time Limit: 200 ...
随机推荐
- [20180928]ora-01426(补充).txt
[20180928]ora-01426(补充).txt --//链接:http://www.itpub.net/thread-2105458-1-1.html--//做一点点必要的补充: 1.环境:S ...
- spring-AOP(面向切面编程)-注解方式配置
项目结构: 切面类: package edu.nf.ch12.service.aspect; import org.aspectj.lang.JoinPoint; import org.aspectj ...
- Process 0:0:0 (0x1ffc) Worker 0x00000001E580A1A0 appears to be non-yielding on Scheduler 3. Thread creation time: 13153975602106.
现场报错如下: Process 0:0:0 (0x1ffc) Worker 0x00000001E580A1A0 appears to be non-yielding on Scheduler 3. ...
- MYSQL中默认隐式事务及利用事务DML
一:默认情况下,MySQL采用autocommit模式运行.这意味着,当您执行一个用于更新(修改)表的语句之后,MySQL立刻把更新存储到磁盘中.默认级别为不可重复读. 二:会造成隐式提交的语句以下语 ...
- 排序算法之直接插入排序的思想以及Java实现
1,基本思想 假设待排序的数据是数组A[1-.n].初始时,A[1]自成1个有序区,无序区为A[2-.n].在排序的过程中,依次将A[i] (i=2,3,-.,n)从后往前插入到前面已排好序的子数组A ...
- ps流提取H264并解码播放
因为需要从海康ps流中提取H264数据并进行解码播放,才有了这篇文章.因为是视频编解码领域的纯入门新手,个别理解或者方法有误,需要自行判断,不过相关方法已经测试通过,对于 像我这样的新手还是有一定的借 ...
- February 19th, 2018 Week 8th Monday
Love is blind, hard to find, difficult to get, and impossible to forget. 爱,很盲目,很难找,很难得,很难忘. It is al ...
- K-means算法的matlab程序
K-means算法的matlab程序 在“K-means算法的matlab程序(初步)”这篇文章中已经用matlab程序对iris数据库进行简单的实现,下面的程序最终的目的是求准确度. 作者:凯鲁嘎吉 ...
- 设置Firefox自动清除缓存,无需手动清除
1.在firefox的地址栏上输入about:config回车 2.找到browser.cache.check_doc_frequency选项,双击将3改成1保存即可. 那么这个选项每个值都是什么含义 ...
- Teradata 批量查找PI字段
select * from dbc.indicesv where indextype in ('P','Q');