AC日记——Dynamic Problem Scoring codeforces 807d

Dynamic Problem Scoring

思路：

　　水题；

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define maxn 130

int n,ai[maxn][],ac[],cnt,all,last1,last2;

double map[][];

inline void in(int &now)
{
    int if_z=;now=;
    char Cget=getchar();
    while(Cget>''||Cget<'')
    {
        if(Cget=='-') if_z=-;
        Cget=getchar();
    }
    while(Cget>=''&&Cget<='')
    {
        now=now*+Cget-'';
        Cget=getchar();
    }
    now*=if_z;
}

int point(int a,int s,int t)
{
    if(t==-) return ;
    int res=;
    double p=(double)a/(double)s;
    if(p>0.5&&p<=) res+=-*t;
    else if(p>0.25&&p<=0.5) res+=-*t;
    else if(p>0.125&&p<=0.25) res+=-t*;
    else if(p>0.0625&&p<=0.125) res+=-t*;
    else if(p>0.03125&&p<=0.0625) res+=-t*;
    else if(p>&&p<=0.03125) res+=-t*;
    return res;
}

int main()
{
    in(n);
    for(int i=;i<=n;i++)
    {
        for(int j=;j<=;j++)
        {
            in(ai[i][j]);
            if(ai[i][j]!=-) ac[j]++;
        }
    }
    for(int i=;i<=;i++)
    {
        last1+=point(ac[i],n,ai[][i]);
        last2+=point(ac[i],n,ai[][i]);
    }
    cnt=n;
    if(last1>last2)
    {
        printf("");
        return ;
    }
    for(int j=;j<=;j++)
    {
        cnt++;
        int sco1=,sco2=;
        bool if_[];
        for(int i=;i<=;i++)
        {
            if(ai[][i]==-&&ai[][i]==-) continue;
            int k1=point(ac[i]+,cnt,ai[][i]);
            int k2=point(ac[i],cnt,ai[][i]);
            int g1=point(ac[i]+,cnt,ai[][i]);
            int g2=point(ac[i],cnt,ai[][i]);
            if(ai[][i]==-)
            {
                sco2+=g2;
                continue;
            }
            if(ai[][i]==-)
            {
                sco1+=k2;
                continue;
            }
            if(ai[][i]<ai[][i])
            {
                sco1+=k2;
                sco2+=g2;
            }
            else
            {
                ac[i]++;
                sco1+=k1;
                sco2+=g1;
            }
        }
        last1=sco1,last2=sco2;
        if(last1>last2)
        {
            cout<<cnt-n;
            return ;
        }
    }
    cout<<-;
    return ;
}