Codeforces Round#472

CF957A Tritonic Iridescence（瞎搞）

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,cnt=0;
char s[N];
int main(){
//  freopen("a.in","r",stdin);
    n=read();scanf("%s",s+1);
    for(int i=1;i<n;++i)
        if(s[i]!='?'&&s[i]==s[i+1]){puts("No");return 0;}
    for(int i=1;i<n;++i)
        if(s[i]=='?'&&s[i]==s[i+1]){puts("Yes");return 0;}
    if(s[1]=='?'||s[n]=='?'){puts("Yes");return 0;}
    for(int i=2;i<n;++i)
        if(s[i]=='?'&&s[i-1]==s[i+1]){puts("Yes");return 0;}
    puts("No");return 0;
}

CF924A Mystical Mosaic（瞎搞）

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,id[N];
char s[N][N];
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=n;++i){
        scanf("%s",s[i]+1);
        for(int j=1;j<=m;++j){
            if(s[i][j]=='#'){
                if(id[j]){
                    for(int k=1;k<=m;++k)
                        if(s[id[j]][k]!=s[i][k]){puts("No");return 0;}
                    break;
                }id[j]=i;
            }
        }
    }puts("Yes");return 0;
}

CF924B Three-level Laser（贪心）

long double wa了一发是什么鬼？？？

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,U,a[N];
double ans=0;
int main(){
//  freopen("a.in","r",stdin);
    n=read();U=read();
    for(int i=1;i<=n;++i) a[i]=read();
    int now=1;
    for(int i=1;i<=n;++i){
        while(now<=n&&a[now]-a[i]<=U) ++now;--now;
        if(now-i<=1) continue;
        ans=max(ans,(a[now]-a[i+1])*1.0/(a[now]-a[i]));
    }if(ans==0) puts("-1");
    else printf("%.10lf\n",ans);
    return 0;
}

CF924C Riverside Curio（贪心）

设ti为第i天的总的线段数，则$t_i=m_i+1+d_i$，那么答案就是
$\sum\limits_{i=1}^nt_i-m_i-1$，因此我们就是要最小化t的和。

我们需要满足一些t的限制：$t_i>=max\{t_{i-1},m_i+1\}$

我考试时大概是傻掉了，想不清怎么处理这个问题，最后写了类似单调队列+等差数列的东西。

其实，你倒着做一遍，求出每个$t_i$为了满足$m_i+1$的最小值，然后再正着做一遍，满足条件1即可。

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define pa pair<int,int>
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,a[N],mx=1,h=1,t=0;
ll ans=0,sum=0,s[N];
pa q[N];
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) a[i]=read(),sum+=a[i];
    for(int i=1;i<=n;++i){
        if(a[i]+1<=q[t].first) continue;
        while(h<=t&&a[i]+1-q[t].first>i-q[t].second) --t; 
        q[++t].first=a[i]+1,q[t].second=i;
    }for(int i=2;i<=t;++i){
        ans+=(ll)q[i-1].first*(q[i].second-q[i-1].second)+(ll)(1+q[i].first-q[i-1].first)*(q[i].first-q[i-1].first)/2;
    }ans+=(ll)q[t].first*(n-q[t].second)+1;
    printf("%I64d\n",ans-sum-n);
    return 0;
}

CF924D Contact ATC（数学+BIT求逆序对）

题解传送门：portal

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <utility>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline ll read(){
    ll x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
inline int gcd(int x,int y){return y?gcd(y,x%y):x;}
int n,W,m,c[N];ll ans=0;
struct frac{
    int a,b;
    frac(int _a,int _b){int g=gcd(_a,_b);a=_a/g;b=_b/g;}
    frac(){}
    friend bool operator<(frac a,frac b){
        return (ll)a.a*b.b<(ll)b.a*a.b;
    }friend bool operator==(frac a,frac b){
        return a.a==b.a&&a.b==b.b;
    }
}aa[N];
struct hhh{
    frac x,y;int pos;
    friend bool operator<(hhh a,hhh b){
        return a.x==b.x?a.pos>b.pos:a.x<b.x;
    }
}a[N];
inline void add(int x,int val){for(;x<=m;x+=x&-x) c[x]+=val;}
inline int ask(int x){int res=0;for(;x;x-=x&-x) res+=c[x];return res;}
int main(){
//  freopen("a.in","r",stdin);
    n=read();W=read();
    for(int i=1;i<=n;++i){
        int x=read(),v=read();
        a[i].x=frac(abs(x),abs(v+W));a[i].y=frac(abs(x),abs(v-W));aa[i]=a[i].y;
    }sort(aa+1,aa+n+1);m=unique(aa+1,aa+n+1)-aa-1;
    for(int i=1;i<=n;++i) a[i].pos=lower_bound(aa+1,aa+m+1,a[i].y)-aa;
    sort(a+1,a+n+1);
    for(int i=1;i<=n;++i){
        ans+=ask(m-a[i].pos+1);add(m-a[i].pos+1,1);
    }printf("%I64d\n",ans);
    return 0;
}