# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
800373 | tlnk07 | Dijamant (COCI22_dijamant) | C++17 | 1 ms | 468 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;
long long n, m, cnt = 0, temp;
bool grid[2001][2001];
string s;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; ++i)
{
cin >> s;
for(int j = 0; j < m; ++j) if(s[j] == '#') grid[i][j + 1] = true;
}
for(int i = 1; i < n; ++i)
{
for(int j = 2; j < m; ++j)
{
if(grid[i][j])
{
temp = -1;
bool check = 0, done = 0;
for(int k = 1; k <= n; ++k)
{
if(grid[i + k][j - k] == grid[i + k][j + k] && grid[i + k][j - k])
{
for(int l = j - k + 1; l < j + k; ++l)
{
if(grid[i + k][l])
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |