結果
| 問題 |
No.2696 Sign Creation
|
| コンテスト | |
| ユーザー |
 kaikey
|
| 提出日時 | 2024-03-22 22:23:47 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,431 bytes |
| コンパイル時間 | 3,524 ms |
| コンパイル使用メモリ | 230,668 KB |
| 最終ジャッジ日時 | 2025-02-20 11:55:35 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 22 WA * 6 TLE * 1 -- * 9 |
ソースコード
#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
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 != v.size() ? " " : "");
return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
for (T& in : v) is >> in;
return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
F f;
rec(F&& f_) : f(std::forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
lint from, to;
lint cost;
Edge() {
}
Edge(lint u, lint v, lint c) {
cost = c;
from = u;
to = v;
}
bool operator<(const Edge& e) const {
return cost < e.cost;
}
};
struct WeightedEdge {
lint to;
lint cost;
WeightedEdge(lint v, lint c) {
to = v;
cost = c;
}
bool operator<(const WeightedEdge& e) const {
return cost < e.cost;
}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<plint, V<plint>> vVl;
typedef pair<string, string> pstr;
typedef pair<ld, lint> pint;
typedef pair<lint, set<pint>> pset;
struct UnionFind {
vector<int> par;
stack<pair<int, int>> history;
UnionFind() {}
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return root(par[x]);
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y) {
x = root(x); y = root(y);
history.emplace(x, par[x]);
history.emplace(y, par[y]);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) {
return -par[root(x)];
}
// 1-step undo
void undo() {
for (int iter = 0; iter < 2; ++iter) {
par[history.top().first] = history.top().second;
history.pop();
}
}
// erase history
void snapshot() {
while (!history.empty()) history.pop();
}
// all rollback
void rollback() {
while (!history.empty()) undo();
}
};
void solve() {
lint H, W, N, D;
cin >> H >> W >> N >> D;
set<plint> st;
map<plint, lint> fx;
map<plint, Vl> connects;
V<plint> arr;
REP(i, N) {
lint X, Y;
cin >> X >> Y;
st.insert({ X, Y });
fx[{X, Y}] = i;
arr.push_back({ X, Y });
}
UnionFind tree(N);
REP(i, N) {
FOR(x, -D, D + 1) {
FOR(y, -D + abs(x), D - abs(x) + 1) {
plint p = { arr[i].first + x, arr[i].second + y };
if (fx.count(p)) {
tree.merge(i, fx[p]);
}
st.insert(p);
connects[p].push_back(i);
}
}
}
lint curr = 0;
set<lint> _st;
REP(i, N) {
if (!_st.count(tree.root(i))) {
if (tree.size(i) != 1) curr++;
}
_st.insert(tree.root(i));
}
lint minv = INF, maxv = -INF;
for (auto p : connects) {
auto v = p.second;
lint _curr = curr, bk = 0;
REP(i, SZ(v) - 1) {
if (!tree.issame(v[i], v[i + 1])) {
lint prv = 0;
if (tree.size(v[i]) != 1) prv++;
if (tree.size(v[i + 1]) != 1) prv++;
_curr -= prv;
_curr++;
bk++;
tree.merge(v[i], v[i + 1]);
}
}
chmin(minv, _curr);
chmax(maxv, _curr);
REP(i, bk) tree.undo();
}
if (N == 0) {
chmin(minv, 0ll);
chmax(maxv, 0ll);
}
cout << minv << " " << maxv << endk;
}
int main() {
lint T = 1;
//cin >> T;
while (T--) solve();
}