제출 #503346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503346		inksamurai	Strah (COCI18_strah)	C++17	0 / 110	133 ms	35612 KiB

strah

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
 
void print(){
	cout<<"\n";
}
template<class te,class ...ti>
void print(const te&v, const ti&...nv) { 
	cout<<v;
	if(sizeof...(nv)){
		cout<<" ";
		print(nv...);
	}
}
 
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;

int tria(int x){
	return (x*(x+1))/2;
}

void slv(){
	int h,w;
	cin>>h>>w;
	vec(vi) a(h+1,vi(w));
	rep(i,h){
		rep(j,w){
			char ch;
			cin>>ch;
			a[i][j]=(ch=='.');
		}
	}
	h++;
	vec(vi) dwn(h,vi(w));
	drep(i,h){
		rep(j,w){
			if(!a[i][j]) dwn[i][j]=i;
			else dwn[i][j]=dwn[i+1][j];
		}
	}
	ll ans=0;
	drep(i,h-1){
		deque<pii> dq;
		ll _fsum=0,_sum=0;
		drep(j,w){
			if(!a[i][j]){
				dq.clear();
				_fsum=0;
				_sum=0;
			}else{
				int lo=dwn[i][j],cnt=1;
				while(sz(dq)){
					pii top=dq.front();
					if(top.fi<lo){
						break;
					}
					dq.pop_front();
					cnt+=top.se;
					_sum-=tria(top.fi-i);
					_sum+=tria(lo-i);
					_fsum-=(cnt-1)*tria(top.fi-i);
					_fsum+=(cnt-1)*tria(lo-i);
				}
				_sum+=tria(lo-i);
				_fsum+=_sum;
				// print(_sum,_fsum,"\n");
				ans+=_fsum;
				dq.push_front({lo,cnt});
			}
		}
		// print();
	}
	print(ans,'\n');
}
 
int main(){
_3qplfh5;
	int t=1;
	// cin>>t;
	rep(cs,t)
		slv();
//	
	return 0;
}

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