Codeforces Round #587 (Div. 3) ABCD

题目传送门（contest1216）

---

Problem A

变成每两个一a一b

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define for1(i,a,b) for (int i=a;i<=b;i++)
#define for0(i,a,b) for (int i=a;i<b;i++)
#define debug(x) printf("---- %s ----\n",#x)

const int N = 2e5+5;
char s[N];

int main()
{
    int n;
    scanf("%d",&n);
    scanf("%s",s+1);
    int ans = 0;
    for (int i=1;i<=n;i+=2){
        if (s[i]==s[i+1]){
            ans++;
            s[i+1] = s[i]=='a'?'b':'a';
        }
    }
    printf("%d\n",ans);
    printf("%s",s+1);
    return 0;
}

---

Problem B

排个序

#include<bits/stdc++.h>
     
using namespace std;
     
#define ll long long
#define for0(i,a,b) for (int i=a;i<b;i++)
#define for1(i,a,b) for (int i=a;i<=b;i++)
#define fi first
#define se second
#define pb push_back
#define debug(x) printf("---- %s ----\n",#x)
     
const int N = 1e3+5;
     
struct node
{
    int val,id;
    bool operator < (const node& a)const{
        return val > a.val;
    }
}a[N];
    
int main()
{
    int n;
    scanf("%d",&n);
    ll ans = 0;
    for1(i,1,n) scanf("%d",&a[i].val),a[i].id = i;
    sort(a+1,a+1+n);
    for1(i,1,n){
        ans += 1LL*(i-1)*a[i].val + 1;
    }
    printf("%I64d\n",ans);
    bool flag = true;
    for1(i,1,n){
        if (flag) flag = false;
        else printf(" ");
        printf("%d",a[i].id);
    }
    puts("");
    return 0;
}

---

Problem C

点很少，离散化一下，而后搞个二维数组标记黑色区间，can[i][j]表示的是左下角为[i,j]，右上角为[i+1,j+1]的这一个格子是否被覆盖过。反正区间问题就注意覆盖的是区间把。

#include<bits/stdc++.h>
#include<unordered_map>
     
using namespace std;
     
#define ll long long
#define for0(i,a,b) for (int i=a;i<b;i++)
#define for1(i,a,b) for (int i=a;i<=b;i++)
#define fi first
#define se second
#define pb push_back
#define debug(x) printf("---- %s ----\n",#x)
     
const int N = 1e5+5;
     
unordered_map<int,int>mp;
int a[20];
     
bool can[30][30];
     
int main()
{
    int x1,y1,x2,y2;
    int x3,y3,x4,y4;
    int x5,y5,x6,y6;
     
    scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
    a[0] = x1,a[1] = y1,a[2] = x2,a[3] = y2;
    scanf("%d %d %d %d",&x3,&y3,&x4,&y4);
    a[4] = x3,a[5] = y3,a[6] = x4,a[7] = y4;
    scanf("%d %d %d %d",&x5,&y5,&x6,&y6);
    a[8] = x5,a[9] = y5,a[10] = x6,a[11] = y6;
     
    sort(a,a+12);
    int cnt = unique(a,a+12) - a;
    for0(i,0,cnt) mp[a[i]] = i+1;//,printf("mp[%d] = %d\n",a[i],mp[a[i]]);
     
    memset(can,true,sizeof can);
     
    for1(i,mp[x3]+1,mp[x4])
        for1(j,mp[y3]+1,mp[y4])
            can[i][j] = false;//,printf("[%d,%d] x\n",i,j);
    for1(i,mp[x5]+1,mp[x6])
        for1(j,mp[y5]+1,mp[y6])
            can[i][j] = false;//,printf("[%d,%d] x\n",i,j);
    bool flag = false;
     
    for1(i,mp[x1]+1,mp[x2])
        for1(j,mp[y1]+1,mp[y2]){
            //printf("[%d,%d] check\n",i,j);
            if (can[i][j]) flag = true;
        }
     
    printf("%s\n",flag?"YES":"NO");
    return 0;
}

---

Problem D

比赛的时候求一下所有数和最大数的差距，求这几个数的gcd，然后求和 ：差距/gcd

反正是蒙的，你说有这么个结论就有吧。

#include<bits/stdc++.h>
     
using namespace std;
     
#define ll long long
#define for0(i,a,b) for (int i=a;i<b;i++)
#define for1(i,a,b) for (int i=a;i<=b;i++)
#define fi first
#define se second
#define pb push_back
#define debug(x) printf("---- %s ----\n",#x)
     
const int N = 2e5+5;
     
int a[N],b[N];
     
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
     
int main()
{
    int n;
    int maxx = -1;
    scanf("%d",&n);
    for1(i,1,n) scanf("%d",a+i),maxx = max(maxx,a[i]);
    for1(i,1,n) b[i] = maxx-a[i];
     
    int GCD = gcd(b[1],b[2]);
     
    for1(i,3,n) GCD = gcd(GCD,b[i]);
     
    ll ans = 0;
     
    for1(i,1,n){
        ans += 1LL*b[i]/GCD;
    }
     
    printf("%I64d %d\n",ans,GCD);
     
    return 0;
}

---

Problem E

还没补。应该会补的。