| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 885622 | alexdd | Bomb (IZhO17_bomb) | C++17 | 1066 ms | 61200 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<iostream>
using namespace std;
int n,m;
char mat[2505][2505];
int sump[2505][2505];
int mars[2505][2505];
bool verif(int cntx, int cnty)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
mars[i][j]=0;
for(int i=1;i+cntx-1<=n;i++)
{
for(int j=1;j+cnty-1<=m;j++)
{
if(sump[i+cntx-1][j+cnty-1] - sump[i+cntx-1][j-1] - sump[i-1][j+cnty-1] + sump[i-1][j-1] == cntx*cnty)///toate is 1
{
mars[i][j]++;
mars[i][j+cnty]--;
mars[i+cntx][j]--;
mars[i+cntx][j+cnty]++;
}
mars[i][j] += mars[i-1][j] + mars[i][j-1] - mars[i-1][j-1];
if(mars[i][j]==0 && mat[i][j]=='1')
return 0;
}
}
return 1;
}
void solve_n3_y(int minx, int miny)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||