UVa : 10849 (Move the bishop)



// http://uva.onlinejudge.org/external/108/10849.html
// Runtime : 0.016s
// Tag : Gotcha, Tricks

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL unsigned long long
using namespace std;

int main(int argc, char **argv) {
	int testCase;
	scanf ("%d", &testCase);

	while ( testCase-- ) {
		int dataset;
		scanf ("%d", &dataset);

		int n;
		scanf ("%d", &n);

		while ( dataset-- ) {
			int a [4];
			bool noMove = false;
			for ( int i = 0; i < 4; i++ ) {
				scanf ("%d", &a [i]);
				if ( a [i] < 1 || a [i] > n ) noMove = true;
			}

			if ( noMove ) { printf ("no move\n"); continue; }
			
			int diff1 = abs (a [0] - a [2]);
			int diff2 = abs (a [1] - a [3]);

			if ( a [0] == a [2] && a [1] == a [3] ) printf ("0\n");
			else if ( diff1 == diff2  ) printf ("1\n");
			else if ( diff1 % 2 == 0 && diff2 % 2 == 0 ) printf ("2\n");
			else if ( diff1 % 2 == 1 && diff2 % 2 == 1 ) printf ("2\n");
			else printf ("no move\n");
		}
	}

	return 0;
}

// @END_OF_SOURCE_CODE
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s