Submission #2107337

---

Source Code Expand

import sys

def main():
    # res = []
    inps = map(lambda s: s.strip(), sys.stdin.readlines())
    iid = 0
    r, c, n = map(int, inps[iid].split())
    iid += 1

    def boundary(x,y):
        if x==0 or y==0 or x==r or y==c:
            return True
        return False

    def downright(x, y):
        if x==0 or y==c:
            return True
        return False


    points = []
    dr = []
    ul = []
    for i in xrange(1,n+1):
        x1, y1, x2, y2 = map(int, inps[iid].split())
        iid += 1
        if boundary(x1, y1) and boundary(x2, y2):
            if downright(x1,y1):
                dr.append((x1,y1,i))
            else:
                ul.append((x1,y1,i))
            if downright(x2,y2):
                dr.append((x2,y2,i))
            else:
                ul.append((x2,y2,i))
    dr.sort()
    ul.sort(reverse=True)
    dr.extend(ul)
    # print dr
    stack = []
    for elem in dr:
        if len(stack)!=0 and stack[-1]==elem[2]:
            stack.pop()
        else:
            stack.append(elem[2])
    if len(stack)==0:
        print "YES"
    else:
        print "NO"

    # print '\n'.join(res)
if __name__ == '__main__':
    main()

Submission Info

Judge Result