제출 #252811

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252811		leaked	Clickbait (COCI18_clickbait)	C++14	120 / 120	34 ms	29568 KiB

clickbait

#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")
//#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(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << 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 = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
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 N=1e3+5;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<-1;
    exit(0);
}
int n,m;
char a[N][N];
int pom[N][N];
struct lol{
    int x1,y1,x2,y2;
};
lol w[N*N];
bool used[N][N];
vector<pii>g[int(1e6)];
int rec(int i,int j,int ft){
    used[i][j]=1;
//    debug()<<imie(i)<<imie(j);
    if(pom[i][j]){
        int c=pom[i][j];
        g[c].p_b({i,ft});
        return c;
    }
    if(a[i][j]=='|'){
        if(i && !used[i-1][j]  && a[i-1][j]!='.') return rec(i-1,j,ft);
        return rec(i+1,j,ft);
    }
    if(a[i][j]=='+'){
        if(i && !used[i-1][j] && a[i-1][j]!='.') return rec(i-1,j,ft);
        if(j && !used[i][j-1]  && a[i][j-1]!='.') return rec(i,j-1,ft);
        if(j+1<m && !used[i][j+1]  && a[i][j+1]!='.') return rec(i,j+1,ft);
        if(i+1<n && !used[i+1][j] && a[i+1][j]!='.') return rec(i+1,j,ft);//pizdec
    }
    if(a[i][j]=='-'){
        if(j && !used[i][j-1] && a[i][j-1]!='.') return rec(i,j-1,ft);
        return rec(i,j+1,ft);///pizdec
    }
    return 1e9;
}
vector<int>ans;
void dfs(int v,int p){
    for(auto &z : g[v]){
        dfs(z.s,v);
    }
    ans.p_b(v);
}
signed main()
{
    fast_io;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) cin>>a[i][j];
    }
    int mx=-1;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int cur=j;
            int nmb=0;
            while((a[i][cur]=='.' || (a[i][cur]>='0' && a[i][cur]<='9'))){
                if(a[i][cur]=='.') cur++;
                else{
                    nmb*=10;nmb+=a[i][cur]-'0';
                    cur++;
                }
            }
            j=cur;
            if(!nmb) continue;
            int x1=i,x2=i,y1=cur,y2=cur;
            while(a[x1][cur]!='+')pom[x1][cur]=nmb,x1++;
            y1--;while(a[x1][y1]!='+') pom[x1][y1]=nmb,y1--;
            while(a[x2][cur]!='+') pom[x2][cur]=nmb,x2--;
            while(a[x2][y2]!='+')  pom[x2][y2]=nmb,y2--;
            w[nmb]={x1,y1,x2,y2};
            for(int t=y1;t<=y2;t++) pom[x1][t]=nmb;
            for(int t=y1;t<=y2;t++) pom[x2][t]=nmb;
            for(int t=x2;t<=x1;t++) pom[t][y2]=nmb;
            for(int t=x2;t<=x1;t++) pom[t][y1]=nmb;
            mx=max(mx,nmb);
//            debug()<<imie(nmb)<<imie(x1)<<imie(x2)<<imie(y1)<<imie(y2);
        }
    }
//    for(int i=0;i<n;i++){
//        for(int j=0;j<m;j++) cout<<pom[i][j];
//        cout<<endl;
//    }exit(0);
    for(int i=n-1;i>=0;i--){
        for(int j=m-1;j>=0;j--){
            if(pom[i][j]){
                if(i && a[i-1][j]=='|' && a[i][j]=='-'){
                    rec(i-1,j,pom[i][j]);
                }
            }
//            cout<<pom[i][j];
        }
//        cout<<endl;
    }
    for(int i=1;i<=mx;i++) sort(rall(g[i]));
    dfs(1,1);
    for(auto &z : ans) cout<<z<<endl;
    return 0;
}
/*


*/

• Subtask 1: 120 / 120