#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int n;
sc(n);
array<int,4> a[n];
bool arr[305][305];
memset(arr,0,sizeof arr);
FORR(i,a){
sc(i[0],i[1],i[2],i[3]);
swap(i[0],i[1]);
swap(i[2],i[3]);
}
pi t;
sc(t.e1,t.e2);
swap(t.e1,t.e2);
//all
FORR(i,a){
if(i[0] == i[2]){
FORE(x,min(i[1],i[3]),max(i[1],i[3]))
arr[i[0]][x] |= 1;
}
else{
FORE(x,min(i[0],i[2]),max(i[0],i[2]))
arr[x][i[1]] |= 1;
}
}
int fx,fy,lx,ly;
fx = fy = lx = ly = -1;
#define nn 304
FOR(i,0,nn){
bool is = 0;
FOR(x,0,nn)
is |= arr[i][x];
if(is){
if(!~fx) fx = i;
lx = i;
}
}
FOR(x,0,nn){
bool is = 0;
FOR(i,0,nn)
is |= arr[i][x];
if(is){
if(!~fy) fy = x;
ly = x;
}
}
for(int i = lx; i >= fx; --i){
FORE(x,fy,ly){
cout << (arr[i][x] ? '#' : '.');
}
cout << '\n';
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
640 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
17 ms |
3328 KB |
Output is correct |
| 4 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 5 |
Incorrect |
7 ms |
512 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 7 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
512 KB |
Output isn't correct |
| 10 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
