【题解】CH0502 排序

题目链接
二维环形石子合并

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const int N=1e5+10;
int n,m,t;
int r[N],c[N];
ll sr[N],sc[N];
ll ansr=0,ansc=0;
int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d%d%d",&n,&m,&t);
    int cnt=0,x,y;
    _rep(i,1,t)scanf("%d%d",&x,&y),cnt++,r[x]++,c[y]++;
    if(cnt%n!=0&&cnt%m!=0)
    {
        puts("impossible");
        return 0;
    }
    if(cnt%n==0)
    {
        _rep(i,1,n)r[i]-=cnt/n,sr[i]=sr[i-1]+r[i];
        sort(sr+1,sr+n+1);
        if(n&1)_rep(i,1,n)ansr+=abs(sr[i]-sr[(n+1)/2]);
        else _rep(i,1,n)ansr+=abs(sr[i]-sr[n/2]);
    }
    if(cnt%m==0)
    {
        _rep(i,1,m)c[i]-=cnt/m,sc[i]=sc[i-1]+c[i];
        sort(sc+1,sc+m+1);
        if(m&1)_rep(i,1,m)ansc+=abs(sc[i]-sc[(m+1)/2]);
        else _rep(i,1,m)ansc+=abs(sc[i]-sc[m/2]);
    }
    if(ansr>0&&ansc>0)printf("both %lld\n",ansr+ansc);
    else if(ansr>0)printf("row %lld\n",ansr);
    else printf("column %lld\n",ansc);
    return 0;
}