Submission #434339

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

#define HAI 1
#define LOW 2

int ww[5][4];
int hh[4][5];

int bd[5][5];

int main(){
	for ( int w = 0; w < 5; w++ )
		for ( int h = 0; h < 5; h++ )
		{
			int x;
			cin >> x;
			bd[w][h] = x;
		}

	int mujun = 0;
	for ( int w = 0; w < 5; w++ )
		for ( int h = 0; h < 4; h++ ){
			if ( bd[w][h] != 0 && bd[w][h + 1] != 0 ){
				if ( bd[w][h] < bd[w][h + 1] )
					ww[w][h] = HAI;
				else
					ww[w][h] = LOW;//三項演算子を容易に実現する命令セット
				for ( int h2 = h - 1; 0 <= h2; h2-- )
				{
					if ( ww[w][h2] != ww[w][h2 + 1] )mujun++;
					ww[w][h2] = ( ww[w][h2 + 1] == HAI ) ? LOW : HAI;
				}
				for ( int h2 = h + 1; h2 < 4; h2++ )
				{
					if ( ww[w][h2] != ww[w][h2 - 1] )mujun++;
					ww[w][h2] = ( ww[w][h2 - 1] == HAI ) ? LOW : HAI;
				}
			}
		}
	for ( int w = 0; w < 4; w++ )
		for ( int h = 0; h < 5; h++ ){
			if ( bd[w][h] != 0 && bd[w + 1][h] != 0 ){
				if ( bd[w][h] < bd[w + 1][h] )
					hh[w][h] = HAI;
				else
					hh[w][h] = LOW;
				for ( int w2 = w - 1; 0 <= w2; w2-- )
				{
					if ( ww[w2][h] != ww[w2 + 1][h] )mujun++;
					ww[w2][h] = ( ww[w2 + 1][h] == HAI ) ? LOW : HAI;
				}
				for ( int w2 = w + 1; w2 < 4; w2++ )
				{
					if ( ww[w2][h] != ww[w2 + 1][h] )mujun++;
					ww[w2][h] = ( ww[w2 + 1][h] == HAI ) ? LOW : HAI;
				}
			}
		}
//minaide
}

Submission Info

Judge Result