結果

問題 No.2696 Sign Creation
ユーザー ecottea
提出日時 2024-05-06 04:17:47
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 62 ms / 2,500 ms
コード長 10,490 bytes
コンパイル時間 4,486 ms
コンパイル使用メモリ 257,500 KB
最終ジャッジ日時 2025-02-21 11:17:57
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = {1, 0, -1, 0}; // 4
int DY[4] = {0, 1, 0, -1};
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//rollback Union-Find
/*
* Rollback_union_find(int n) : O(n)
* n Union-Find
*
* merge(int a, int b) : O(log n)
* a b
*
* bool same(int a, int b) : O(log n)
* a b
*
* int leader(int a) : O(log n)
* a
*
* int size(int a) : O(log n)
* a
*
* int size() : O(1)
*
*
* vvi groups() : O(n log n)
*
*
* snapshot() : O(1)
*
*
* rollback() : O(1)
*
*/
class Rollback_union_find {
// : https://snuke.hatenablog.com/entry/2016/07/01/000000
int n; //
int m; //
// parent_or_size[i] : i
// i
// -1
vi parent_or_size;
//
stack<pii> history;
public:
// n Union-Find
Rollback_union_find(int n) : n(n), m(0), parent_or_size(n, -1) {
// verify : https://codeforces.com/gym/100513/problem/A
}
Rollback_union_find() : n(0), m(0) {} //
// a, b
void merge(int a, int b) {
// verify : https://codeforces.com/gym/100513/problem/A
// a, b ra, rb
int ra = leader(a);
int rb = leader(b);
//
if (ra == rb) return;
// ra rb
if (-parent_or_size[ra] < -parent_or_size[rb]) swap(ra, rb);
if (-parent_or_size[ra] == 1) {
m++;
}
else if (-parent_or_size[rb] >= 2) {
m--;
}
//
history.emplace(ra, parent_or_size[ra]);
history.emplace(rb, parent_or_size[rb]);
// ra
parent_or_size[ra] += parent_or_size[rb];
parent_or_size[rb] = ra;
}
//
void snapshot() {
// verify : https://atcoder.jp/contests/abc302/tasks/abc302_h
history.emplace(INF, m);
}
//
void rollback() {
// verify : https://atcoder.jp/contests/abc302/tasks/abc302_h
while (true) {
auto [i, v] = history.top(); history.pop();
if (i == INF) {
m = v;
break;
}
parent_or_size[i] = v;
}
}
// a, b
bool same(int a, int b) {
// verify : https://codeforces.com/gym/100513/problem/A
//
return leader(a) == leader(b);
}
// a
int leader(int a) {
// a
int pa = parent_or_size[a];
if (pa < 0) return a;
// a a pa ra
int ra = leader(pa);
// rollback
return ra;
}
// a
int size(int a) {
// a 調
return -parent_or_size[leader(a)];
}
//
int size() {
return m;
}
//
vvi groups() {
vvi res;
vi r_to_i(n, -1); int i = 0;
rep(a, n) {
int r = leader(a);
if (r_to_i[r] == -1) {
r_to_i[r] = i++;
res.push_back(vi());
}
res[r_to_i[r]].push_back(a);
}
return res;
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, Rollback_union_find d) {
repe(g, d.groups()) {
repe(v, g) os << v << " ";
os << "/ ";
}
return os;
}
#endif
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int h, w, n, d;
cin >> h >> w >> n >> d;
vi xs(n), ys(n);
rep(i, n) cin >> xs[i] >> ys[i];
--xs; --ys;
vvi id(h, vi(w, -1));
rep(i, n) id[xs[i]][ys[i]] = i;
Rollback_union_find uf(n + 1);
rep(x, h) rep(y, w) {
if (id[x][y] == -1) continue;
repi(x2, max(x - d, 0), min(x + d, h - 1)) {
repi(y2, max(y - d + abs(x - x2), 0), min(y + d - abs(x - x2), w - 1)) {
if (id[x2][y2] != -1) {
uf.merge(id[x][y], id[x2][y2]);
}
}
}
}
dump(uf);
int res_max = -INF, res_min = INF;
rep(x, h) rep(y, w) {
if (id[x][y] != -1) continue;
uf.snapshot();
repi(x2, max(x - d, 0), min(x + d, h - 1)) {
repi(y2, max(y - d + abs(x - x2), 0), min(y + d - abs(x - x2), w - 1)) {
if (id[x2][y2] != -1) {
uf.merge(n, id[x2][y2]);
}
}
}
chmax(res_max, sz(uf));
chmin(res_min, sz(uf));
uf.rollback();
}
cout << res_min << " " << res_max << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0