Submission #254584

#	Time	Username	Problem	Language	Result	Execution time	Memory
254584		leaked	Strah (COCI18_strah)	C++14	110 / 110	262 ms	39672 KiB

strah

#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 {
#ifndef 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 = 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 M=999999937;
const int N=2e3+1;
const int ppp=73;
const int Y=1;
const int X=0;
//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<<"NE";
    exit(0);
}
int n,m;
char a[N][N];
int posl[N][N],posu[N][N];
int ans[N][N];
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];
    }
    for(int i=0;i<n;i++){
        for(int j=m-1;j>=0;j--){
            if(a[i][j]=='#'){
                posl[i][j]=0;
            }else{
                posl[i][j]=posl[i][j+1]+1;
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(a[i][j]=='#'){
                posu[i][j]=0;
            }else{
                if(i)posu[i][j]=posu[i-1][j]+1;
                else posu[i][j]=1;
            }
        }
    }
    ll total=0;
    for(int i=0;i<n;i++){
        vector<pii>sc;
        ll s=0,bl=0;
        for(int j=m-1;j>=0;j--){
            if(a[i][j]=='#') {sc.clear();s=0;bl=0;continue;}
            ll st=1;
            while(sz(sc) && posu[i][sc.back().f]>=posu[i][j]){
                bl-=(posu[i][sc.back().f])*1ll*sc.back().s;
                s-=(1+posu[i][sc.back().f])*posu[i][sc.back().f]/2*1ll*(st*2-1+sc.back().s)*sc.back().s/2;
                st+=sc.back().s;
                sc.pop_back();
            }
            s=0;
            bl*=2;
            sc.p_b({j,st});
            st=1;
            reverse(all(sc));
            for(auto &z :  sc){
                s+=(1+posu[i][z.f])*posu[i][z.f]/2*1ll*(st*2-1+z.s)*z.s/2;
                st+=z.s;
            }
            reverse(all(sc));
//            s+=(1+posu[i][j])*posu[i][j]/2*1ll*(1+st)*st/2;
//            bl+=st*posu[i][j];
//            ans[i][j]=s;
//            total+=ans[i][j];
                total+=s;
//            debug()<<imie(i)<<imie(j)<<imie(ans[i][j])<<imie(s)<<imie(bl)<<imie((1+posu[i][j])*posu[i][j]/2*1ll*(1+st)*st/2);
        }
    }
    cout<<total;
    return 0;
}
/*
5
z 3 x y 3
2 y 3 z 3

/
*/

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 11 / 11
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 11 / 11
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11