# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572411 | ImperialALEN | Dijamant (COCI22_dijamant) | C++17 | 327 ms | 240820 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.
//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define all(x) (x.begin(), x.end());
#define uint unsigned int
#define pb push_back
using namespace std;
const ll N = 2e5+1, INF = 1e18 , inf = 1e9 , mod = 1e9+7;
int n, m, cnt = 0, mn = inf, mx = -inf, mxsum, mnsum;
char a[2002][2002];
bool used[2002][2002];
int di[4]{-1, 0, 1, 0};
int dj[4]{0, -1, 0, 1};
bool ok = 0;
void dfs(int vi, int vj){
used[vi][vj] = 1;
cnt++;
mx = max(mx, vi-vj);
mn = min(mn, vi-vj);
mxsum = max(mxsum, vi+vj);
mnsum = min(mnsum, vi+vj);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |