結果

問題 No.2696 Sign Creation
ユーザー 👑 binap
提出日時 2024-03-22 22:18:05
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,725 bytes
コンパイル時間 4,699 ms
コンパイル使用メモリ 259,504 KB
最終ジャッジ日時 2025-02-20 11:50:45
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31 WA * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;
ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return 
    os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); 
    return os;}
template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}
int main(){
    int h, w, n, d;
    cin >> h >> w >> n >> d;
    vector<vector<int>> a(h, vector<int>(w));
    rep(i, n){
        int y, x;
        cin >> y >> x;
        y--; x--;
        a[y][x] = i;
    }
    dsu uf(n);
    rep(fy, h){
        rep(fx, w){
            if(!a[fy][fx]) continue;
            int from = a[fy][fx];
            for(int dy = -d; dy <= d; dy++) for(int dx = -(d - abs(dy)); dx <= d - abs(dy); dx++){
                int ty = fy + dy;
                int tx = fx + dx;
                if(ty >= 0 and ty < h and tx >= 0 and tx < w){
                    if(!a[ty][tx]) continue;
                    int to = a[ty][tx];
                    uf.merge(from, to);
                }
            }
        }
    }
    auto f = uf.groups();
    int m = f.size();
    vector<int> belong(n);
    int base = 0;
    rep(i, m){
        auto& v = f[i];
        for(int from : v) belong[from] = i;
        if(v.size() >= 2) base++;
    }
    int MIN = 1001001001;
    int MAX = 0;
    rep(fy, h){
        rep(fx, w){
            if(a[fy][fx]) continue;
            int tmp = base;
            set<int> se;
            for(int dy = -d; dy <= d; dy++) for(int dx = -(d - abs(dy)); dx <= d - abs(dy); dx++){
                int ty = fy + dy;
                int tx = fx + dx;
                if(ty >= 0 and ty < h and tx >= 0 and tx < w){
                    if(!a[ty][tx]) continue;
                    int to = a[ty][tx];
                    se.insert(belong[to]);
                }
            }
            bool is_constellation = false;
            for(int i : se){
                if(!is_constellation){
                    is_constellation = true;
                    tmp++;
                }
                if(f[i].size() >= 2){
                    tmp--;
                }
            }
            chmax(MAX, tmp);
            chmin(MIN, tmp);
        }
    }
    cout << MIN << ' ' << MAX << "\n";
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0