#964114 (C++17) No.2696 Sign Creation

提出ソース

結果

問題	No.2696 Sign Creation
ユーザー	dyktr_06
提出日時	2024-03-22 22:27:07
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	115 ms / 2,500 ms
コード長	6,474 bytes
コンパイル時間	2,428 ms
コンパイル使用メモリ	219,208 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2024-03-27 17:58:22
合計ジャッジ時間	4,067 ms
ジャッジサーバーID （参考情報）	judge11 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	1 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	2 ms 6,676 KB
testcase_05	AC	2 ms 6,676 KB
testcase_06	AC	2 ms 6,676 KB
testcase_07	AC	2 ms 6,676 KB
testcase_08	AC	3 ms 6,676 KB
testcase_09	AC	2 ms 6,676 KB
testcase_10	AC	3 ms 6,676 KB
testcase_11	AC	3 ms 6,676 KB
testcase_12	AC	3 ms 6,676 KB
testcase_13	AC	115 ms 6,676 KB
testcase_14	AC	35 ms 6,676 KB
testcase_15	AC	32 ms 6,676 KB
testcase_16	AC	101 ms 6,676 KB
testcase_17	AC	23 ms 6,676 KB
testcase_18	AC	18 ms 6,676 KB
testcase_19	AC	39 ms 6,676 KB
testcase_20	AC	4 ms 6,676 KB
testcase_21	AC	22 ms 6,676 KB
testcase_22	AC	31 ms 6,676 KB
testcase_23	AC	31 ms 6,676 KB
testcase_24	AC	32 ms 6,676 KB
testcase_25	AC	53 ms 6,676 KB
testcase_26	AC	24 ms 6,676 KB
testcase_27	AC	30 ms 6,676 KB
testcase_28	AC	23 ms 6,676 KB
testcase_29	AC	26 ms 6,676 KB
testcase_30	AC	25 ms 6,676 KB
testcase_31	AC	101 ms 6,676 KB
testcase_32	AC	1 ms 6,676 KB
testcase_33	AC	2 ms 6,676 KB
testcase_34	AC	2 ms 6,676 KB
testcase_35	AC	2 ms 6,676 KB
testcase_36	AC	2 ms 6,676 KB
testcase_37	AC	2 ms 6,676 KB
testcase_38	AC	1 ms 6,676 KB
testcase_39	AC	2 ms 6,676 KB
testcase_40	AC	2 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
struct UnionFind{
    vector<int> par;
    vector<int> edg;

    UnionFind(int N) : par(N), edg(N){
        for(int i = 0; i < N; ++i){
            par[i] = -1;
            edg[i] = 0;
        }
    }

    int root(int x){
        if(par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if(rx == ry){
            edg[rx]++;
            return;
        }
        par[ry] = par[rx] + par[ry];
        par[rx] = ry;
        edg[ry] += edg[rx] + 1;
    }

    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    long long size(int x){
        return -par[root(x)];
    }

    long long edge(int x){
        return edg[root(x)];
    }
};

void input(){

}

void solve(){
    ll h, w, n, d; in(h, w, n, d);
    vll x(n), y(n);
    rep(i, n) in(x[i], y[i]);
    rep(i, n) x[i]--, y[i]--;

    vector<vll> used(h, vll(w, -1));
    auto lvr = [](ll l, ll v, ll r){
        return (l <= v && v < r);
    };
    UnionFind uf(n);
    rep(i, n) used[x[i]][y[i]] = i;
    rep(i, n){
        ll x1 = x[i], y1 = y[i];
        rep(x2, x1 - d, x1 + d + 1){
            rep(y2, y1 - d, y1 + d + 1){
                if(!lvr(0, x2, h) || !lvr(0, y2, w)) continue;
                if(used[x2][y2] == -1) continue;
                if(abs(x1 - x2) + abs(y1 - y2) <= d){
                    uf.unite(i, used[x2][y2]);
                }
            }
        }
    }
    vll rt;
    rep(i, n) if(uf.root(i) == i && uf.size(i) >= 2) rt.push_back(i);
    ll siz = rt.size();
    ll mn = INF, mx = -INF;
    rep(i, h) rep(j, w){
        if(used[i][j] != -1) continue;
        ll x1 = i, y1 = j;
        set<ll> s;
        rep(x2, x1 - d, x1 + d + 1){
            rep(y2, y1 - d, y1 + d + 1){
                if(!lvr(0, x2, h) || !lvr(0, y2, w)) continue;
                if(used[x2][y2] == -1) continue;
                if(abs(x1 - x2) + abs(y1 - y2) <= d){
                    s.insert(uf.root(used[x2][y2]));
                }
            }
        }
        ll res = -1;
        ll d = 0;
        for(auto x : s) if(uf.size(x) >= 2) d++;
        if(s.empty()) res = siz;
        else res = siz + 1LL - d;
        chmin(mn, res);
        chmax(mx, res);
    }
    out(mn, mx);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード