結果

問題 No.870 無敵囲い
ユーザー kitakitalilykitakitalily
提出日時 2019-08-30 21:27:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 43 ms / 300 ms
コード長 2,713 bytes
コンパイル時間 2,020 ms
コンパイル使用メモリ 73,932 KB
実行使用メモリ 49,524 KB
最終ジャッジ日時 2023-09-11 16:07:39
合計ジャッジ時間 3,750 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,056 KB
testcase_01 AC 42 ms
49,204 KB
testcase_02 AC 42 ms
48,844 KB
testcase_03 AC 41 ms
49,068 KB
testcase_04 AC 40 ms
49,220 KB
testcase_05 AC 41 ms
49,104 KB
testcase_06 AC 41 ms
48,996 KB
testcase_07 AC 41 ms
49,160 KB
testcase_08 AC 41 ms
49,028 KB
testcase_09 AC 40 ms
48,960 KB
testcase_10 AC 41 ms
49,168 KB
testcase_11 AC 41 ms
49,392 KB
testcase_12 AC 39 ms
49,172 KB
testcase_13 AC 40 ms
49,164 KB
testcase_14 AC 43 ms
48,980 KB
testcase_15 AC 41 ms
49,100 KB
testcase_16 AC 41 ms
49,152 KB
testcase_17 AC 41 ms
49,524 KB
testcase_18 AC 41 ms
49,172 KB
testcase_19 AC 40 ms
48,892 KB
testcase_20 AC 41 ms
49,124 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
 	public static void main(String[] args){
		FastScanner scanner = new FastScanner();
		int n = scanner.nextInt();
		int[] x1 = new int[n];
		int[] y1 = new int[n];
		int[] x2 = new int[n];
		int[] y2 = new int[n];

		for(int i = 0; i < n; i++){
			x1[i] = scanner.nextInt();
			y1[i] = scanner.nextInt();
			x2[i] = scanner.nextInt();
			y2[i] = scanner.nextInt();
		}
		int ax = 2; int ay = 8;
		int bx = 3; int by = 9;
		int cx = 7; int cy = 9;
		for(int i = 0; i < n; i++){
			if(x1[i] == ax && y1[i] == ay){
				ax = x2[i]; ay = y2[i];
			}
			if(x1[i] == bx && y1[i] == by){
				bx = x2[i]; by = y2[i];
			}
			if(x1[i] == cx && y1[i] == cy){
				cx = x2[i]; cy = y2[i];
			}
		}
		if(ax == 5 && ay == 8 && bx == 4 && by == 8 && cx == 6 && cy == 8){
			System.out.println("YES");
		}else{
			System.out.println("NO");
		}
	}

	private static class FastScanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;
		private boolean hasNextByte() {
				if (ptr < buflen) {
						return true;
				}else{
						ptr = 0;
						try {
								buflen = in.read(buffer);
						} catch (IOException e) {
								e.printStackTrace();
						}
						if (buflen <= 0) {
								return false;
						}
				}
				return true;
		}
		private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
		private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
		public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
		public String next() {
				if (!hasNext()) throw new NoSuchElementException();
				StringBuilder sb = new StringBuilder();
				int b = readByte();
				while(isPrintableChar(b)) {
						sb.appendCodePoint(b);
						b = readByte();
				}
				return sb.toString();
		}
		public long nextLong() {
				if (!hasNext()) throw new NoSuchElementException();
				long n = 0;
				boolean minus = false;
				int b = readByte();
				if (b == '-') {
						minus = true;
						b = readByte();
				}
				if (b < '0' || '9' < b) {
						throw new NumberFormatException();
				}
				while(true){
						if ('0' <= b && b <= '9') {
								n *= 10;
								n += b - '0';
						}else if(b == -1 || !isPrintableChar(b)){
								return minus ? -n : n;
						}else{
								throw new NumberFormatException();
						}
						b = readByte();
				}
		}
		public int nextInt() {
				long nl = nextLong();
				if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
				return (int) nl;
		}
		public double nextDouble() { return Double.parseDouble(next());}
	}
}
0