Submission #3074458


Source Code Expand

Copy
#include <iostream>
#include <string>
using namespace std;

char c[100][100];

int rowFilled[100];
int colFilled[100];

int main(){
  int H,W;
  cin >> H >> W;

  for (int i = 0; i < H; ++i) {
    for (int j = 0; j < W; ++j) {
      cin >>c[i][j];
      if(c[i][j]=='#'){
        rowFilled[j] = 1;
        colFilled[i] = 1;
      }
    }
  }


  for (int i = 0; i < H; ++i) {
    if(colFilled[i]==0) {
      continue;
    }

    for (int j = 0; j < W; ++j) {
      if(rowFilled[j]==1) {
        cout << c[i][j];
      }
    }
    puts("");

  }

  return 0;
}

Submission Info

Submission Time
Task B - Grid Compression
User lizaf
Language C++14 (Clang 3.8.0)
Score 200
Code Size 598 Byte
Status AC
Exec Time 4 ms
Memory 888 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 4 ms 888 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 3 ms 256 KB
1_03.txt AC 3 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