# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947851 | NeroZein | Furniture (JOI20_furniture) | C++17 | 273 ms | 33912 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;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
const int N = 1003;
int n, m;
bool c[N][N];
int id[3][N][N];
bool blocked[N][N];
int adjblocked[2][N][N];
vector<vector<int>> dx, dy;
pair<int, int> cell[3][N + N];
void dfs(int s, int x, int y) {
//if (id[s][x][y] == -1) {
//exit(0);
//}
assert(id[s][x][y] != -1);
for (int k = 0; k < 2; ++k) {
int nx = x + dx[s][k], ny = y + dy[s][k];
if (id[s][nx][ny] != -1) return;
if (nx > n || ny > m) {
continue;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |