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

提出ソース

結果

問題	No.2696 Sign Creation
ユーザー	siganai
提出日時	2024-03-22 22:17:11
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	9,593 bytes
コンパイル時間	2,854 ms
コンパイル使用メモリ	226,644 KB
実行使用メモリ	13,760 KB
最終ジャッジ日時	2024-05-17 18:12:00
合計ジャッジ時間	6,879 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 13,760 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	3 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	63 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	24 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	TLE	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-
testcase_20	--	-
testcase_21	--	-
testcase_22	--	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-

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

ソースコード

raw source code

#line 1 "test.cpp"
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }

#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
#line 1 "library/data-structure/unionfind.hpp"
struct unionfind {
  public:
    unionfind() : _n(0) {}
    explicit unionfind(int n) : _n(n), parent_or_size(n, -1) {}
    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = find(a), y = find(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }
    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return find(a) == find(b);
    }
    int find(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = find(parent_or_size[a]);
    }
    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[find(a)];
    }
    vector<vector<int>> groups() {
        vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = find(i);
            group_size[leader_buf[i]]++;
        }
        vector<vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            remove_if(result.begin(), result.end(),
                           [&](const vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    vector<int> parent_or_size;
};
#line 90 "test.cpp"
int main() {
    INT(h,w,n,d);
    vi x(n),y(n);
    rep(i,n) cin >> x[i] >> y[i];
    map<pii,int> mp;
    rep(i,n) mp[pii{x[i],y[i]}] = i;
    unionfind uf(n);
    rep(i,n) {
        rep(j,-d,d+1) {
            int d1 = abs(j);
            rep(k,-d+d1,d+1-d1) {
                int nx = x[i] + j;
                int ny = y[i] + k;
                if(mp.find(pii{nx,ny}) != mp.end()) {
                    uf.merge(mp[pii{nx,ny}],i);
                }
            }
        }
    }
    vi ok(n);
    auto gs = uf.groups();
    int c = 0;
    rep(i,gs.size()) {
        if(gs[i].size() > 1) {
            c++;
            rep(j,gs[i].size()) {
                ok[gs[i][j]] = 1;
            }
        }
    }
    int ma = 0;
    int mi = 1e9;
    int flg = 0;
    rep(i,n) {
        if(!ok[i]) {
            rep(j,-d,d+1) {
                int d1 = abs(j);
                rep(k,-d+d1,d+1-d1) {
                    int nx = x[i] + j;
                    int ny = y[i] + k;
                    if(1 <= nx && nx <= h && 1 <= ny && ny <= w) {
                        int flg2 = 1;
                        rep(jj,-d,d+1) {
                            int d2 = abs(jj);
                            rep(kk,-d+d2,d+1-d2) {
                                int nnx = ny + jj;
                                int nny = ny + kk;
                                if(mp.find(pii{nnx,nny}) != mp.end()) {
                                    if(ok[mp[pii{nnx,nny}]] == 1) {
                                        flg2 = 0;
                                        break;
                                    }
                                }
                            }
                            if(flg2 == 0) break;
                        }
                        if(flg2 == 1) {
                            flg = 1;
                            break;
                        }
                    }
                }
                if(flg) break;
            }
            if(flg) break;
        }
    }
    if(flg) {
        ma = 1 + c;
        chmin(mi,1 + c);
    }
    int isof = 0;
    rep(i,1,h+1) {
        rep(j,1,w+1) {
            int f = 1;
            rep(l,-d,d+1) {
                int d1 = abs(l);
                rep(k,-d+d1,d+1-d1) {
                    int nx = i + l;
                    int ny = j + k;
                    if(mp.find(pii{nx,ny}) != mp.end()) {
                        f = 0;
                        break;
                    }
                }
                if(!f) break;
            }
            if(f) {
                isof = 1;
                break;
            }
        }
        if(isof) break;
    }
    if(isof) {
        chmax(ma,c);
        chmin(mi,c);
    }
    rep(i,n) {
        if(ok[i]) {
            rep(j,-d,d+1) {
                int d1 = abs(j);
                rep(k,-d+d1,d+1-d1) {
                    int nx = x[i] + j;
                    int ny = y[i] + k;
                    if(mp.find(pii{nx,ny}) == mp.end()) {
                        set<int> se;
                        rep(jj,-d,d+1) {
                            int d2 = abs(jj);
                            rep(kk,-d+d2,d-d2+1) {
                                int nnx = nx + jj;
                                int nny = ny + kk;
                                if(mp.find(pii{nnx,nny}) != mp.end()) {
                                    int id = mp[pii{nnx,nny}];
                                    if(ok[id] == 1) se.insert(uf.find(id));
                                }
                            } 
                        }
                        chmax(ma,c - (int)se.size() + 1);
                        chmin(mi,c - (int)se.size() + 1);
                    }
                }
            }
        }
    }
    cout << mi << " " << ma << '\n';
}

yukicoder

結果

テストケース

ソースコード