# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81005 | ToadDaveski | Chessboard (IZhO18_chessboard) | C++14 | 498 ms | 2304 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define fr first
#define sc second
using namespace std;
pair <ll,ll> a[100001];
int main()
{
ll n,m,i,j;
cin>>n>>m;
for(i=1;i<=m;i++)
{
ll x,y;
cin>>x>>x>>x>>y;
a[i]={x,y};
}
ll ans=1e10;
for(i=1;i<=sqrt(n);i++)
{
if (n%i==0)
{
ll raz=i;ll izm=0;
ll kolb=(((n*n)/(i*i)))/2*i*i;
ll kolw=((((n*n)/(i*i)))/2+(((n*n)/(i*i))%2))*i*i;
for(ll j=1;j<=m;j++)
{
ll x=(a[j].fr/i)+(a[j].fr%i>0),y=(a[j].sc/i)+(a[j].sc%i>0);
if ((x+y)%2==1)
izm++;
}
ans=min(ans,min(izm+(kolw-(m-izm)),(m-izm)+(kolb-izm)));
//cout<<ans<<" "<<i<<" "<<izm<<" "<<kolb<<" "<<kolw<<endl;
if (i==1) continue;
raz=i;
i=n/i;
izm=0;
kolb=(((n*n)/(i*i)))/2*i*i;
kolw=((((n*n)/(i*i)))/2+(((n*n)/(i*i))%2))*i*i;
for(ll j=1;j<=m;j++)
{
ll x=a[j].fr/i+(a[j].fr%i>0),y=(a[j].sc/i)+(a[j].sc%i>0);
if ((x+y)%2==1)
izm++;
}
ans=min(ans,min(izm+(kolw-(m-izm)),(m-izm)+(kolb-izm)));
//cout<<ans<<" "<<i<<" "<<izm<<endl;
i=raz;
}
}
cout<<ans;
return 0;
}
/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |