oj.uz

답안 #227931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227931 2020-04-29T09:20:05 Z Vimmer Strah (COCI18_strah) C++14
55 / 110
 1000 ms 21112 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 2005
#define M ll(1e9 + 7)

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;

typedef long long ll;

typedef short int si;

//typedef tree<int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, m, pr[N][N];

ll ans;

bool gd(int i, int j, int a, int b)
{
    int sm = pr[i + a - 1][j + b - 1];

    if (i != 0) sm -= pr[i - 1][j + b - 1];

    if (j != 0) sm -= pr[i + a - 1][j - 1];

    if (i != 0 && j != 0) sm += pr[i - 1][j - 1];

    return sm == 0;
}

int opr(int i, int j, int x)
{
    int l = 1, r = m - j;

    while (l + 1 < r)
    {
        int md = (l + r) >> 1;

        if (gd(i, j, x, md)) l = md; else r = md - 1;
    }

    while (l > 0 && !gd(i, j, x, l)) l--;

    while (l < m - j && gd(i, j, x, l + 1)) l++;

    return l;
}
int main()
{
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;

    string s[n];

    for (int i = 0; i < n; i++) cin >> s[i];

    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
      {
          if (i != 0) pr[i][j] += pr[i - 1][j];

          if (j != 0) pr[i][j] += pr[i][j - 1];

          if (i != 0 && j != 0) pr[i][j] -= pr[i - 1][j - 1];

          if (s[i][j] == '#') pr[i][j]++;
      }

   for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
    {
        if (s[i][j] == '#') continue;

        int a = 1;

        while (a <= n - i)
        {
            int val = opr(i, j, a);

            if (val == 0) break;

            int l = a, r = n - i;

            while (l + 1 < r)
            {
                int md = (l + r) >> 1;

                if (opr(i, j, md) == val) l = md; else r = md - 1;
            }

            while (l > a && opr(i, j, l) != val) l--;

            while (l < n - i && opr(i, j, l + 1) == val) l++;

            ll lst = a - 1;

            lst = (lst * (lst + 1)) / 2;

            ll s = l, st = val;

            st = (st * (st + 1)) / 2;

            s = (s * (s + 1)) / 2;

            s -= lst;

            ans += s * st;

            a = l + 1;
        }

    }
    cout << ans << endl;
}

Compilation message

strah.cpp: In function 'int main()':
strah.cpp:88:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    for (int i = 0; i < n; i++)
    ^~~
strah.cpp:132:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     cout << ans << endl;
     ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
11.0 / 11.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 803 ms 8976 KB Output is correct
2 Execution timed out 1089 ms 15352 KB Time limit exceeded

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1078 ms 14336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1084 ms 9600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 9216 KB Output is correct
2 Execution timed out 1097 ms 18432 KB Time limit exceeded

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1085 ms 21112 KB Time limit exceeded
2 Halted 0 ms 0 KB -