<BZOJ3032>七夕祭

水

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,t;
long long ans=;
int x[],y[],sumx[],sumy[];

int main()
{
    int i,xx,yy,arge;
    memset(x,,sizeof(x));
    memset(y,,sizeof(y));
    scanf("%d%d%d",&n,&m,&t);
    for(i=;i<=t;i++)scanf("%d%d",&xx,&yy),x[xx]++,y[yy]++;

    if(t%n==)
    {
        arge=t/n;
        sumx[]=;
        for(i=;i<=n;i++)sumx[i]=sumx[i-]+x[i]-arge;
        sort(sumx+,sumx+n+);
        arge=sumx[(n+)/];
        for(i=;i<=n;i++)ans+=abs(arge-sumx[i]);
    }
    if(t%m==)
    {
        arge=t/m;
        sumy[]=;
        for(i=;i<=m;i++)sumy[i]=sumy[i-]+y[i]-arge;
        sort(sumy+,sumy+m+);
        arge=sumy[(m+)/];
        for(i=;i<=m;i++)ans+=abs(arge-sumy[i]);
    }
    if((t%n==) && (t%m==)) printf("both %lld\n",ans);else
    {
        if(t%n==) printf("row %lld\n",ans);else
        {
        if(t%m==) printf("column %lld\n",ans);else {printf("impossible\n");return ;}
        }
    }
return ;
}

丑陋のcode