답안 #119403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119403	2019-06-21T07:38:55 Z	ryansee	Strah (COCI18_strah)	C++14	99 / 110	182 ms	4340 KB

strah

#define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF 5000//((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second	
#define db 0
#define EPS (1e-7)    //0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (300006)
#define ll /*long long*/ int 
#define ld long double
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for(ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair <short,short> pi;
typedef pair <ll, pi> spi;
typedef pair <pi, pi> dpi;
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss
string to_string(char c) {string s(1,c);return s;}string to_string(bool b){return (b ? "true" : "false");}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}void degug_out() { cerr << endl; }template <typename Head, typename... Tail>void degug_out(Head H, Tail... T) {cerr << " " << to_string(H);degug_out(T...);}inline ll gcd(ll a,ll b){if(a>b)swap(a,b);if(a==0)return b;return gcd(b%a,a);}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr if(0)cout
#endif
short n,m,A[2002],dp[2002],mxelem[2002]; int p[3002];long long ans; char grid[2002][2002];
bool gg[2002];
stack<pi>stk;
ll nC2(ll n){return (long long)n*(n+1)/2; }
int main(){
	FAST
	cin>>n>>m;
	FOR(i,0,n)FOR(j,0,m)cin>>grid[i][j];
	FOR(i,1,3001)p[i]=p[i-1]+(i*(i-1));
	FOR(ii,0,n){
		FOR(j,0,m){
			if(grid[ii][j]=='#')A[j]=0;
			else A[j]++;
		}
		mmst(dp,0); mmst(gg,0); mmst(mxelem,0); //vector<ll>start[2002],endd[2002]; //FOR(j,1,m)if(A[j-1]==A[j])gg[j]=1;
		while(stk.size())stk.pop();
		stk.emplace(-LLINF,-1);
		FOR(j,0,m){
			if(!gg[j]){
				while(stk.size()&&stk.top().f>=A[j]){
					if(stk.top().f==A[j]){gg[j]=1;break;}stk.pop();
				}
				if(!gg[j]){
				mxelem[j]=max(mxelem[j],stk.top().f); dp[j]=j-stk.top().s; //start[stk.top().s+1].pb(A[j]);endd[j].pb(A[j]);
				}
			}stk.emplace(A[j],j);
		}
		while(stk.size())stk.pop();
		stk.emplace(-LLINF,m);
		for(ll j=m-1;j>=0;--j){
			if(!gg[j]){
				while(stk.size()&&stk.top().f>=A[j]){
					stk.pop();
				}
				mxelem[j]=max(mxelem[j],stk.top().f);dp[j]+=stk.top().s-j; //start[j+1].pb(A[j]);endd[stk.top().s].pb(A[j]);
			}stk.emplace(A[j],j);
		}
		// multiset<short>heights;heights.ins(0);
		FOR(j,0,m)if(!gg[j]){
			if(!gg[j]){assert(dp[j]>=2);dp[j]--;}
			// for(auto i:start[j])heights.ins(i);
			// for(auto i:endd[j])heights.erase(heights.find(i));
			// if(gg[j])continue;if(0)cerr<<ii<<' '<<j<<' '<<(nC2(A[j]-*(--heights.end()))*(nC2(dp[j])*dp[j]-p[dp[j]]))<<'\n';
			// cerr<<A[j]<<": "<<(*--heights.end())<<'\n';
			// cerr<<"start: ";for(auto i:start[j])cerr<<i<<' ';cerr<<endl;
			// cerr<<"endd: ";for(auto i:endd[j])cerr<<i<<' ';cerr<<endl;
			ans+=(nC2(A[j])*((long long)nC2(dp[j])*dp[j]-p[dp[j]]))-((long long)nC2(mxelem[j])*(long long)(nC2(dp[j])*dp[j]-p[dp[j]]));
		}
		// cerr<<ans<<'\n';
	}
	cout<<ans;
}
/*
2 3
.#.
..#
* 
* 3 4
..#.
#...
...#
*/

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	1024 KB	Output is correct
2	Correct	7 ms	1024 KB	Output is correct

Subtask #4
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	896 KB	Output is correct
2	Correct	8 ms	896 KB	Output is correct

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	1024 KB	Output is correct
2	Correct	7 ms	1024 KB	Output is correct

Subtask #6
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	63 ms	2048 KB	Output is correct
2	Correct	121 ms	3328 KB	Output is correct

Subtask #7
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	135 ms	2936 KB	Output is correct
2	Correct	182 ms	4244 KB	Output is correct

Subtask #8
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	74 ms	2124 KB	Output is correct
2	Correct	131 ms	3568 KB	Output is correct

Subtask #9
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	3980 KB	Output is correct
2	Correct	129 ms	4104 KB	Output is correct

Subtask #10
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	166 ms	4340 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

답안 #119403

Compilation message