2021暑假集训-个人赛10

---

A.Array Rearrangment

传送门
题目大意：输入n,m,两个序列长度都为n，存在某一种排序，使得两个序列都满足ai+bi<=m
思路：两个都进行sort排序，一个最大的加另一个最小的，跑一遍，有一个>m就输出No

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=1010;
using namespace std;
int t,n,m;
int a[Max],b[Max];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    scanf("%d",&t);
    while(t--)
    {   mem(a,0);
        mem(b,0);
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)
            cin>>a[i];
        sort(a,a+n);
        for(int i=0;i<n;i++)
            cin>>b[i];
        sort(b,b+n);
        int w=0;
        for(int i=0;i<n;i++)
            if(a[i]+b[n-i-1]>m)
            {
                w=1;break;
            }
            if(w==1)
                printf("No\n");
            else printf("Yes\n");
    }
    return 0;
}

B.Blocks

传送门
题目大意：进行某种操作，目的是将黑白块变为其中一种颜色，变化会相邻的两个变为相反的颜色块，输出每次变化的前一个色块的位置
思路：分别进行两种全变，全变为白色最后一个也会变为白色，同理，黑色也一样，进行两次全变就好

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=10000;
using namespace std;
int t,n,m;
char a[210];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    cin>>n;
    cin>>a;
    char b[Max];
    strcpy(b,a);
    vector<int > v,v1;
    全变为白色
    int l=strlen(a),i;
    for(i=0;i<l-1;i++)
    {
        if(a[i]=='B')
        {
            a[i]='W';
            if(a[i+1]=='B')
                a[i+1]='W';
            else a[i+1]='B';
            v.push_back(i+1);
        }
    }
    if(a[l-1]=='W')
    {
        printf("%d\n",v.size());
        for( i=0;i<v.size();i++)
            printf("%d ",v[i]);
        cout<<endl;
        return 0;
    }
    //全变为黑色
    for(i=0;i<l-1;i++)
    {
        if(b[i]=='W')
        {
            b[i]='B';
            if(b[i+1]=='W')
                b[i+1]='B';
        else b[i+1]='W';
            v1.push_back(i+1);
        }
    }
    if(b[l-1]=='B')
    {
        printf("%d\n",v1.size());
        for( i=0;i<v1.size();i++)
            printf("%d ",v1[i]);
        cout<<endl;
        return 0;
    }
    else printf("-1");
    return 0;
}

C.Light It Up *

传送门

D.Cow and Friend *

传送门

E.Friends and Gifts*

传送门

F.加分二叉树 *

传送门