oj.uz

Submission #959463

# Submission time Handle Problem Language Result Execution time Memory
959463 2024-04-08T08:55:31 Z vjudge1 Strah (COCI18_strah) C++17
110 / 110
 177 ms 24008 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define lwb lower_bound
#define upb upper_bound

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int SZ = 2e3+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n,m, cnt[SZ][SZ], lo[SZ], hi[SZ];
char a[SZ][SZ];
vector<int> st1, st2;
ll res = 0;

int main()
{
    init();
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    for(int j = 1; j <= m; j++)
    {
        cnt[0][j] = 0;
        for(int i = 1; i <= n; i++)
        {
            if(a[i][j] == '.') cnt[i][j] = cnt[i-1][j] + 1;
            else cnt[i][j] = 0;
        }
    }
    for(int i = 1; i <= n; i++)
    {
        st1.clear();
        st2.clear();
        st1.pb(0);
        st2.pb(m+1);
        for(int j = m; j >= 1; j--)
        {
            while(st2.size() > 1 && cnt[i][st2.back()] > cnt[i][j]) st2.pop_back();
            hi[j] = st2.back();
            st2.pb(j);
        }
        for(int j = 1; j <= m; j++)
        {
            while(st1.size() > 1 && cnt[i][st1.back()] >= cnt[i][j]) st1.pop_back();
            ll x = j - st1.back(), y = hi[j] - j;
            res += (cnt[i][j] * (cnt[i][j] + 1) / 2) * ( x * y * (x+y) / 2 );
            st1.pb(j);
        }
    }
    cout << res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2652 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2652 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 9564 KB Output is correct
2 Correct 101 ms 17664 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 15752 KB Output is correct
2 Correct 157 ms 23120 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 10360 KB Output is correct
2 Correct 109 ms 18800 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12380 KB Output is correct
2 Correct 99 ms 21588 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 23976 KB Output is correct
2 Correct 177 ms 24008 KB Output is correct