# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918754 | waldi | Furniture (JOI20_furniture) | C++17 | 241 ms | 15960 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 FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) (int(x.size()))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
int main(){
int n, m;
scanf("%d%d", &n, &m);
vector czy(n, vector(m, 1));
vector suma(n+m-1, 0);
REP(i, n) REP(j, m) ++suma[i+j];
auto usun = [&](int si, int sj){
if(!czy[si][sj]) return;
czy[si][sj] = 0;
--suma[si+sj];
queue<pii> q;
q.emplace(si+1, sj);
q.emplace(si, sj+1);
while(ssize(q)){
auto [i, j] = q.front(); q.pop();
if(i<0 || j<0 || i>=n || j>=m || !czy[i][j]) continue;
if(i && czy[i-1][j]) continue;
if(j && czy[i][j-1]) continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |