Submission #3074393


Source Code Expand

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

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

	vector< vector< char >  > A = vector< vector< char >  >(H, vector< char >(W) );
	
	for(int i = 0; i < H; i++)
	{
		
		for(int j = 0; j < W; j++)
		{
			cin >> A[i][j];
		}
		
	}

	
	vector<int> kaigyou(H);
	for(int i = 0; i < H; i++)
	{
		
		bool flag = false;
		for(int j = 0; j < W; j++)
		{
			if(A[i][j] == '#'){
				flag = true;
			}
		}

		if(flag==false){
			kaigyou[i] = 0;
			for(int j = 0; j < W; j++)
			{
				A[i][j] = '*';
			}
		}else{
			kaigyou[i] = 1;
		}
	}
	
	for(int i = 0; i < W; i++)
	{
		
		bool flag = false;
		for(int j = 0; j < H; j++)
		{
			if(A[j][i] == '#'){
				flag = true;
			}
		}

		if(flag==false){
			for(int j = 0; j < H; j++)
			{
				A[j][i] = '*';
			}
		}
	}

	
	for(int i = 0; i < H; i++)
	{

		for(int j = 0; j < W; j++)
		{
			if(A[i][j] != '*'){
				cout << A[i][j];
			}
		}
		if(kaigyou[i]==1){
			cout << endl;
		}
		
	}
	

	return 0;

}

Submission Info

Submission Time
Task B - Grid Compression
User yusan1871
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1070 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