oj.uz

Submission #1115103

# Submission time Handle Problem Language Result Execution time Memory
1115103 2024-11-20T04:12:08 Z duytuandao21 Bob (COCI14_bob) C++17
72 / 120
 1000 ms 37312 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2e5 + 7;
const int inf = 1e9 + 7;
typedef pair<int, int> pii;

int n, m;
int a[2000][2000], b[2000][2000];
int bit[2000][2000];

void update(int u, int v, int val) {
    for (int i = u; i <= n; i += (i & (-i)))
        for (int j = v; j <= m; j += (j & (-j))) bit[i][j] += val;
} 
int get(int u, int v) {
    int ans = 0;
    for (int i = u; i > 0; i -= (i & (-i)))
        for (int j = v; j > 0; j -= (j & (-j))) ans += bit[i][j];
    return ans;
}
int cal(int x, int y, int u, int v) {
    return get(u, v) - get(u, y - 1) - get(x - 1, v) + get(x - 1, y - 1);
}
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) 
        for (int j = 1; j <= m; j++) cin >> a[i][j];
    
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            for (int k = j; k <= m + 1; k++) {
                if (a[i][k] != a[i][j]) {
                    b[i][j] = k - 1;
                    break;
                }
            }
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            int minCol = inf;
            for (int k = i; k <= n; k++) {
                if (a[k][j] != a[i][j]) break;
                minCol = min(minCol, b[k][j]);
                res += minCol - j + 1;
            }
        }
    }
    cout << res;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 18768 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 18932 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 18768 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 18768 KB Output is correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 35300 KB Output is correct
2 Execution timed out 1069 ms 37304 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 35288 KB Output is correct
2 Correct 467 ms 37312 KB Output is correct
3 Execution timed out 1065 ms 37192 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 35144 KB Output is correct
2 Execution timed out 1069 ms 37192 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 35144 KB Output is correct
2 Execution timed out 1056 ms 37200 KB Time limit exceeded
3 Halted 0 ms 0 KB -