제출 #1042588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042588		Theo830	Tiles (BOI24_tiles)	C++17	4 / 100	24 ms	4024 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,m;
    cin>>n>>m;
    ll maxx = 0,minx = m,maxy = 0,miny = m;
    f(i,0,n){
        ll x,y;
        cin>>x>>y;
        maxx = max(maxx,x);
        maxy = max(maxy,y);
        miny = min(miny,y);
        minx = min(minx,x);
    }
    ll dy = maxy - miny;
    ll dx = maxx - minx;
    if(dy % 2){
        cout<<0<<"\n";
    }
    else if(dx% 2 == 0){
        cout<<m<<"\n";
    }
    else{
        cout<<maxx - 1<<"\n";
    }
}

• 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