关闭

BZOJ3023【中位数】

251人阅读 评论(0) 收藏 举报
分类:
/* I will wait for you */
  
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <string>
#define make make_pair
#define fi first
#define se second
  
using namespace std;
  
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef map<int, int> mii;
  
const int maxn = 100010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double error = 1e-9;
  
inline ll read()
{
    ll x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9')
          f = (ch == '-' ? -1 : 1), ch = getchar();
    while (ch >= '0' && ch <= '9')
          x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
 
ll n, m, ans, T, x[maxn], y[maxn], sx[maxn], sy[maxn];
 
void solve()
{
    if (T % n == 0) {
        for (int i = 1; i <= n; i++)
            sx[i] = sx[i - 1] + x[i];
        sort(sx + 1, sx + n + 1);
        ll _x = sx[(n + 1) / 2];
        for (int i = 1; i <= n; i++)
            ans += abs(_x - sx[i]);
    }
    if (T % m == 0) {
        for (int i = 1; i <= m; i++)
            sy[i] = sy[i - 1] + y[i];
        sort(sy + 1, sy + m + 1);
        ll _y = sy[(m + 1) / 2];
        for (int i = 1; i <= m; i++)
            ans += abs(_y - sy[i]);
    }
}
         
int main()
{
    n = read(), m = read(), T = read();
     
    for (int i = 1; i <= T; i++) {
        int _x = read(), _y = read();
        x[_x] += 1, y[_y] += 1;
    }
     
    for (int i = 1; i <= n; i++)
        x[i] -= T / n;
    for (int i = 1; i <= m; i++)
        y[i] -= T / m;
    solve();
     
    if (T % n == 0 && T % m == 0)
        printf("both ");
    if (T % n == 0 && T % m != 0)
        printf("row ");
    if (T % n != 0 && T % m == 0)
        printf("column ");
    if (T % n != 0 && T % m != 0)
        printf("impossible\n");
    if (T % n == 0 || T % m == 0)
        printf("%lld\n", ans);
     
    return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:46479次
    • 积分:1757
    • 等级:
    • 排名:千里之外
    • 原创:135篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条
    文章分类
    最新评论