Codeforces Round #704(Div.2)

A. Three swimmers

https://codeforces.ml/contest/1492/problem/A

#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 500005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;
 
using namespace std;
 
void solve()
{
	ll p,a,b,c;
	cin >> p >> a >> b >> c;
	ll ans = 1e18+10000;
	ans = min(ans,(p+a-1)/a*a-p);
	ans = min(ans,(p+b-1)/b*b-p);
	ans = min(ans,(p+c-1)/c*c-p);
	cout << ans << endl;
}
 
int main()
{
	int t;
	cin >> t;
	while(t--){
		solve();
	}
	return 0;
}

B. Card Deck：贪心

https://codeforces.ml/contest/1492/problem/B

#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 500005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;
 
using namespace std;
 
struct node{
	int st,en;
}node[N];
 
int b[N],a[N];
void solve()
{
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		b[a[i]] = i;
	}
	int en = n,st = n+1;
	int cnt = 0;
	for(int i = n; i >= 1; i--){
		if(b[i] < st){
			st = b[i];
			node[cnt].st = b[i];
			node[cnt++].en = en;
			en = b[i]-1;
		}
	}
	for(int i = 0; i < cnt; i++){
		for(int j = node[i].st; j <= node[i].en; j++){
			cout << a[j] << " ";
		}
	}
	cout << endl;
}
 
int main()
{
	int t;
	cin >> t;
	while(t--){
		solve();
	}
	return 0;
}

C.Maximum Width：前后缀和

https://codeforces.ml/contest/1492/problem/C
大意：给定字符串s，t，在s中找到和t相等子序列，求子序列相邻元素下标差值最大是多少。
思路：从s的前面开始找最先满足相等的子序列下标存在pre内，再从后开始找最先满足相等的子序列存在post内，答案就是max(post[i+1]-pre[i])

#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 500005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;
 
using namespace std;
 
char s1[N],s2[N];
int pre[N],last[N];
void solve()
{
	int n,m;
	
	cin >> n >> m;
	getchar();
	cin >> s1;
	cin >> s2;
	int p = 0,l = m-1;
	for(int i = 0; i < n; i++){
		if(s1[i] == s2[p]){
			pre[p] = i;
			p++;
		}
	} 
	for(int i = n-1; i >= 0; i--){
		if(s1[i] == s2[l]){
			last[l] = i;
			l--;
		}
	}
	int ans = 0;
	for(int i = 0; i < m; i++){
		ans = max(ans,last[i+1]-pre[i]);
	}
	cout << ans << endl;
}
 
int main()
{
	int t;
	solve();
	return 0;
}

D.Genius’s Gambit：位运算

https://codeforces.ml/contest/1492/problem/D
大意：给定a,b,k 能否找到x，y使得x和y的二进制中有a个1，b个1，x-y的二进制中有k个1。
思路：100-001 = 011，1000-0001 = 0111，还有1100-0101 = 0111，11100-01101 = 01111 从中我们可以发现当减数的最低为是零，被减数的最低位是1的时候，如果两者的其它位相同，那么相减后对应位是1，直到遇到某位(我称它为关键位)是1-0的时候这位结果位0，也就是说我们可以用这个方法去产生1，直到刚好k个1的时候我们再用1-0去阻止产生1.为了方便，我们尽量让x的零放在关键位的右侧，如果有多再往左放，y的话最低为放1，然后同x。注意特判a=0,b=1的情况。具体看代码。

#include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 500005;
const ll ds = 1e15+7;
//const double p1 = 3.141592653589793238462643383;

using namespace std;

void solve()
{
	int a,b,k;
	string x,y;
	cin >> a >> b >> k;
	if(b == 1 || a == 0){
		if(k == 0){
			puts("YES");
			for(int i = 1; i <= b; i++) x += "1";
			for(int i = 1; i <= a; i++) x += "0";
			cout << x << "\n" << x;
		}
		else puts("NO");
	}
	else{
		x = y = "1";
		int flag = 0;
		if(k <= a){
			flag = 1;//零有多
			for(int i = 1; i < b-1; i++) x += "1";//1全放在关键位左边
			for(int i = 1; i <= a-k; i++) x += "0";//补上多余的零
			x += "1";//关键位
			for(int i = 1; i <= k; i++)	x += "0";//k个零放在关键位右边去产生1
			for(int i = 1; i < b-1; i++) y += "1";
			for(int i = 1; i <= a; i++) y += "0";
			y += "1";//最低为放1
		//	cout << x << " " << y;
		}
		else{
			if(k-a <= b-2){
				flag = 1;//零不够，用1补
				for(int i = 1; i < b; i++) x += "1";//关键位左边全放1
				for(int i = 1; i <= a; i++) x += "0";//关键位右边全放0
				for(int i = 1; i < b-1-(k-a); i++) y += "1";
				y += "0";//关键位
				for(int i = 1; i <= k-a; i++) y += "1";//用1去产生1
				for(int i = 1; i < a; i++) y += "0";//用零产生1
				y += "1";//最低为用1
			}
		}
		if(flag){
			puts("Yes");
			cout << x << "\n" << y;
		}
		else puts("No");
	}
}

int main()
{
	solve();
	return 0;
}