제출 #1067373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1067373		slivajan	Tiles (BOI24_tiles)	C++17	4 / 100	91 ms	2132 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long un;
typedef vector<un> vuc;
typedef pair<un, un> pun;

#define REP(i, a, b) for (un i = (un)a; i < (un)b; i++)
#define REPR(i, a, b) for (un i = ((un)b)-1; i >= (un)a; i--)
#define FEAC(i, a) for (auto&& i : a)
#define vec vector
#define ALL(x) (x).begin(), (x).end()
#define DEB(x) cerr << #x << " = " << (x) << endl;

constexpr un INF = INT64_MAX;

int main(){
    un N, M;
    cin >> N >> M;

    un x_min, x_max, y_min, y_max;
    x_min = INF;
    y_min = INF;

    x_max = 0;
    y_max = 0;

    REP(i, 0, N){
        un x, y;
        cin >> x >> y;

        x_min = min(x_min, x);
        y_min = min(y_min, y);

        x_max = max(x_max, x);
        y_max = max(y_max, y);
    }

    un y_delta = y_max - y_min;
    un x_delta = x_max - x_min;

    if (y_delta % 2 == 1){
        cout << x_min << endl;
        return 0;
    }

    if (x_delta % 2 == 1){
        cout << x_max-1 << endl;
        return 0;
    }

    cout << x_max << endl;

}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 9
• Subtask 3: 0 / 11
• Subtask 4: 0 / 19
• Subtask 5: 0 / 22
• Subtask 6: 0 / 25
• Subtask 7: 0 / 10