| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 293427 | rama_pang | Furniture (JOI20_furniture) | C++14 | 938 ms | 144356 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;
const int MAXN = 1005;
const int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int N, M;
int A[MAXN * MAXN];
int vis[MAXN * MAXN];
int adjptr[2][MAXN * MAXN];
array<pair<int, int>, 8> adj[2][MAXN * MAXN];
queue<pair<int, int>> q, qr;
void Bfs() {
for (int r = 0; r < 2; r++) {
while (!q.empty()) {
int x = q.front().first;
int y = q.front().second;
q.pop();
for (int id = 0; id < adjptr[r][x * MAXN + y]; id++) {
auto i = adj[r][x * MAXN + y][id];
int nx = i.first;
int ny = i.second;
if (vis[nx * MAXN + ny] & (1 << r)) {
continue;
}
vis[nx * MAXN + ny] |= 1 << r;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||