제출 #1115082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115082		duytuandao21	Bob (COCI14_bob)	C++17	24 / 120	1074 ms	34376 KiB

bob

#include <bits/stdc++.h>
using namespace std;
#define int long long

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

int n, m;
int a[2000][2000], s[2000][2000];

int getSum(int i, int j, int u, int v) {
    return s[u][v] - s[u][j - 1] - s[i - 1][v] + s[i - 1][j - 1];
}
int getNum(int i, int j, int u, int v) {
    return (u - i + 1) * (v - j + 1);
}
bool check(int x, int y, int u, int v) {
    for (int i = x; i <= u; i++) {
        for (int j = y; j <= v; j++)
            if (a[i][j] != a[x][y]) return false;
    }
    return true;
}
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++) s[i][j]= a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
    
    int res = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            for (int ki = i; ki <= n; ki++) {
                for (int kj = j; kj <= m; kj++) {
                    res += check(i, j, ki, kj);
                }
            }
        }
    }
    cout << res;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12