| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 715655 | Farbod | Furniture (JOI20_furniture) | C++17 | 264 ms | 11304 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.
/*
* In the name of God
*
* Author: Farbod Doost
* Last Modified: Mon, 27 Mar 2023 (15:40:12)
*
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, par[N][N], c[N][N], cnt[N << 1];
bool vis[N][N];
void del(int i, int j)
{
if (vis[i][j])
return;
vis[i][j] = 1;
cnt[i + j]--;
if (i < n - 1) {
par[i + 1][j]--;
if (par[i + 1][j] == 0)
del(i + 1, j);
}
if (j < m - 1) {
par[i][j + 1]--;
if (par[i][j + 1] == 0)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||