oj.uz

Submission #100317

# Submission time Handle Problem Language Result Execution time Memory
100317 2019-03-10T11:25:53 Z Linkus Konj (COCI19_konj) C++14
70 / 70
 52 ms 10616 KB 
#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 300001

int link[N],size[N];

int find(int x){
    while(x != link[x]) x = link[x];
    return x;
}

void unite(int i, int x){
    i = find(i), x = find(x);
    if(i == x) return;
    if(size[i] < size[x]) swap(i,x);
    size[i] += size[x];
    link[x] = i;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    sc(n);
    array<int,4> a[n];
    bool arr[305][305];
    FOR(i,0,N){
        link[i] = i;
        size[i] = 1;
    }
    memset(arr,0,sizeof arr);
    vector<int> wh[305][305];
    FORR(i,a){
        sc(i[0],i[1],i[2],i[3]);
        swap(i[0],i[1]);
        swap(i[2],i[3]);
    }
    FOR(i,0,n){
        FORR(x,wh[a[i][0]][a[i][1]])
            unite(i,x);
        FORR(x,wh[a[i][2]][a[i][3]])
            unite(i,x);
        wh[a[i][0]][a[i][1]].pb(i);
        wh[a[i][2]][a[i][3]].pb(i);
    }
    pi t;
    sc(t.e1,t.e2);
    swap(t.e1,t.e2);
    int itt = -1;
    FORR(i,a){
        ++itt;
        bool un = 0;
        if(i[0] == i[2]){
            FORE(x,min(i[1],i[3]),max(i[1],i[3])){
                un |= t == mp(i[0],x);
                /* arr[i[0]][x] |= 1; */
            }
        }
        else{
            FORE(x,min(i[0],i[2]),max(i[0],i[2]))
                un |= t == mp(x,i[1]);
                /* arr[x][i[1]] |= 1; */
        }
        if(un)
            unite(itt,n);
    }
    itt = -1;
    FORR(i,a){
        if(find(++itt) != find(n)) continue;
        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';
    }
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 52 ms 10616 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 6 ms 4992 KB Output is correct
9 Correct 8 ms 4992 KB Output is correct
10 Correct 7 ms 4992 KB Output is correct