제출 #1312806

#제출 시각아이디문제언어결과실행 시간메모리
1312806arman.khachatryanChessboard (IZhO18_chessboard)C++20
8 / 100
166 ms327680 KiB
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9+10;
int main() {
    int n, k;
    while(cin>>n>>k){
        int dp[n+2][n+2]={0}, x1, x2, y1, y2;
        while(k--){
            cin>>x1>>y1>>x2>>y2;
            for(int i=0; i<=x2-x1; i++){
                dp[x1+i][y1]++;
                dp[x1+i][y2+1]--;
            }
        }
        vector<int> v;
        for(int i=1; i<=sqrtl(n); i++){
            if(n%i==0){
                v.push_back(i);
                if(n!=i*i && i!=1){
                    v.push_back(n/i);
                }
                
            }
        }
        int ans=INF;
        for(auto& i : v){
            ans=min(ans, n*(n-i)/2+((n/i)/2)*i*i);
        }
        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...