# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
907308 | daoquanglinh2007 | Bomb (IZhO17_bomb) | C++17 | 1061 ms | 55892 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int NM = 2500, inf = 1e9+7;
int N, M, f[NM+5][NM+5], dp[NM+5][NM+5], ans = 0, H = +inf, W = +inf;
char a[NM+5][NM+5];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int get_rand(int l, int r){
int tmp = rng()%(r-l+1);
if (tmp < 0) tmp += r-l+1;
return l + tmp;
}
int getf(int x, int y, int u, int v){
return f[u][v]-f[x-1][v]-f[u][y-1]+f[x-1][y-1];
}
bool check(int r, int c){
for (int i = 1; i <= N; i++)
for (int j = 1; j <= M; j++) dp[i][j] = 0;
for (int i = 1; i+r-1 <= N; i++)
for (int j = 1; j+c-1 <= M; j++)
if (getf(i, j, i+r-1, j+c-1) == r*c){
dp[i][j]++;
dp[i+r][j]--;
dp[i][j+c]--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |