Codefroces Round #779(div2)A~C

A. Marin and Photoshoot

题意: 看样例就可以发现就是要在 $0$ 后面插两个 $1$

#include<bits/stdc++.h>
#define x first
#define y seoncd
#define int long long 
#define gg exit(0);
#define sf1(x) scanf("%lld",&x)
#define sf2(x,y) scanf("%lld%lld",&x,&y)
#define pr1(x) printf("%lld\n", x)
#define pr2(x, y) printf("%lld%lld\n", x, y)
#define debug printf("debug\n");
const int N = 1e5 + 10;
using namespace std;
typedef pair<int, int>PII;
int t;
int n, m;
char s[N];
void solve()
{
	sf1(n);
	scanf("%s", s + 1);
	int   res = 0;
	for(int i = 1; i <= n; i ++ )
		{
			if(s[i] == '0')
			{
				if(i + 1 <= n && s[i + 1] != '1') //后面无1 插两个
				    res += 2;
				else if(i + 1 <= n)
				    if(i + 2 <= n && s[i + 2] != '1')  //后面的后面有一个1 只插1个
				    res += 1;
			}
		}
		cout << res << '\n';
}
signed main()
{
	//t = 1;
	sf1(t);
	while(t -- )
	solve();
}

B. Marin and Anti-coprime Permutation

分析: 就是要让整个序列的最大公约数大于 $1$, 则将每个数变成偶数即可, 将奇数与偶数配对, 偶数与奇数配对, 如果总共有奇数个数, 则一定无解, 则否 用奇数的排列和偶数的排列相乘就是答案

#include<bits/stdc++.h>
#define x first
#define y seoncd
#define int long long 
#define gg exit(0);
#define sf1(x) scanf("%lld",&x)
#define sf2(x,y) scanf("%lld%lld",&x,&y)
#define pr1(x) printf("%lld\n", x)
#define pr2(x, y) printf("%lld%lld\n", x, y)
#define debug printf("debug\n");
const int N = 1e5 + 10, mod =998244353;
using namespace std;
typedef pair<int, int>PII;
int t;
int n, m;
int a[N];
void solve()
{
	int n;
	cin >> n;
	if(n % 2 == 1) cout << 0 << '\n';
	else 
	{
		int sum = 1;
		for(int i = 1; i <= n / 2; i ++ )  //奇数的排列
				sum = sum * i % mod;
		sum = sum * sum % mod;  //偶数的排列
		cout << sum << '\n';
	}
}
signed main()
{
	//t = 1;
	sf1(t);
	while(t -- )
	solve();
}

C. Shinju and the Lost Permutation

题意: 存在某个排列 $p$, 每次向右移动一次, 然后用数组 $b$, 记录前缀的最大值, $b_1=p_1,b_2=max(p_1,p_2)...b_n=max(p_1,p_2...p_n)$, 而数组 $c$ 记录的是数组b中的不同元素的数量, $c_1$ 是还未移动的前缀最大值的不同元素的数量

分析: 数组中一定出现过一次 $1$, 否则不合法, 并且每次移动,元素的数量可能增加1, 也可能减少若干, 但一定不能增加大于 $1$,因为每次只能向右移动一位,所以最多只能增加 $1$

#include<bits/stdc++.h>
#define x first
#define y seoncd
#define int long long 
#define gg exit(0);
#define sf1(x) scanf("%lld",&x)
#define sf2(x,y) scanf("%lld%lld",&x,&y)
#define pr1(x) printf("%lld\n", x)
#define pr2(x, y) printf("%lld%lld\n", x, y)
#define debug printf("debug\n");
const int N = 1e5 + 10;
using namespace std;
typedef pair<int, int>PII;
int t;
int n, m;
int a[N];
void solve()
{
	cin >> n;
	int   flag = 0;
	for(int i = 0; i < n; i ++ )
	{
	cin >> a[i];
    if(a[i] == 1) flag ++;
	}
	if(flag != 1) cout << "NO\n";
	else 
	{
	    int loc = find(a, a + n, 1) - a;  //找到1的位置
	    int last = 1; //1所在位置的初始值
	    for(int i = 1; i < n; i ++ ) 
	    {
	         int st = (loc + i) % n;  //每次移动后1所在的位置
	        if(a[st] - last > 1)  //变化的值不能超过1 
	        {
	        cout << "NO\n"; 
	        return;
	        
	        }
	        last = a[st]; //保存上一次1所在位置的值
	    }
	    cout << "YES\n";
	}

}
signed main()
{
	//t = 1;
	cin >> t;
	while(t -- )
	solve();
}