# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294804 | muhammad_hokimiyon | Furniture (JOI20_furniture) | C++14 | 384 ms | 12280 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 fi first
#define se second
#define ll long long
#define dl double long
using namespace std;
const int N = 1e3 + 7;
const int M = 21;
const ll mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m,q;
int d[N + N];
int a[N][N];
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int solve( int x , int y )
{
if( a[x][y] )return 1;
if( d[x + y] == 1 )return 0;
queue < pair < int , int > > q;
q.push({x , y});
a[x][y] = 1;
d[x + y] -= 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |