oj.uz

Submission #197872

# Submission time Handle Problem Language Result Execution time Memory
197872 2020-01-23T22:46:05 Z Osama_Alkhodairy Strah (COCI18_strah) C++17
110 / 110
 323 ms 28388 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
 
const int N = 2001;
 
int n, m, g[N][N], p[N], sz[N], h[N];
vector <string> a;
vector <int> v[N];
ll sum;
 
ll f(int x){
    return 1LL * x * (x + 1) * (x + 2) / 6;
}
int find(int x){
    if(p[x] == x) return x;
    return p[x] = find(p[x]);
}
void merge(int x, int y){
    x = find(x);
    y = find(y);
    sz[y] += sz[x];
    p[x] = y;
}
void add(int x){
    h[x] = 1;
    if(x > 0 && h[x - 1]){
        sum -= f(sz[find(x - 1)]);
        merge(x - 1, x);
    }
    if(x < n - 1 && h[x + 1]){
        sum -= f(sz[find(x + 1)]);
        merge(x, x + 1);
    }
    sum += f(sz[find(x)]);
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    a.resize(n);
    for(auto &i : a) cin >> i;
    for(int i = 0 ; i < n ; i++){
        g[i][m] = m;
        for(int j = m - 1 ; j >= 0 ; j--){
            g[i][j] = g[i][j + 1];
            if(a[i][j] == '#') g[i][j] = j;
        }
    }
    ll ans = 0;
    for(int col1 = 0 ; col1 < m ; col1++){
        sum = 0;
        for(int row = 0 ; row < n ; row++){
            v[g[row][col1]].push_back(row);
            h[row] = 0; p[row] = row; sz[row] = 1;
        }
        for(int col2 = m ; col2 > col1 ; col2--){
            for(auto &i : v[col2]) add(i);
            v[col2].clear();
            ans += sum * (col2 - col1);
        }
    }
    cout << ans << endl;
}

Subtask #1
11.0 / 11.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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2296 KB Output is correct
2 Correct 8 ms 2168 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2296 KB Output is correct
2 Correct 8 ms 2168 KB Output is correct

Subtask #5
11.0 / 11.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 10360 KB Output is correct
2 Correct 165 ms 17976 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 19116 KB Output is correct
2 Correct 283 ms 23428 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 10364 KB Output is correct
2 Correct 185 ms 19192 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 9592 KB Output is correct
2 Correct 231 ms 21204 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 23368 KB Output is correct
2 Correct 298 ms 28388 KB Output is correct