# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168425 | juggernaut | Chessboard (IZhO18_chessboard) | C++14 | 661 ms | 4476 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 int long long int
#define fr first
#define sc second
using namespace std;
int n,k,i,j,x,y,res;
pair<int,int>p[100001];
bool a[1001][1001];
int get(int f,int q){
int cnt=0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
x=i/f;
y=j/f;
if(q){
if((x+y)%2==0){
if(a[i][j])cnt++;
}else{
if(!a[i][j])cnt++;
}
}else{
if((x+y)%2==0){
if(!a[i][j])cnt++;
}else{
if(a[i][j])cnt++;
}
}
}
return cnt;
}
int get(int f){
return min(get(f,0),get(f,1));
}
main(){
scanf("%lld%lld",&n,&k);
for(i=0;i<k;i++){
scanf("%lld%lld%lld%lld",&p[i].fr,&p[i].sc,&p[i].fr,&p[i].sc);
p[i].fr--;
p[i].sc--;
a[p[i].fr][p[i].sc]=1;
}
res=get(1);
for(j=2;j*j<=n;j++){
if(n%j==0){
res=min(res,get(j));
res=min(res,get(n/j));
}
}
printf("%lld",res);
}
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... |