제출 #926206

#제출 시각아이디문제언어결과실행 시간메모리
926206AlphaMale06Chessboard (IZhO18_chessboard)C++17
70 / 100
158 ms5736 KiB
#include <bits/stdc++.h> using namespace std; #define F first #define S second #define int long long struct rect{ int x1, y1, x2, y2; }; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; rect a[k]; for(int i=0; i< k; i++){ cin >> a[i].x1 >> a[i].y1 >> a[i].x2 >> a[i].y2; a[i].x1--; a[i].x2--; a[i].y1--; a[i].y2--; } int ans=1e12; for(int d=1; d<n; d++){ if(n%d!=0)continue; int flip=d*d*(((n*n)/(d*d)+1)/2); for(int i=0; i< k; i++){ if(((a[i].x1/d)&1)==((a[i].y1/d)&1)){ flip--; } else{ flip++; } } ans=min({ans, flip, n*n-flip}); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...