| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312806 | arman.khachatryan | Chessboard (IZhO18_chessboard) | C++20 | 166 ms | 327680 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 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... | ||||
