# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825958 | vjudge1 | Dijamant (COCI22_dijamant) | C++14 | 211 ms | 234616 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>
#define el '\n'
#define fi first
#define sc second
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=2e3+11;
bool a[N][N];
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int n, m;
bool inbound(int x,int y)
{
return (x>=0 && y>=0);
}
int ma1, ma2, mi1, mi2;
int cnt = 0;
void dfs(int x,int y)
{
a[x][y]=1;
cnt++;
ma1 = max(ma1,x+y);
mi1 = min(mi1,x+y);
ma2 = max(ma2,x-y);
mi2 = min(mi2,x-y);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |