#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 2e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=2e5+2;
const int ppp=73;
//const int Y=1;
//const int X=0;
typedef pair<long long,int> pli;
//typedef tree<pli,null_type,less<pli>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
cout<<"-1";
exit(0);
}
int n;
int A[N],B[N],C[N],D[N];
map<pii,vector<int>>mp;
bool used[N];
map<int,vector<pii>>X;
map<int,vector<pii>>Y;
vector<vector<bool>>is(301,vector<bool>(301));
signed main()
{
fast_io;
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i]>>B[i]>>C[i]>>D[i];
if(A[i]>C[i]) swap(A[i],C[i]);
if(B[i]>D[i]) swap(B[i],D[i]);
swap(A[i],B[i]);
swap(C[i],D[i]);
mp[{A[i],B[i]}].p_b(i);
mp[{C[i],D[i]}].p_b(i);
}
int x,y;
cin>>x>>y;
swap(x,y);
queue<int>q;
for(int i=0;i<n;i++){
if(x==A[i] && A[i]==C[i]){
if(y>=B[i] && y<=D[i]){
used[i]=1;
q.push(i);
X[A[i]].p_b({B[i],C[i]});
}
}
if(y==B[i] && B[i]==D[i]){
if(x>=A[i] && x<=C[i]){
used[i]=1;
q.push(i);
Y[B[i]].p_b({A[i],D[i]});
}
}
}
while(!q.empty()){
int v=q.front();
q.pop();
for(auto &z : mp[{A[v],B[v]}]){
if(used[z]) continue;
q.push(z);
used[z]=1;
}
for(auto &z : mp[{C[v],D[v]}]){
if(used[z]) continue;
q.push(z);
used[z]=1;
}
}
for(int i=0;i<n;i++){
if(!used[i]) continue;
// cout<<i<<endl;
for(int j=A[i];j<=C[i];++j){
for(int k=B[i];k<=D[i];k++){
is[j][k]=1;
// cntX[j]++;
// cnty[k]++;
}
}
}
for(int i=0;i<=300;i++){
int o=0;
for(int j=0;j<sz(is[i]);j++){
o+=is[0][j];
}
if(o) break;
is.erase(is.begin());
debug()<<imie(is);
}
for(int i=0;i<=300;i++){
int o=0;
for(int j=0;j<sz(is[i]);j++){
o+=is[sz(is)-1][j];
}
if(o) break;
is.erase(--is.end());
debug()<<imie(is);
}
for(int i=0;i<=300;i++){
int o=0;
for(int j=0;j<sz(is);j++){
o+=is[j][0];
}
if(o) break;
for(int j=0;j<sz(is);j++){
is[j].erase(is[j].begin());
}
debug()<<imie(is);
}
for(int i=0;i<=300;i++){
int o=0;
for(int j=0;j<sz(is);j++){
o+=is[j].back();
}
if(o) break;
debug()<<imie(is);
for(int j=0;j<sz(is);j++){
is[j].erase(--is[j].end());
}
}
debug()<<imie(is);
for(int i=sz(is)-1;i>=0;i--){
for(int j=0;j<sz(is[i]);++j){
cout<<(is[i][j] ? "#" : ".");
}
cout<<endl;
}
return 0;
}
/*
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
182 ms |
15992 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
436 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
