# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631574 | GudStonks | Dijamant (COCI22_dijamant) | C++17 | 861 ms | 15628 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;
#define ll long long
int n, m, ans;
string s[2005];
queue<pair<int, int> >q;
bool us[2005][2005];
pair<int, int>dir[] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
void fun()
{
cin>>n>>m;
for(int i = 0; i < n; i++)
{
cin>>s[i];
}
for(int i = 1; i < n - 1; i++)
{
for(int j = 1; j < m - 1; j++)
{
if(!us[i][j] && s[i][j] == '.')
{
vector<int>xx(n + 1, 0), yy(m + 1, 0);
q.push({i, j});
bool boo = 0;
int c = 0;
while(!q.empty())
{
int x = q.front().first,
y = q.front().second;
q.pop();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |