codeforces 838A Binary Blocks

最新推荐文章于 2019-09-07 10:22:51 发布

kicksilver7

最新推荐文章于 2019-09-07 10:22:51 发布

阅读量523

点赞数

分类专栏： ACM 文章标签： codeforces

本文链接：https://blog.csdn.net/silver_bone/article/details/76858072

版权

ACM 专栏收录该内容

143 篇文章 0 订阅

订阅专栏

题目链接：

http://codeforces.com/problemset/problem/838/A

题意：

给你一个N*M的只含有0和1的矩阵，让你将这个方阵分成K＊K的小矩阵。如果没法分，那么就在它的最右边以及最下边进行补充，需要注意的是这里补充的一行或一列均为0，问你，将每一个小矩阵全部变成0或1的最小变换的次数是多少。（这里的切换是指：将0变成1或将1变成0）。

题解：

先用前缀和处理，然后直接暴力就行了，这里的暴力的时，我们可以只暴力K为质数的情况。

代码：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
const int maxn = 2500+10;
char s[maxn][maxn];
int num[maxn][maxn];
int prime[367]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477};
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
        scanf("%s",s[i]);
    met(num,0);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            s[i-1][j-1]-='0';
            if(i==1&&j==1)
                num[i][j]=s[i-1][j-1];
            else
                num[i][j]=s[i-1][j-1]+num[i-1][j]+num[i][j-1]-num[i-1][j-1];
        }
    int MIN=inf;
    for(int i=0;i<367;i++)
    {
        int k=prime[i];
        int temp=0;
        if(k>n&&k>m)
            break;
        for(int x1=1;x1<=n;x1+=k)
        {
            for(int y1=1;y1<=m;y1+=k)
            {
                int x2=x1+k-1;
                int y2=y1+k-1;
                if(x2>n)
                    x2=n;
                if(y2>m)
                    y2=m;
                int ans=num[x2][y2]+num[x1-1][y1-1]-num[x2][y1-1]-num[x1-1][y2];
                ans=max(ans,0);
                temp+=min(ans,k*k-ans);
            }
        }
        MIN=min(MIN,temp);
    }
    printf("%d\n",MIN);
}