oj.uz

Submission #502872

# Submission time Handle Problem Language Result Execution time Memory
502872 2022-01-06T16:39:46 Z inksamurai Strah (COCI18_strah) C++17
0 / 110
 138 ms 35700 KB 
#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>;

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<tuple<ll,ll,ll>> dq;
		ll _sum=0,_fsum=0;
		drep(j,w){
			if(dwn[i][j]==i){
				dq.clear();
				_sum=0;
				_fsum=0;
			}else{
				int lo=dwn[i][j],cnt=1;
				while(sz(dq)){
					auto [plo,pcnt,pj]=dq.front();
					if(plo<lo){
						break;
					}
					cnt+=pcnt;
					_sum-=((plo-i)*(plo-i+1)/2)*pcnt;
					_fsum-=((plo-i)*(plo-i+1)/2)*pcnt*(pj-j);
					_fsum+=((lo-i)*(lo-i+1)/2)*pcnt*(pj-j);
					dq.pop_front();
				}
				// {
				// 	if(i==0 and j==0){
				// 		print(_fsum,'\n');
				// 	}
				// }
				_sum+=((lo-i)*(lo-i+1)/2)*cnt;
				_fsum+=_sum;
				ans+=_fsum;
				dq.push_front({lo,cnt,j});
			}
		}
	}
	print(ans,'\n');
}

int main(){
_3qplfh5;
	int t=1;
	// cin>>t;
	rep(cs,t)
		slv();
//	
	return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1100 KB Output is correct
2 Incorrect 4 ms 1100 KB Output isn't correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 9540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 95 ms 22008 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 61 ms 13968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 138 ms 35700 KB Output isn't correct
2 Halted 0 ms 0 KB -