Submission #3076467


Source Code Expand

Copy
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;


int main(){
    int H,W;
    cin >> H >> W;
    vector< string > sv;
    VVI mv(H, VI(W,0));
    
    int minh,maxh,minw,maxw = 0;
    bool flg = true;
    FOR(i,0,H){
        string a;
        cin >> a;
        sv.push_back(a);
    }
    FOR(i,0,H){
        if( sv[i].find('#') == string::npos){
            FOR(j,0,W){
                mv[i][j] = 1;
            }
        }
    }

    FOR(j,0,W){
        bool tflg = true;
        FOR(i,0,H){
            if( sv[i].at(j)=='#')
                tflg = false;
        }
        if(tflg){
            FOR(i,0,H){
                mv[i][j] = 1;
            }
        }
    }
          
    FOR(i,0,H){
        bool tmp = false;
        FOR(j,0,W){
            if( mv[i][j] != 1 || sv[i].at(j) == '#'){
                cout << sv[i].at(j);
                tmp = true;
            }
        }
        if(tmp)cout << endl;
    }

    /* 
          FOR(j,0,W){
          FOR(i,0,H){
              if(minh <= i && maxh >= i
                 && minw <= j && maxw >= j )
                  cout << sv[i].at(j);
          }
          cout << endl;
      }    
     */
}

Submission Info

Submission Time
Task B - Grid Compression
User ria10
Language C++14 (GCC 5.4.1)
Score 200
Code Size 3051 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 12
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 2 ms 256 KB
1_02.txt AC 2 ms 256 KB
1_03.txt AC 2 ms 256 KB
1_04.txt AC 2 ms 256 KB
1_05.txt AC 2 ms 256 KB
1_06.txt AC 2 ms 256 KB
1_07.txt AC 2 ms 256 KB