oj.uz

Submission #334455

# Submission time Handle Problem Language Result Execution time Memory
334455 2020-12-09T07:35:01 Z amunduzbaev Chessboard (IZhO18_chessboard) C++14
39 / 100
 115 ms 1516 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e3+5;

int x[N][N], pref[N][N];
vector<pii>vv;
ll ans, n, k;

void check(ll size){
	ll rem1 = ((n/size) * (n/size) +1)/2 * size * size, er1 = 0;
	for(int i=0;i<sz(vv);i++){
		ll x = vv[i].ff / size, y = vv[i].ss / size;
		if((x + y) %2 == 0) rem1--;
		else er1++;
	}
	ans = min(ans, er1 + rem1);
	
	rem1 = ((n/size)* (n/size))/2 * size * size, er1 = 0;
	for(int i=0;i<sz(vv);i++){
		ll x = vv[i].ff / size, y = vv[i].ss / size;
		if((x + y) % 2) rem1--;
		else er1++;
	}
	ans = min(ans, er1 + rem1);
}

void solve(){
	fastios
	ans = inf;
	cin>>n>>k;
	for(int i=0;i<k;i++){
		int a, b, c, d;
		cin>>a>>b>>c>>d;
		vv.pb({--a, --b});
	}
	for(int i=1;i *1ll * i<=n;i++){
		if(n % i == 0){
			check(i);
			if(n/i!=i && i!=1) check(n/i);
		}
	}
	cout<<ans<<"\n";
	return;
}
/*

3 3
1 3 1 3
2 3 2 3
1 1 1 1

3 4
1 1 1 1
1 3 1 3
2 3 2 3
3 3 3 3

5 8
2 1 2 1
3 1 3 1
5 2 5 2
1 5 1 5
2 3 2 3
2 4 2 4
3 3 3 3
4 3 4 3

6 8
1 2 1 2
2 1 2 1
3 3 3 3
3 4 3 4
4 3 4 3
4 4 4 4
3 6 3 6
5 5 5 5

*/
int main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 12 ms 748 KB Output is correct
17 Correct 42 ms 1516 KB Output is correct
18 Correct 41 ms 1516 KB Output is correct
19 Correct 102 ms 1516 KB Output is correct
20 Correct 115 ms 1516 KB Output is correct
21 Correct 31 ms 1516 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 23 ms 1008 KB Output is correct
24 Correct 37 ms 1516 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 23 ms 1156 KB Output is correct
27 Correct 32 ms 1516 KB Output is correct
28 Correct 39 ms 1516 KB Output is correct
29 Correct 13 ms 1008 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 1008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Incorrect 25 ms 1008 KB Output isn't correct
10 Halted 0 ms 0 KB -