Class（ACM ICPC 2008–2009, NEERC, Northern Subregional Contest）

ACM ICPC 2008–2009, NEERC, Northern Subregional Contest
St Petersburg, November 1, 2008
Problem C. Class
Input file: class.in
Output file: class.out
Time limit: 3 seconds
Memory limit: 256 megabytes
Dr. Strange is a really strange lecturer. Each lecture he calculates class fullness and if it is small, he
decreases all semester grades by one. So the students want to maximize the class fullness.
The class fullness is the minimum of row fullness and column fullness. The column fullness is the
maximum number of students in a single column and the row fullness is the maximum number of students
in a single row.
For example there are 16 students shown on the left picture (occupied desks are darkened). The row
fullness of this arrangement is 5 (the 4-th row) and the column fullness is 3 (the 1-st, the 3-rd, the 5-th or
the 6-th columns). So, the class fullness is 3. But if the students rearrange as shown on the right picture
then the column fullness will become 4 (the 5-th column), and so the class fullness will also become 4.
1
2
3
4
1
2
3
4
5
6
1
2
3
4
1
2
3
4
5
6
The students of Dr. Strange need to know the arrangement that maximizes class fullness so they ask
you to write a program that calculates it for them.
Input
The first line of the input file contains three integer numbers: n, r and c — number of students, rows
and columns in the class (1 ≤ r, c ≤ 100, 1 ≤ n ≤ r × c).
Output
The first line of the output file must contain a single integer number — the maximum possible class
fullness.
The following r lines must contain the optimal student arrangement. Each line must contain a description
of a single row. Row description is a line of c characters either ‘‘.’’ or ‘‘#’’, where ‘‘.’’ denotes an empty
desk, and ‘‘#’’ denotes an occupied one. If there are multiple optimal arrangements, output any one.
Example
class.in class.out
16 4 6 4
.####.
#..###
#...##
###.##

//
//  main.cpp
//  160929
//
//  Created by liuzhe on 17/3/30.
//  Copyright © 2016年 my_code. All rights reserved.
//
//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <list>
#include <bitset>
#include <stack>
using namespace std;
char s[105][105];
int main( )
{
    freopen("class.in","r",stdin);
    freopen("class.out","w",stdout);
    
    int n,m,a;
    while(cin>>a>>n>>m)
    {
        int t = min(n,m);
        int x = (a+1)>>1;
        t = min(t,x);
        cout<<t<<endl;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                s[i][j] = '.';
        for(int i=0,j=0;j<m&&j<t;j++)
        {
            if(a)
            {
                s[i][j] = '#';
                a--;
            }
        }
        if(a)
        {
            for(int j=0,i=0;i<n;i++)
            {
                if(a)
                {
                    if(s[i][j]!='#')
                    {
                        s[i][j] = '#';
                        a--;
                    }
                }
            }
        }
            for(int i=0;i<n;i++)
                for(int j=0;j<m;j++)
                {
                    if(a&&s[i][j]!='#')
                    {
                        a--;
                        s[i][j]='#';
                    }
                }
        for(int i=0;i<n;i++)
            cout<<s[i]<<endl;
        
    }
    return 0;
}