| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 112032 | fredbr | Konj (COCI19_konj) | C++17 | 99 ms | 17528 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 ff first
#define ss second
using namespace std;
int const maxn = 310;
char saida[maxn][maxn];
using ii = pair<int, int>;
int lx = 400, rx = 0, ly = 400, ry = 0;
vector<ii> v[maxn][maxn];
char vis[maxn][maxn];
char s[maxn][maxn];
void dfs(int x, int y) {
if (vis[x][y]) return;
lx = min(lx, x);
ly = min(ly, y);
rx = max(rx, x);
ry = max(ry, y);
vis[x][y] = 1;
for (ii uu : v[x][y]) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||