제출 #1129433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1129433		Mher777	Tiles (BOI24_tiles)	C++20	13 / 100	36 ms	3396 KiB

Main

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 200005;
pii a[N], b[N];
int n, m, kn;

bool same_line(pii p1, pii p2, pii p3) {
    return ((p1.ff == p2.ff && p2.ff == p3.ff) || (p1.ss == p2.ss && p2.ss == p3.ss));
}

void delete_unused() {
    pair<pii, int> mn = { {MAX,0},0 };
    for (int i = 1; i <= n; ++i) {
        mn = min(mn, { a[i],i });
    }
    int cur_ind = 1;
    for (int j = mn.ss; j <= n; ++j) {
        b[cur_ind] = a[j];
        ++cur_ind;
    }
    for (int j = 1; j < mn.ss; ++j) {
        b[cur_ind] = a[j];
        ++cur_ind;
    }
    ++kn;
    a[kn] = b[1];
    pii last = b[1];
    for (int i = 2; i < n; ++i) {
        if (same_line(last, b[i], b[i + 1])) continue;
        last = b[i];
        ++kn;
        a[kn] = last;
    }
    ++kn;
    a[kn] = b[n];
    n = kn;
}

void sub1() {
    int w = 0, h = 0;
    vi xs, ys;
    for (int i = 1; i <= n; ++i) {
        xs.pub(a[i].ff);
        ys.pub(a[i].ss);
    }
    sort(all(xs));
    sort(all(ys));
    w = ys.back() - ys[0];
    h = xs.back() - xs[0];
    if (w % 2) {
        cout << 0;
    }
    else {
        cout << (h % 2 ? xs.back() - 1 : xs.back());
    }
    exit(0);
}

void sub2() {
    set<int> xs;
    map<int, vi> mx;
    for (int i = 1; i <= n; ++i) {
        xs.insert(a[i].ff);
        mx[a[i].ff].pub(a[i].ss);
        sort(all(mx[a[i].ff]));
    }
    int w1 = 0, w2 = 0, h1 = 0, h2 = 0, wmid = 0;
    int x1 = *xs.begin();
    xs.erase(xs.begin());
    int x2 = *xs.begin();
    xs.erase(xs.begin());
    int x3 = *xs.begin();
    w1 = mx[x1][1] - mx[x1][0];
    w2 = mx[x3][1] - mx[x3][0];
    h1 = x2 - x1, h2 = x3 - x2;
    if (w1 > w2) {
        // case 1
        if (w1 % 2) {
            cout << 0;
        }
        else if (h1 % 2) {
            cout << x2 - 1;
        }
        else if (w2 % 2 == 1 || (w1 - w2) % 2 == 1) {
            cout << x2;
        }
        else if (h2 % 2) {
            cout << x3 - 1;
        }
        else {
            cout << x3;
        }
    }
    else {
        if (w1 % 2) {
            cout << 0;
        }
        else if (h1 % 2) {
            cout << x2 - 1;
        }
        else if (w2 % 2 == 1 || (w2 - w1) % 2 == 1) {
            cout << x2;
        }
        else if (h2 % 2) {
            cout << x3 - 1;
        }
        else {
            cout << x3;
        }
    }
    exit(0);
}

void slv() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].ff >> a[i].ss;
    }
    delete_unused();
    if (n <= 5) {
        sub1();
    }
    if (n == 6) {
        sub2();
    }
    for (int i = 2; i < n; i += 2) {
        int w = a[i].ss;
        int h = a[i + 1].ff - a[i].ff;
        if (w % 2) {
            cout << (i == 2 ? 0 : a[i].ff - 1);
            return;
        }
        if (h % 2) {
            cout << a[i + 1].ff - 1;
            return;
        }
    }
    cout << a[n - 1].ff;
}

/*
6 6
0 0
0 8
8 8
8 5
3 5
3 0
*/

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

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