제출 #44029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
44029		Nordway	Chessboard (IZhO18_chessboard)	C++14	0 / 100	148 ms	2964 KiB

chessboard

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <climits>
#include <string.h>
#include <stdio.h>
#include <assert.h>

#define pb push_back
#define mp make_pair
#define low_b lower_bound
#define up_b upper_bound
#define all(v) v.begin(), v.end()

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;

const int N = 1e+5 + 5;

int x1[N], y[N], x2[N], y2[N];
ll ans = LLONG_MAX;

void Subtask1(int n, int i){
    ll d = n / i;
    ans = min(ans, (d % 2 == 0) ? (d / 2) * d : (d / 2 + 1) * (d / 2) * 2);
}

int main(){
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= k; i++){
        cin >> x1[i] >> y[i] >> x2[i] >> y2[i];
    }

    for(int i = 1; i < n; i++){
        if(n % i == 0){
            if(k == 0){
                Subtask1(n, i);
            }
        }
    }
    cout << ans;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 15
• Subtask 4: 0 / 16
• Subtask 5: 0 / 23
• Subtask 6: 0 / 30