oj.uz

답안 #670070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670070 2022-12-08T02:38:01 Z Do_you_copy Strah (COCI18_strah) C++17
110 / 110
 156 ms 82892 KB 
/*
    I find it wholesome to be alone the greater part of the time.
    To be in company, even with the best, is soon wearisome and dissipating.
    I love to be alone.
    I never found the companion that was so companionable as solitude.
*/
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 3e3 + 10;
//const int Mod = 1e9 + 7;
//const int inf =
int n, m;
string s[maxN];
int high[maxN][maxN];
int l[maxN][maxN];
int r[maxN][maxN];
void Init(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++i){
        cin >> s[i];
        s[i] = "#" + s[i] + "#";
        for (int j = 1; j <= m; ++j){
            high[i][j] = (s[i][j] == '.') ? high[i - 1][j] + 1 : 0;
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++i){
        vector <int> S;
        for (int j = 1; j <= m; ++j){
            while (!S.empty() && high[i][S.back()] >= high[i][j]) S.pop_back();
            l[i][j] = S.empty() ? 1 : S.back() + 1;
            S.pb(j);
        }
        S.clear();
        for (int j = m; j >= 1; --j){
            while (!S.empty() && high[i][S.back()] > high[i][j]) S.pop_back();
            r[i][j] = S.empty() ? m : S.back() - 1;
            S.pb(j);
        }
        for (int j = 1; j <= m; ++j){
            int x = j - l[i][j] + 1;
            int y = r[i][j] - j + 1;
            ans += 1LL * high[i][j] * (high[i][j] + 1) * x * y * (x + y) / 4;
            //cerr << high[i][j] << " " << i << " " << j << " " << ans << "\n";
        }
    }
    cout << ans;
}

#define debug
#define taskname "test"
signed main(){
    faster
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
        #ifndef debug
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        #endif // debug
    }
}

Compilation message

strah.cpp: In function 'int main()':
strah.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
strah.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
11.0 / 11.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
11.0 / 11.0

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

Subtask #7
11.0 / 11.0

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

Subtask #8
11.0 / 11.0

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

Subtask #9
11.0 / 11.0

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

Subtask #10
11.0 / 11.0

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