| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 160498 |
2019-10-28T05:47:35 Z |
qkxwsm |
Strah (COCI18_strah) |
C++14 |
|
126 ms |
36352 KB |
/*
_____
.' '.
/ 0 0 \
| ^ |
| \ / |
\ '---' /
'._____.'
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
struct custom_hash
{
template<class T>
unsigned long long operator()(T v) const
{
unsigned long long x = v;
x += FIXED_RANDOM; x += 11400714819323198485ull;
x = (x ^ (x >> 30)) * 13787848793156543929ull;
x = (x ^ (x >> 27)) * 10723151780598845931ull;
return x ^ (x >> 31);
}
};
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;
template<class T>
void readi(T &x)
{
x = 0;
bool negative = false;
char c = ' ';
while (c < '-')
{
c = getchar();
}
if (c == '-')
{
negative = true;
c = getchar();
}
while (c >= '0')
{
x = x * 10 + (c - '0');
c = getchar();
}
if (negative)
{
x = -x;
}
}
template<class T>
void printi(T output)
{
if (output == 0)
{
putchar('0');
return;
}
if (output < 0)
{
putchar('-');
output = -output;
}
int buf[20], n = 0;
while(output)
{
buf[n] = ((output % 10));
output /= 10;
n++;
}
for (n--; n >= 0; n--)
{
putchar(buf[n] + '0');
}
return;
}
template<class T>
void ckmin(T &a, T b)
{
a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
T nmod(T &x, U mod)
{
if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
return (b ? gcd(b, a % b) : a);
}
template<class T>
T randomize(T mod)
{
return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;
#define sz(x) ((int) (x.size()))
const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;
#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 2013
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
int N, M;
bitset<MAXN> grid[MAXN];
ll dn[MAXN][MAXN];
ll ans = 0;
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
// cout << fixed << setprecision(10);
// cerr << fixed << setprecision(10);
// freopen ("file.in", "r", stdin);
// freopen ("file.out", "w", stdout);
cin >> N >> M;
for (int i = 1; i <= N; i++)
{
string temps; cin >> temps; temps = '&' + temps;
for (int j = 1; j <= M; j++)
{
grid[i][j] = (temps[j] == '.');
}
}
for (int i = N; i >= 1; i--)
{
for (int j = 1; j <= M; j++)
{
dn[i][j] = (grid[i][j] ? 1 + dn[i + 1][j] : 0);
}
}
for (int i = 1; i <= N; i++)
{
ll sum = 0, tot0 = 0, tot1 = 0;
vector<pll> go;
for (int j = 1; j <= M; j++)
{
if (!grid[i][j])
{
sum = 0; tot0 = 0; tot1 = 0;
go.clear();
continue;
}
ll freq = 1;
while(!go.empty() && go.back().fi >= dn[i][j])
{
freq += go.back().se;
tot0 -= (go.back().fi) * (go.back().fi + 1) * (go.back().se) * (go.back().se - 1);
sum -= 2 * go.back().se * go.back().fi * (go.back().fi + 1);
tot1 -= (2 * go.back().se * go.back().fi * (go.back().fi + 1));
tot1 -= go.back().se * sum;
go.pop_back();
}
go.PB({dn[i][j], freq});
tot0 += (go.back().fi) * (go.back().fi + 1) * (go.back().se) * (go.back().se - 1);
tot1 += (2 * go.back().se * go.back().fi * (go.back().fi + 1));
tot1 += go.back().se * sum;
sum += 2 * go.back().se * go.back().fi * (go.back().fi + 1);
// ll sum = 0, tot = 0;
// for (int k = sz(go) - 1; k >= 0; k--)
// {
// tot += (go[k].fi) * (go[k].fi + 1) * (go[k].se) * (go[k].se - 1) + (2 * go[k].se * go[k].fi * (go[k].fi + 1) * sum);
// sum += go[k].se;
// }
ans += (tot0 + tot1);
// ans += tot;
// cerr << i << ',' << j << ' ' << tot << endl;
}
}
ans /= 4;
cout << ans << '\n';
//ok, so you want to find sum of:
//size(rect) where rect is valid
// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2424 KB |
Output is correct |
| 2 |
Correct |
6 ms |
2424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2424 KB |
Output is correct |
| 2 |
Correct |
6 ms |
2424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2444 KB |
Output is correct |
| 2 |
Correct |
6 ms |
2424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
13304 KB |
Output is correct |
| 2 |
Correct |
76 ms |
26900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
76 ms |
24028 KB |
Output is correct |
| 2 |
Correct |
111 ms |
35064 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
15480 KB |
Output is correct |
| 2 |
Correct |
85 ms |
28680 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
10488 KB |
Output is correct |
| 2 |
Correct |
90 ms |
33436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
100 ms |
36352 KB |
Output is correct |
| 2 |
Correct |
126 ms |
36344 KB |
Output is correct |
