Educational Codeforces Round 16 （A-E）

最新推荐文章于 2019-03-12 16:12:54 发布
最新推荐文章于 2019-03-12 16:12:54 发布
阅读量990 收藏
点赞数 2
分类专栏： codeforces 文章标签： Educational Codeforces Round 16 AE
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/liangzhaoyang1/article/details/52289666
版权

A. King Moves
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The only king stands on the standard chess board. You are given his position in format "cd", where c is the column from 'a' to 'h' and dis the row from '1' to '8'. Find the number of moves permitted for the king.

Check the king's moves here https://en.wikipedia.org/wiki/King_(chess).

King moves from the position e4
Input

The only line contains the king's position in the format "cd", where 'c' is the column from 'a' to 'h' and 'd' is the row from '1' to '8'.

Output

Print the only integer x — the number of moves permitted for the king.

Example
input 
e4
output 
8
题解：额。。。水题

代码：

#pragma comment(linker, "/STACK:102400000,102400000")
//#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mst(a) memset(a, 0, sizeof(a))
#define M_P(x,y) make_pair(x,y)  
#define rep(i,j,k) for (int i = j; i <= k; i++)  
#define per(i,j,k) for (int i = j; i >= k; i--)  
#define lson x << 1, l, mid  
#define rson x << 1 | 1, mid + 1, r  
const int lowbit(int x) { return x&-x; }  
const double eps = 1e-8;  
const int INF = 1e9+7; 
const ll inf =(1LL<<62) ;
const int MOD = 1e9 + 7;  
const ll mod = (1LL<<32);
const int N = 2010; 
const int M=100010;
const int maxn=2e3+7; 
template <class T1, class T2>inline void getmax(T1 &a, T2 b) {if (b>a)a = b;}  
template <class T1, class T2>inline void getmin(T1 &a, T2 b) {if (b<a)a = b;}
int read(){
int v = 0, f = 1;char c =getchar();
while( c < 48 || 57 < c ){if(c=='-') f = -1;c = getchar();}
while(48 <= c && c <= 57) v = v*10+c-48, c = getchar();
return v*f;}

int main()
{
	#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
	string s;
	cin>>s;
	int k=8;
	if(s[0]=='a' || s[0]=='h')
		k-=3;
	if(s[1]=='1' || s[1]=='8')
		k-=3;
	cout<<max(k, 3);
	return 0;
}

B. Optimal Point on a Line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given n points on a line with their coordinates xi. Find the point x so the sum of distances to the given points is minimal.

Input

The first line contains integer n (1 ≤ n ≤ 3·105) — the number of points on the line.

The second line contains n integers xi ( - 109 ≤ xi ≤ 109) — the coordinates of the given n points.

Output

Print the only integer x — the position of the optimal point on the line. If there are several optimal points print the position of the leftmost one. It is guaranteed that the answer is always the integer.

Example
input 
4
1 2 3 4
output 
2
题解：额。。。水题

AC代码：

#pragma comment(linker, "/STACK:102400000,102400000")
//#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mst(a) memset(a, 0, sizeof(a))
#define M_P(x,y) make_pair(x,y)  
#define rep(i,j,k) for (int i = j; i <= k; i++)  
#define per(i,j,k) for (int i = j; i >= k; i--)  
#define lson x << 1, l, mid  
#define rson x << 1 | 1, mid + 1, r  
const int lowbit(int x) { return x&-x; }  
const double eps = 1e-8;  
const int INF = 1e9+7; 
const ll inf =(1LL<<62) ;
const int MOD = 1e9 + 7;  
const ll mod = (1LL<<32);
const int N = 3e5+7; 
const int M=100010;
const int maxn=2e3+7; 
template <class T1, class T2>inline void getmax(T1 &a, T2 b) {if (b>a)a = b;}  
template <class T1, class T2>inline void getmin(T1 &a, T2 b) {if (b<a)a = b;}
int read(){
int v = 0, f = 1;char c =getchar();
while( c < 48 || 57 < c ){if(c=='-') f = -1;c = getchar();}
while(48 <= c && c <= 57) v = v*10+c-48, c = getchar();
return v*f;}
int a[N];
int main()
{
	#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	cin>>a[i];
	sort(a,a+n);
	cout<<a[(n-1)/2];
	return 0;
}

C. Magic Odd Square
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Find an n × n matrix with different numbers from 1 to n2, so the sum in each row, column and both main diagonals are odd.

Input

The only line contains odd integer n (1 ≤ n ≤ 49).

Output

Print n lines with n integers. All the integers should be different and from 1 to n2. The sum in each row, column and both main diagonals should be odd.

Examples
input 
1
output 
1
input 
3
output 
2 1 4
3 5 7
6 9 8
题解：让你分别使矩阵的行，列，斜的数加起来都是奇数。输入是odd。基础构造。

代码：

#pragma comment(linker, "/STACK:102400000,102400000")
//#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mst(a) memset(a, 0, sizeof(a))
#define M_P(x,y) make_pair(x,y)  
#define rep(i,j,k) for (int i = j; i <= k; i++)  
#define per(i,j,k) for (int i = j; i >= k; i--)  
#define lson x << 1, l, mid  
#define rson x << 1 | 1, mid + 1, r  
const int lowbit(int x) { return x&-x; }  
const double eps = 1e-8;  
const int INF = 1e9+7; 
const ll inf =(1LL<<62) ;
const int MOD = 1e9 + 7;  
const ll mod = (1LL<<32);
const int N = 3e5+7; 
const int M=100010;
const int maxn=2e3+7; 
template <class T1, class T2>inline void getmax(T1 &a, T2 b) {if (b>a)a = b;}  
template <class T1, class T2>inline void getmin(T1 &a, T2 b) {if (b<a)a = b;}
int read(){
int v = 0, f = 1;char c =getchar();
while( c < 48 || 57 < c ){if(c=='-') f = -1;c = getchar();}
while(48 <= c && c <= 57) v = v*10+c-48, c = getchar();
return v*f;}
int main()
{
	#ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
	int n;
	cin>>n;
	int m=n/2+1;
	int a[n+1][n+1];
	int k=1,l=2;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(abs(m-i)+abs(m-j)<m){
				cout<<k<<' ';
				k+=2;
			}
			else{
				cout<<l<<' ';
				l+=2;
			}
		}
		cout<<endl;
	}
	return 0;
}

D. Two Arithmetic Progressions
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given two arithmetic progressions: a1k + b1 and a2l + b2. Find the number of integers x such that L ≤ x ≤ R andx = a1k' + b1 = a2l' + b2, for some integers k', l' ≥ 0.

Input

The only line contains six integers a1, b1, a2, b2, L, R (0 < a1, a2 ≤ 2·109,  - 2·109 ≤ b1, b2, L, R ≤ 2·109, L ≤ R).

Output

Print the desired number of integers x.

Examples
input 
2 0 3 3 5 21
output 
3
input 
2 4 3 0 6 17
output 
2
题解：让你找出符合x = a1k' + b1 = a2l' + b2，且 L ≤ x ≤ R的x的个数。

这题被人hack了。（待补。。。数学题）。。。

E. Generate a String
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

zscoder wants to generate an input file for some programming competition problem.

His input is a string consisting of n letters 'a'. He is too lazy to write a generator so he will manually generate the input in a text editor.

Initially, the text editor is empty. It takes him x seconds to insert or delete a letter 'a' from the text file and y seconds to copy the contents of the entire text file, and duplicate it.

zscoder wants to find the minimum amount of time needed for him to create the input file of exactly n letters 'a'. Help him to determine the amount of time needed to generate the input.

Input

The only line contains three integers n, x and y (1 ≤ n ≤ 107, 1 ≤ x, y ≤ 109) — the number of letters 'a' in the input file and the parameters from the problem statement.

Output

Print the only integer t — the minimum amount of time needed to generate the input file.

Examples
input 
8 1 1
output 
4
input 
8 1 10
output 
8

题解：初始化有一个空的文本，要求生成得到n 个‘a’字母，  插入或删除一个‘a’需要x秒，复制目前的字符串需要y秒，问你达到n个‘a’字母最少要几秒。

设dp[i]表示第 i 个‘a’字符最少要多少秒。

那么初始化dp[1]=x。

如果 i 等于奇数。则dp[i]=min(dp[i-1]+x,dp[(i+1)/2]+x+y)；只可能是插入或删除，或插入或删除和复制都有。

如果 i 等于偶数。则dp[i]=min(dp[i/2]+y,dp[i-1]+x)。只可能是复制以及插入或删除。

代码：

#pragma comment(linker, "/STACK:102400000,102400000")
//#include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mst(a) memset(a, 0, sizeof(a))
#define M_P(x,y) make_pair(x,y)  
#define rep(i,j,k) for (int i = j; i <= k; i++)  
#define per(i,j,k) for (int i = j; i >= k; i--)  
#define lson x << 1, l, mid  
#define rson x << 1 | 1, mid + 1, r  
const int lowbit(int x) { return x&-x; }  
const double eps = 1e-8;  
const int INF = 1e9+7; 
const ll inf =(1LL<<62) ;
const int MOD = 1e9 + 7;  
const ll mod = (1LL<<32);
const int N = 10000010; 
const int M=100010;
const int maxn=2e3+7; 
template <class T1, class T2>inline void getmax(T1 &a, T2 b) {if (b>a)a = b;}  
template <class T1, class T2>inline void getmin(T1 &a, T2 b) {if (b<a)a = b;}
int read(){
int v = 0, f = 1;char c =getchar();
while( c < 48 || 57 < c ){if(c=='-') f = -1;c = getchar();}
while(48 <= c && c <= 57) v = v*10+c-48, c = getchar();
return v*f;}
ll dp[N];
int n;
ll x,y;
int main()
{
	#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    cin>>n>>x>>y;
	dp[1]=x;
	for(int i=2;i<=n;i++)
	{
		if(i&1) 
		  dp[i]=min(dp[i-1]+x,dp[(i+1)/2]+x+y);
		else dp[i]=min(dp[i/2]+y,dp[i-1]+x);
	}
	cout<<dp[n];
    return 0;
}

F. String Set Queries
time limit per test
3 seconds
memory limit per test
768 megabytes
input
standard input
output
standard output

You should process m queries over a set D of strings. Each query is one of three kinds:

  1. Add a string s to the set D. It is guaranteed that the string s was not added before.
  2. Delete a string s from the set D. It is guaranteed that the string s is in the set D.
  3. For the given string s find the number of occurrences of the strings from the set D. If some string p from D has several occurrences in s you should count all of them.

Note that you should solve the problem in online mode. It means that you can't read the whole input at once. You can read each query only after writing the answer for the last query of the third type. Use functions fflush in C++ and BufferedWriter.flush inJava languages after each writing in your program.

Input

The first line contains integer m (1 ≤ m ≤ 3·105) — the number of queries.

Each of the next m lines contains integer t (1 ≤ t ≤ 3) and nonempty string s — the kind of the query and the string to process. All strings consist of only lowercase English letters.

The sum of lengths of all strings in the input will not exceed 3·105.

Output

For each query of the third kind print the only integer c — the desired number of occurrences in the string s.

Examples
input 
5
1 abc
3 abcabc
2 abc
1 aba
3 abababc
output 
2
2
input 
10
1 abc
1 bcd
1 abcd
3 abcd
2 abcd
3 abcd
2 bcd
3 abcd
2 abc
3 abcd
output 
3
2
1
0
(待补。。。AC自动机)












LzyRapX
关注
  • 2
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Educational Codeforces Round 16 E. Generate a String （DP）
dituonian8372的博客
08-23 114
Generate a String 题目链接： http://codeforces.com/contest/710/problem/E Description zscoder wants to generate an input file for some programming competition problem. His input is a string consistin...
Educational Codeforces Round 16 D. Two Arithmetic Progressions
10-31 96
解线性同余方程组，且方程仅2个，另外得到的x限制在L,R区间内， 观察一下A1K-A2L=B2-B1，便可知，通解(K,L)中会同时增大或同时减小，大可以先使得K，L大于等于0，于是之后只需要考虑让K不断增大且这样得到的x在[L,R]内即可。 由x在[L,R]中，便可以求出K的范围，然后分情况讨论一下就好了。 #include <cmath> #include &...
Educational Codeforces Round 16
aekijekzn484879763的博客
08-29 96
Problem AKing Moves 题目大意 　　有一个国际象棋的棋盘，给定一个国王的位置，求其移动一步可到达的合法位置数量。 解题分析 　　国王的位置可以分为3类，每类的答案为8、5、3。 参考程序 1 #include <map> 2 #include <set> 3 #include <stack> 4 #...
【Educational Codeforces Round 16】Codeforces 710B Optimal Point on a Line
YHaX的博客
08-27 792
推导
Educational Codeforces Round 83 (Rated for Div. 2) D
01-20
今天CF被D恶心到了，写个题解重新整理下思路，（20开始想，25写完暴力代码，1.30才过，优化后的。。 核心思路就是在暴力的基础上进行组合数等差加速。 C(n-2,i-1)*C(j-1,n-2)*(i-1) __ j: n-1 -> m ...
Educational Codeforces Round 83 (Rated for Div. 2) E. Array Shrinking
01-03
葫芦聚聚说可以n^2搞。。 还好没卡我n^3 的做法。。 核心思路就是f[i]表示 前i个数最小能分成几个数。 然后由于前i个数都分好了，我们只需要取min f[k]+1( 满足k<i>n; for(int i=1;i>a[i],d
Educational Codeforces Round 157D. XOR Construction
最新发布
11-06
Educational Codeforces Round 157D. XOR Construction
Educational Codeforces Round 85 (Rated for Div. 2) B. Middle Class（贪心）
01-03
目录传送门题意：思路：代码： 传送门 题意： 思路： 排个序，然后从最大的开始判断是否合适即可 代码： #include #include #include #include #include #include #include ...#define SZ(x) (
Educational Codeforces Round 85 (Rated for Div. 2) A. Level Statistics
01-03
目录传送门题意：思路：代码： 传送门 题意： 思路： 就是让判断给出的数据是否合理 两个p,c p,c肯定是是增加的，要么不变 p不变的话，c肯定不能变 始终p应该是大于等于c的 如果两个同时增加，p增加的应该大于等于c...
Educational Codeforces Round 16 C 题 Magic Odd Square
dreamnyc
08-30 458
C. Magic Odd Square time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Find an n × n matrix with different numb
【解题报告】Educational Codeforces Round 16
TRiddle的博客
08-27 778
简略的解题报告。
Optimal Point on a Line （思维）
red_red_red的博客
03-12 340
You are givennpoints on a line with their coordinatesxi. Find the pointxso the sum of distances to the given points is minimal. Input The first line contains integern(1 ≤ n ≤ 3·105) — the num...
A. Points on the line
wtml
02-26 324
A. Points on the line time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output We’ve got no test cases. A big olympiad is coming up. But the problem
Educational Codeforces Round 16 B. Optimal Point on a Line
Coldplay
08-23 421
You are given n points on a line with their coordinates xi. Find the point x so the sum of distances to the given points is minimal. Input The first line contains integer n (1 ≤ n ≤ 3·105)
AIM Tech Round 3 (Div. 2) E. Centroids （树形dp）
LzyRapX
08-26 1351
E. Centroids time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Tree is a connected acyclic graph. Suppose you
#7 B. Memory Manager（细节+模拟）
LzyRapX
04-10 1287
题目链接： 点击打开链接 http://www.codeforces.com/contest/7/problem/B Description There is little time left before the release of the first national operating system BerlOS. Some of its components ar
VK cup Div1 C. Vulnerable Kerbals （扩展gcd+DAG+最长路）
LzyRapX
04-19 1217
题目链接： 点击打开链接 http://codeforces.com/contest/800/problem/C C. Vulnerable Kerbals 题意： 给定n个0~m-1内的数和m，构造一个尽可能长的所有元素都在0~m-1内的数列，并且使所有前缀积模m不相同且不在n个数中出现过。 题解： 如果前 i 个数的前缀积为x，前i+1个数的前缀积可以为y当且仅当ax-b
E. Bindian Signalizing （拆环成链）（好题）
LzyRapX
04-05 1199
点击打开链接 http://codeforces.com/contest/5/problem/E E. Bindian Signalizing Everyone knows that long ago on the territory of present-day Berland there lived Bindian tribes. Their capital wa
educational codeforces round
06-06
educational codeforces round是一种教育性质的Codeforces比赛，旨在提高参赛者的编程水平和算法能力。这种比赛通常包含一系列有挑战性的算法问题，需要选手利用自己的编程知识和经验进行解决。通过参加这种比赛，选手可以锻炼自己的计算机科学技能，并与其他选手进行比较、交流和学习。

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值