結果

問題 No.2696 Sign Creation
ユーザー fastmath
提出日時 2024-03-22 22:17:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 125 ms / 2,500 ms
コード長 5,030 bytes
コンパイル時間 1,750 ms
コンパイル使用メモリ 143,536 KB
最終ジャッジ日時 2025-02-20 11:49:42
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())
#define sz(a) ((int)a.size())

#ifdef LOCAL
#define debug(...) [](auto...a){ ((cerr << a << ' '), ...) << endl; }(#__VA_ARGS__, ":", __VA_ARGS__)
#else
#define debug(...)
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
tcT> vector <T> presum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    FOR (i, a.size()) {
        p[i + 1] = p[i] + a[i];
    }   
    return p;
}
tcT> vector <T> sufsum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        p[i] = p[i + 1] + a[i];
    }
    return p;
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int h, w, n, d;
    cin >> h >> w >> n >> d;

    V <vi> a(h, vi(w));
    FOR(i,n) {
        int x, y; cin >> x >> y;
        x--; y--;
        a[x][y]=1;
    }

    V <vi> used(h,vi(w)), comp(h,vi(w));
    function <void(int,int, int )> dfs = [&] (int x, int y, int c) {
        used[x][y]=1;
        comp[x][y]=c;
        for (int dx = -d; dx <= d; ++dx) {
            for (int dy = -d; dy <= d; ++dy) {
                int nx = x + dx, ny = y + dy;


                if (0 <= nx && nx < h && 0 <= ny && ny < w && a[nx][ny]&&abs(dx)+abs(dy)<=d) {
                    if (!used[nx][ny]) {
                        dfs(nx,ny,c);
                    }
                }
            }
        }
    };

    int ptr = 1;
    FOR(i,h){
        FOR(j,w){
            if (a[i][j] && !used[i][j]) {
                dfs(i,j,ptr);ptr++;
            }
        }
    }

    vi s(ptr);
    FOR (i, h) {
        FOR(j, w) {
            s[comp[i][j]]++;
        }
    }
    int cons = 0;
    for (int c = 1; c < ptr; ++c) {
        cons += s[c]>1;
    }


    int mn = 1e18, mx = -1e18;
    FOR (x, h) {
        FOR (y, w) {
            if (!used[x][y]) {

                set <int> adj;
                for (int dx = -d; dx <= d; ++dx) {
                    for (int dy = -d; dy <= d; ++dy) {
                        int nx = x + dx, ny = y + dy;
                        if (0 <= nx && nx < h && 0 <= ny && ny < w && a[nx][ny]&&abs(dx)+abs(dy)<=d) {
                            adj.insert(comp[nx][ny]);
                        }
                    }
                }    
                if (adj.empty()) {
                    ckmin(mn,cons);ckmax(mx,cons);
                }            
                else {
                    int nc = cons;
                    each (c, adj) {
                        if (s[c]>1) {
                            nc--;
                        }
                    }
                    nc++;
                    ckmin(mn,nc);ckmax(mx,nc);
                }

            }
        }
    }
    cout<<mn<<' ' << mx<<endl;
}
0