3260028_re.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main 
{

	public static void main(String[] args)
	{
		new Main().run();
	}
	
	class TPoint implements Comparable <TPoint>
	{
		String x, y;
		
		public TPoint(String x,String y)
		{
			this.x = x;
			this.y = y;
		}
		
		public int compareTo(TPoint that)
		{
			int vx = this.x.compareTo(that.x);
			int vy = this.y.compareTo(that.y);

			return vx == 0 ? vy : vx;
		}
	}
	
	private void run()
	{
		TreeMap <TPoint, Integer> hash = new TreeMap <TPoint, Integer> ();
		int k, index;
		int [] degree;
		TPoint p;
		String [] cor = new String [4];
		Scanner in = new Scanner (System.in);
		
		index = 0;
		k = in.nextInt();
		degree = new int [k*4+1];
		for(int i = 0; i < k; i++)
		{
			cor[0] = in.next();
			cor[1] = in.next();
			cor[2] = in.next();
			cor[3] = in.next();
			for(int j = 0; j < 4; j++)
			{
				cor[j] = modify(cor[j]);
			}
			p = new TPoint (cor[0],cor[1]);
			Integer id;
			if((id = hash.get(p))!=null)
			{
				degree[id]++;
			}
			else
			{
				degree[index]++;
				hash.put(p, new Integer(index));
				index++;
			}
			p = new TPoint (cor[2],cor[3]);
			if((id = hash.get(p))!=null)
			{
				degree[id]++;
			}
			else
			{
				degree[index]++;
				hash.put(p, new Integer(index));
				index++;
			}
		}
		for(int i = 0; i < index; i++)
		{
			if(degree[i]%2!=0)
			{
				System.out.println("0");
				return ;
			}
		}
		System.out.println("1");
	}
	
	public String modify(String str)
	{
		int j;
		int len = str.length();
		
		for(j = 0; j < len-1; j++)
		{
			if(str.charAt(j)!='0')
			{
				break;
			}
		}
		return str.substring(j);
	}

}