-
Notifications
You must be signed in to change notification settings - Fork 10
/
MNERED.cpp
56 lines (44 loc) 路 1.16 KB
/
MNERED.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
#define ep emplace_back
#define EL printf("\n")
#define sz(A) (int) A.size()
#define FOR(i,l,r) for (int i=l;i<=r;i++)
#define FOD(i,r,l) for (int i=r;i>=l;i--)
#define fillchar(a,x) memset(a, x, sizeof (a))
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 500;
int n, m, a[N][N], f[N][N], res = N*N;
int main() {
// freopen("INP.TXT", "r", stdin);
// freopen("OUT.TXT", "w", stdout);
scanf("%d%d",&n,&m);
for (int i=1,u,v; i<=m; i++) {
scanf("%d%d", &u,&v);
a[u][v] = 1;
}
for (int j=1; j<=n; j++)
for (int i=1; i<=n; i++)
f[i][j] = f[i-1][j] + a[i][j];
for (int i=1; i<=n; i++)
for (int l=1; l<=n; l++) {
for (int r=l; r<=n; r++) {
int ngang = r-l+1;
int doc = m/ngang;
if (m%ngang != 0 or doc <= 0 or i+doc-1 > n) continue;
int sum = 0;
for (int k=l; k<=r; k++)
sum += f[i+doc-1][k] - f[i-1][k];
res = min(res, m-sum);
}
}
printf("%d", res);
return 0;
}