# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1143256 | owoovo | Furniture (JOI20_furniture) | C++20 | 160 ms | 14300 KiB |
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
using namespace std;
int n,m;
int in[1010][1010],out[1010][1010],cnt[1010][1010],hv[2010];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
in[i][j]=out[i][j]=2;
cnt[i][j]=1;
hv[i+j]++;
}
}
for(int i=1;i<=n;i++)in[i][1]--,out[i][m]--;
for(int i=1;i<=m;i++)in[1][i]--,out[n][i]--;
queue<pair<int,int>>q;
auto tp=[&](){
while(!q.empty()){
auto [x,y]=q.front();
//cout<<x<<" "<<y<<" pt\n";
q.pop();
if(cnt[x][y]==0)continue;
cnt[x][y]--;
hv[x+y]--;
out[x-1][y]--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |