AtCoder Beginner Contest 051 ABCD题
A - Haiku
Time limit : 2sec / Memory limit : 256MB
Score : 100 points
Problem Statement
As a New Year's gift, Dolphin received a string s of length 19.
The string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters]
.
Dolphin wants to convert the comma-separated string s into a space-separated string.
Write a program to perform the conversion for him.
Constraints
- The length of s is 19.
- The sixth and fourteenth characters in s are
,
. - The other characters in s are lowercase English letters.
Input
The input is given from Standard Input in the following format:
s
Output
Print the string after the conversion.
Sample Input 1
happy,newyear,enjoy
Sample Output 1
happy newyear enjoy
Replace all the commas in happy,newyear,enjoy
with spaces to obtain happy newyear enjoy
.
Sample Input 2
haiku,atcoder,tasks
Sample Output 2
haiku atcoder tasks
Sample Input 3
abcde,fghihgf,edcba
Sample Output 3
abcde fghihgf edcba
题意:根据样列猜题意
解法:模拟
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
for(int i=;i<s.length();i++)
{
if(s[i]!=',')
{
cout<<s[i];
}
else
{
cout<<" ";
}
}
}
B - Sum of Three Integers
Time limit : 2sec / Memory limit : 256MB
Score : 200 points
Problem Statement
You are given two integers K and S.
Three variable X,Y and Z takes integer values satisfying 0≤X,Y,Z≤K.
How many different assignments of values to X,Y and Z are there such that X+Y+Z=S?
Constraints
- 2≤K≤2500
- 0≤S≤3K
- K and S are integers.
Input
The input is given from Standard Input in the following format:
K S
Output
Print the number of the triples of X,Y and Z that satisfy the condition.
Sample Input 1
2 2
Sample Output 1
6
There are six triples of X,Y and Z that satisfy the condition:
- X=0,Y=0,Z=2
- X=0,Y=2,Z=0
- X=2,Y=0,Z=0
- X=0,Y=1,Z=1
- X=1,Y=0,Z=1
- X=1,Y=1,Z=0
Sample Input 2
5 15
Sample Output 2
1
The maximum value of X+Y+Z is 15, achieved by one triple of X,Y and Z.
题意:看样列猜题意
解法:乍一看感觉是暴力,但不怎么妥当,我这里采用数组保存的方式 500+x+y==s-z记录符合要求的个数
#include<bits/stdc++.h>
using namespace std;
int a[];
int main()
{
int k,s;
cin>>k>>s;
for(int i=;i<=k;i++)
{
for(int j=;j<=k;j++)
{
a[+i+j]++;
}
}
int sum=;
for(int i=;i<=k;i++)
{
int pos=s-i;
if(pos<)
{
continue;
}
sum+=a[+pos];
}
cout<<sum<<endl;
return ;
}
C - Back and Forth
Time limit : 2sec / Memory limit : 256MB
Score : 300 points
Problem Statement
Dolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.
Currently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.
Here, both the x- and y-coordinates before and after each movement must be integers.
He will first visit the point (tx,ty) where sx<tx and sy<ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point(sx,sy).
Here, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).
Under this condition, find a shortest path for him.
Constraints
- −1000≤sx<tx≤1000
- −1000≤sy<ty≤1000
- sx,sy,tx and ty are integers.
Input
The input is given from Standard Input in the following format:
sx sy tx ty
Output
Print a string S that represents a shortest path for Dolphin.
The i-th character in S should correspond to his i-th movement.
The directions of the movements should be indicated by the following characters:
U
: UpD
: DownL
: LeftR
: Right
If there exist multiple shortest paths under the condition, print any of them.
Sample Input 1
0 0 1 2
Sample Output 1
UURDDLLUUURRDRDDDLLU
One possible shortest path is:
- Going from (sx,sy) to (tx,ty) for the first time: (0,0) → (0,1) → (0,2) → (1,2)
- Going from (tx,ty) to (sx,sy) for the first time: (1,2) → (1,1) → (1,0) → (0,0)
- Going from (sx,sy) to (tx,ty) for the second time: (0,0) → (−1,0) → (−1,1) → (−1,2) → (−1,3) → (0,3) → (1,3) → (1,2)
- Going from (tx,ty) to (sx,sy) for the second time: (1,2) → (2,2) → (2,1) → (2,0) → (2,−1) → (1,−1) → (0,−1) → (0,0)
Sample Input 2
-2 -2 1 1
Sample Output 2
UURRURRDDDLLDLLULUUURRURRDDDLLDL
题意:看样列猜题意
解法:根据提示进行模拟
#include<bits/stdc++.h>
using namespace std;
int a[];
int main()
{
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
for(int i=;i<=ty-sy;i++)
{
cout<<"U";
}
for(int i=;i<=tx-sx;i++)
{
cout<<"R";
}
for(int i=;i<=ty-sy;i++)
{
cout<<"D";
}
for(int i=;i<=tx-sx;i++)
{
cout<<"L";
}
cout<<"L";
for(int i=;i<=ty-sy;i++)
{
cout<<"U";
}
cout<<"R";
for(int i=;i<=tx-sx;i++)
{
cout<<"R";
}
cout<<"D";
cout<<"R";
for(int i=;i<=ty-sy;i++)
{
cout<<"D";
}
cout<<"L";
for(int i=;i<=tx-sx;i++)
{
cout<<"L";
}
cout<<"U";
return ;
}
D - Candidates of No Shortest Paths
Time limit : 2sec / Memory limit : 256MB
Score : 400 points
Problem Statement
You are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.
The i-th (1≤i≤M) edge connects vertex ai and vertex bi with a distance of ci.
Here, a self-loop is an edge where ai=bi(1≤i≤M), and double edges are two edges where (ai,bi)=(aj,bj) or (ai,bi)=(bj,aj)(1≤i<j≤M).
A connected graph is a graph where there is a path between every pair of different vertices.
Find the number of the edges that are not contained in any shortest path between any pair of different vertices.
Constraints
- 2≤N≤100
- N−1≤M≤min(N(N−1)⁄2,1000)
- 1≤ai,bi≤N
- 1≤ci≤1000
- ci is an integer.
- The given graph contains neither self-loops nor double edges.
- The given graph is connected.
Input
The input is given from Standard Input in the following format:
N M
a1 b1 c1
a2 b2 c2
:
aM bM cM
Output
Print the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.
Sample Input 1
3 3
1 2 1
1 3 1
2 3 3
Sample Output 1
1
In the given graph, the shortest paths between all pairs of different vertices are as follows:
- The shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.
- The shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.
- The shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.
- The shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.
- The shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.
- The shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.
Thus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.
Sample Input 2
3 2
1 2 1
2 3 1
Sample Output 2
0
Every edge is contained in some shortest path between some pair of different vertices.
题意:让我们找出不含最短路径的道路有多少条
解法:先Floyd跑一次,然后比较原始道路和现在的道路,距离不同就说明最短路径也不经过这条道路,然后加一
#include<bits/stdc++.h>
using namespace std;
long long a[][];
long long b[][];
int inf=(<<)-;
int main()
{
int n,m;
cin>>n>>m;
for(int i=;i<=n;i++)
{
for(int j=;j<=n;j++)
{
a[i][j]=inf;
b[i][j]=inf;
}
b[i][i]=;
a[i][i]=;
}
for(int i=;i<=m;i++)
{
long long x,y,z;
cin>>x>>y>>z;
a[x][y]=min(z,a[x][y]);
a[y][x]=min(z,a[y][x]);
b[x][y]=min(z,b[x][y]);
b[y][x]=min(z,b[y][x]);
}
for(int k=;k<=n;k++)
{
for(int i=;i<=n;i++)
{
for(int j=;j<=n;j++)
{
a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
// cout<<a[i][j]<<" "<<i<<" "<<j<<" "<<k<<endl;
}
}
}
int sum=;
for(int i=;i<=n;i++)
{
for(int j=+i;j<=n;j++)
{
if(b[i][j]!=inf&&a[i][j]!=b[i][j])
{
sum++;
//cout<<i<<" "<<j<<endl;
// cout<<a[i][j]<<" "<<b[i][j]<<endl;
}
}
}
cout<<sum<<endl;
// cout<<b[1][2]<<endl;
return ;
}
AtCoder Beginner Contest 051 ABCD题的更多相关文章
- AtCoder Beginner Contest 068 ABCD题
A - ABCxxx Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement This contes ...
- AtCoder Beginner Contest 053 ABCD题
A - ABC/ARC Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Smeke has ...
- AtCoder Beginner Contest 069 ABCD题
题目链接:http://abc069.contest.atcoder.jp/assignments A - K-City Time limit : 2sec / Memory limit : 256M ...
- AtCoder Beginner Contest 070 ABCD题
题目链接:http://abc070.contest.atcoder.jp/assignments A - Palindromic Number Time limit : 2sec / Memory ...
- AtCoder Beginner Contest 057 ABCD题
A - Remaining Time Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Dol ...
- AtCoder Beginner Contest 052 ABCD题
A - Two Rectangles Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement The ...
- AtCoder Beginner Contest 054 ABCD题
A - One Card Poker Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Ali ...
- AtCoder Beginner Contest 058 ABCD题
A - ι⊥l Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Three poles st ...
- AtCoder Beginner Contest 050 ABC题
A - Addition and Subtraction Easy Time limit : 2sec / Memory limit : 256MB Score : 100 points Proble ...
随机推荐
- Python多线程模块
引言 thread threading 1 Thread 11 下面使用threading模块实现与上面相同的功能 12 在创建新线程时还可以给Thread传递可调用类的对象这样使用类本身来保存信息 ...
- 侧方位停车想一次过,掌握边线30cm很重要!
侧方位停车要想一次过关,关键在于保持车身距离库边线30cm左右的距离.但是,往往有很多学员掌控不好这个距离,导致倒库时压线.那么,如何找准这个30cm呢?下面,小编就来教大家方法,赶紧学习吧! 侧方位 ...
- WPF-初始屏幕(SplashScreen)
本主题介绍如何将启动窗口(也称为“初始屏幕”)添加到 Windows Presentation Foundation (WPF) 应用程序. 添加现有图像作为初始屏幕 创建或查找要用于初始屏幕的图像. ...
- 在Eclipse配置自动提示
1.我们打开eclipse,选择菜单栏的window选项 2.点击Windows,选择下拉菜单里面的preferences选项,之后在打开的对话框的左侧找到Java选项 3.之后点击Java选项,选择 ...
- Java 高阶 —— native 关键字与 JNI
1. JNI Java中JNI的使用详解第一篇:HelloWorld JNI:Java Native Interface,Java 本地接口(或本机接口,更具体地讲叫本地编程接口),其提供了若干 AP ...
- MAC 地址解析
windows cmd 命令行通过 ipconfig /all:查看本地的 ip 地址以及 mac地址: MAC 地址的前三个字节代表厂商: 00:50:56/00:0c:29:vmware 公司 c ...
- 洛谷P1119灾后重建——Floyd
题目:https://www.luogu.org/problemnew/show/P1119 N很小,考虑用Floyd: 因为t已经排好序,所以逐个加点,Floyd更新即可: 这也给我们一个启发,如果 ...
- shell json简单处理
- 卸载TwinCat3之后vs未能正确加载包错误解决
如上图所示错误. 使用vs开发人员命令提示,输入以下代码.会清除所有用户设置,然后就没有错误提示了. devenv /resetuserdata
- ThinkPHP3.2.3中,查询语句中in的使用方法。
//删除分类 public function del(){ $cid = I('get.cid'); $cate = M('category')->field('cid,pid')->se ...