Codeforce 26C Parquet

最新推荐文章于 2020-11-07 22:00:04 发布

bklotus

最新推荐文章于 2020-11-07 22:00:04 发布

阅读量326

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/bklotus/article/details/79021706

版权

模拟专栏收录该内容

1 篇文章

订阅专栏

本文解析了一道关于使用不同尺寸的砖块铺设地板的模拟题。通过合理的算法设计，实现有效的砖块放置策略，并判断是否可以完全覆盖指定大小的空间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Once Bob decided to lay a parquet floor in his living room. The living room is of size n × m metres. Bob had planks of three types: a planks 1 × 2 meters, b planks 2 × 1 meters, and c planks 2 × 2 meters. Help Bob find out, if it is possible to parquet the living room with such a set of planks, and if it is possible, find one of the possible ways to do so. Bob doesn’t have to use all the planks.
Input
The first input line contains 5 space-separated integer numbers n, m, a, b, c (1 ≤ n, m ≤ 100, 0 ≤ a, b, c ≤ 104), n and m — the living room dimensions, a, b and c — amount of planks 1 × 2, 2 × 1 и 2 × 2 respectively. It’s not allowed to turn the planks.
Output
If it is not possible to parquet the room with such a set of planks, output IMPOSSIBLE. Otherwise output one of the possible ways to parquet the room — output n lines with m lower-case Latin letters each. Two squares with common sides should contain the same letters, if they belong to one and the same plank, and different letters otherwise. Different planks can be marked with one and the same letter (see examples). If the answer is not unique, output any.

题目大意：有n*m的区域，1*2，2*1，2*2的砖块各a,b,c块，若能全部覆盖，则输出一种覆盖情况，否则输出”IMPOSSIBLE”。

一道模拟题？第一次做的时候思路不清晰，结果wa*10，改来改去整个码都乱套了。第二天删了重写，一遍就过了。。。

下面是笨重的AC代码，不过思路很清晰。。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
char mapp[105][105]={};
char Generating(int len1,int len2){//生成一个字符
    for(int i='a';i<='z';i++){
        if(len1==0&&len2==0){//位于左顶角
            return i;
        }
        else if(len1==0&&len2!=0){//位于第一行
            if(mapp[len1][len2-1]!=i && mapp[len1+1][len2-1]!=i){
                return i;
            }
        }
        else if(len1!=0&&len2==0){//位于第一列
            if(mapp[len1-1][len2]!=i && mapp[len1-1][len2+1]!=i){
                return i;
            }
        }
        else{
            if(mapp[len1-1][len2]!=i && mapp[len1-1][len2+1]!=i && mapp[len1][len2-1]!=i && mapp[len1+1][len2-1]!=i){
                return i;
            }
        }
    }
}
void fill_in_c(int n,int m,int &c){//填满c
    int nn,mm,len1,len2;
    nn=n>>1<<1;
    mm=m>>1<<1;
    len1=0,len2=0;
    for(len1=0;len1+2<=nn&&c>0;len1+=2){
        for(len2=0;len2+2<=mm&&c>0;len2+=2){
            char ch;
            ch=Generating(len1,len2);
            mapp[len1][len2]=mapp[len1][len2+1]=mapp[len1+1][len2]=mapp[len1+1][len2+1]=ch;

            c--;
        }
    }
}
void fill_in_a(int n,int m,int &a){//填满a
    int nn,mm,len1,len2;
    nn=n>>1<<1;
    mm=m>>1<<1;
    len1=0,len2=0;
    for(len1=0;len1+2<=nn&&a>=2;len1+=2){
        for(len2=0;len2+2<=mm&&a>=2;len2+=2){
            if(mapp[len1][len2]!=0)continue;

            char ch;
            ch=Generating(len1,len2);
            mapp[len1][len2]=ch;
            mapp[len1][len2+1]=ch;

            ch=Generating(len1+1,len2);
            mapp[len1+1][len2]=ch;
            mapp[len1+1][len2+1]=ch;

            a-=2;
        }
    }
}
void fill_in_b(int n,int m,int &b){//填满b
    int nn,mm,len1,len2;
    nn=n>>1<<1;
    mm=m>>1<<1;
    len1=0,len2=0;
    for(len1=0;len1+2<=nn&&b>=2;len1+=2){
        for(len2=0;len2+2<=mm&&b>=2;len2+=2){
            if(mapp[len1][len2]!=0)continue;

            char ch;
            ch=Generating(len1,len2);
            mapp[len1][len2]=ch;
            mapp[len1+1][len2]=ch;

            ch=Generating(len1,len2+1);
            mapp[len1][len2+1]=ch;
            mapp[len1+1][len2+1]=ch;

            b-=2;
        }
    }
}
void fill_in_aa(int n,int m,int a){//用a填剩余 行(第n行)
    int len1,len2;
    len1=n-1,len2=0;
    for(len2=0;len2+2<=m&&a>=1;len2+=2){
        char ch;
        ch=Generating(len1,len2);
        mapp[len1][len2]=ch;
        mapp[len1][len2+1]=ch;
        a--;
    }
}
void fill_in_bb(int n,int m,int b){//用b填剩余 列(第m列)
    int len1,len2;
    len1=0,len2=m-1;
    for(len1=0;len1+2<=n&&b>=1;len1+=2){
        char ch;
        ch=Generating(len1,len2);
        mapp[len1][len2]=ch;
        mapp[len1+1][len2]=ch;
        b--;
    }
}
void judge_full(int n,int m){//判断是否填满
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(mapp[i][j]==0){
                printf("IMPOSSIBLE\n");
                return ;
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            printf("%c",mapp[i][j]);
        }
        printf("\n");
    }
}
int main(){
    int n,m,a,b,c,i,j,k;
    cin>>n>>m>>a>>b>>c;
    memset(mapp,0,sizeof(mapp));
    if(n%2==1&&m%2==1)printf("IMPOSSIBLE\n");
    else if(n*m>a*2+b*2+c*4)printf("IMPOSSIBLE\n");
    else{
            /**
            *a:1*2
            *b:2*1
            *c:2*2
            *
            */
        if(n%2==0&&m%2==0){//行数为偶，列数为偶
            /**
            *按c,a,b的顺序填入
            *
            *判断是否能填满
            */
            fill_in_c(n,m,c);
            fill_in_a(n,m,a);
            fill_in_b(n,m,b);

            judge_full(n,m);
        }
        else if(n%2==0&&m%2==1){//行数为偶，列数为奇
            /**
            *按c,a,b的顺序填入
            *将b填入剩余列
            *
            *在判断是否能填满
            *
            */
            fill_in_c(n,m,c);
            fill_in_a(n,m,a);
            fill_in_b(n,m,b);

            fill_in_bb(n,m,b);

            judge_full(n,m);
        }
        else if(n%2==1&&m%2==0){//行数为奇，列数为偶
            /**
            *按c,b,a的顺序填入
            *将a填入剩余列
            *
            *在判断是否能填满
            *
            */
            fill_in_c(n,m,c);
            fill_in_b(n,m,b);
            fill_in_a(n,m,a);

            fill_in_aa(n,m,a);

            judge_full(n,m);
        }

    }
    return 0;
}