結果

問題 No.2696 Sign Creation
ユーザー karinohitokarinohito
提出日時 2024-03-23 01:03:18
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 149 ms / 2,500 ms
コード長 3,859 bytes
コンパイル時間 5,212 ms
コンパイル使用メモリ 278,148 KB
実行使用メモリ 7,936 KB
最終ジャッジ日時 2024-12-20 12:38:08
合計ジャッジ時間 7,359 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vvvvvb = vector<vvvvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
if (C == 0 && p == q) {
return 1;
}
if (p < q) {
p = q;
return 1;
}
else {
return 0;
}
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
if (C == 0 && p == q) {
return 1;
}
if (p > q) {
p = q;
return 1;
}
else {
return 0;
}
}
ll modPow(long long a, long long n, long long p) {
if (n == 0) return 1; // 0
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
long long t = modPow(a, n / 2, p);
return (t * t) % p;
}
ll gcd(ll(a), ll(b)) {
if (a == 0)return b;
if (b == 0)return a;
ll c = a;
while (a % b != 0) {
c = a % b;
a = b;
b = c;
}
return b;
}
ll sqrtz(ll N) {
ll L = 0;
ll R = sqrt(N) + 10000;
while (abs(R - L) > 1) {
ll mid = (R + L) / 2;
if (mid * mid <= N)L = mid;
else R = mid;
}
return L;
}
bool DEB = 0;
using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
vector<mint> fact, factinv, inv, factK;
const ll mod = 1e9 + 7;
void prenCkModp(ll n) {
//factK.resize(4*n+5);
fact.resize(n + 5);
factinv.resize(n + 5);
inv.resize(n + 5);
fact[0] = fact[1] = 1;
factinv[0] = factinv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < n + 5; i++) {
fact[i] = (fact[i - 1] * i);
inv[i] = (mod - ((inv[mod % i] * (mod / i))));
factinv[i] = (factinv[i - 1] * inv[i]);
}
//factK[0]=1;
//for(ll i=1;i<4*n+5;i++){
// factK[i]=factK[i-1]*mint(K-i+1);
// //K*(K-1)*...*(K-i+1);
//}
}
mint nCk(ll n, ll k) {
if (n < k || k < 0) return 0;
return (fact[n] * ((factinv[k] * factinv[n - k])));
}
//mint nCkK(ll n,ll k){
// if(K<n||K-n<k)return 0;
// mint res=factK[n+k];
// res*=factK[n].inv();
// res*=factinv[k];
// return res;
//}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll H,W,N,D;
cin>>H>>W>>N>>D;
vvll S(H,vll(W,-1));
dsu d(N);
rep(i,N){
ll X,Y;
cin>>X>>Y;
X--;Y--;
S[X][Y]=i;
for(ll x=X-D;x<=X+D;x++){
for(ll y=Y-D;y<=Y+D;y++){
if(x<0||y<0||x>=H||y>=W)continue;
if(S[x][y]==-1)continue;
if(abs(x-X)+abs(y-Y)>D)continue;
d.merge(S[X][Y],S[x][y]);
}
}
}
auto DV=d.groups();
ll V=DV.size();
for(auto P:DV)if(P.size()==1)V--;
ll m=1e18;
ll M=0;
rep(X,H)rep(Y,W){
if(S[X][Y]>=0)continue;
set<ll> SS;
bool OC=0;
for(ll x=X-D;x<=X+D;x++){
for(ll y=Y-D;y<=Y+D;y++){
if(x<0||y<0||x>=H||y>=W)continue;
if(S[x][y]==-1)continue;
if(abs(x-X)+abs(y-Y)>D)continue;
ll LD=d.leader(S[x][y]);
if(d.size(LD)==1){
OC=1;
continue;
}
SS.insert(d.leader(S[x][y]));
}
}
ll SN=SS.size();
if(SN>0){
m=min(m,V-(SN-1));
M=max(M,V-(SN-1));
}
else{
m=min(m,V+OC);
M=max(M,V+OC);
}
}
cout<<m<<" "<<M<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0