Submission #11477381

---

Source Code Expand

#include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 10;

typedef struct {
	int x;
	int y;
	int w;
} Loc;

Loc loc [ maxn << 1 ];
int col , row , n;
int x_1 , y_1 , x_2 , y_2 , cnt;
stack < int > ss;

inline int read ( )
{
	int s = 0 , t = 1; char ch = getchar ( );
	while ( ch < '0' || ch > '9' ) { if ( ch == '-' ) t = -1; ch = getchar ( ); }
	while ( ch >= '0' && ch <= '9' ) { s = s * 10 + ch - '0'; ch = getchar ( ); }
	return s * t;
}

struct Rude1 {
	bool operator ( ) ( const Loc & s1 , const Loc & s2 ) const {
		return s1.x < s2.x;
	}
};

int cha ( int a , int b ) 
{
	if ( a == 0 ) return b;
	else if ( b == col ) return col + a;
	else if ( a == row ) return row + col + col - b;
	else if ( b == 0 ) return col * 2 + row * 2 - a;
	else return -1;
}

int main ( void )
{
	row = read ( ); col = read ( ); n = read ( );
	for ( int i = 0 ; i < n ; i++ ) {
		x_1 = read ( ); y_1 = read ( ); x_2 = read ( ); y_2 = read ( );
		int m = cha ( x_1 , y_1 ); int g = cha ( x_2 , y_2 );
		if ( m == -1 || g == -1 ) {
			continue;
		} 
		if ( m > g ) {
			swap ( m , g );
		}
		loc [ cnt ].w = 1;
		loc [ cnt ].x = m;
		loc [ cnt++ ].y = g;
		loc [ cnt ].w = 2;
		loc [ cnt ].x = g;
		loc [ cnt++ ].y = m;
		sort ( loc , loc + cnt , Rude1 ( ) );
		for ( int i = 0 ; i < cnt ; i++ ) {
			if ( loc [ i ].w == 1 ) {
				ss.push ( loc [ i ].y );
			} else if ( ss.top ( ) == loc [ i ].x ) {
				ss.pop ( );
			} else {
				puts ( "NO" );
				return 0;
			}
		}
	}
	puts ( "YES" );
	return 0;
}

Submission Info

Judge Result