結果

問題 No.629 グラフの中に眠る門松列
ユーザー holegumaholeguma
提出日時 2019-07-17 19:33:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 88 ms / 4,000 ms
コード長 3,839 bytes
コンパイル時間 2,256 ms
コンパイル使用メモリ 81,628 KB
実行使用メモリ 39,012 KB
最終ジャッジ日時 2024-06-02 08:49:12
合計ジャッジ時間 5,809 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
36,720 KB
testcase_01 AC 46 ms
36,652 KB
testcase_02 AC 46 ms
36,964 KB
testcase_03 AC 46 ms
36,992 KB
testcase_04 AC 48 ms
36,784 KB
testcase_05 AC 48 ms
36,508 KB
testcase_06 AC 46 ms
36,852 KB
testcase_07 AC 47 ms
37,016 KB
testcase_08 AC 44 ms
36,924 KB
testcase_09 AC 46 ms
36,936 KB
testcase_10 AC 47 ms
36,840 KB
testcase_11 AC 49 ms
36,752 KB
testcase_12 AC 48 ms
37,028 KB
testcase_13 AC 47 ms
36,720 KB
testcase_14 AC 46 ms
36,840 KB
testcase_15 AC 46 ms
36,836 KB
testcase_16 AC 47 ms
36,984 KB
testcase_17 AC 48 ms
36,812 KB
testcase_18 AC 48 ms
36,788 KB
testcase_19 AC 47 ms
37,060 KB
testcase_20 AC 47 ms
36,864 KB
testcase_21 AC 84 ms
38,404 KB
testcase_22 AC 48 ms
37,032 KB
testcase_23 AC 83 ms
38,888 KB
testcase_24 AC 52 ms
37,080 KB
testcase_25 AC 85 ms
38,556 KB
testcase_26 AC 88 ms
39,012 KB
testcase_27 AC 65 ms
37,408 KB
testcase_28 AC 48 ms
36,980 KB
testcase_29 AC 52 ms
36,652 KB
testcase_30 AC 65 ms
37,368 KB
testcase_31 AC 65 ms
37,544 KB
testcase_32 AC 59 ms
36,872 KB
testcase_33 AC 68 ms
37,548 KB
testcase_34 AC 54 ms
36,884 KB
testcase_35 AC 53 ms
36,784 KB
testcase_36 AC 57 ms
36,748 KB
testcase_37 AC 60 ms
37,044 KB
testcase_38 AC 60 ms
37,164 KB
testcase_39 AC 54 ms
36,992 KB
testcase_40 AC 53 ms
36,652 KB
testcase_41 AC 51 ms
36,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		int n = ir.nextInt();
		int m = ir.nextInt();
		Graph[] g = new Graph[n];
		for (int i = 0; i < n; i++) {
			g[i] = new Graph();
		}
		int[] a = ir.nextIntArray(n);
		for (int i = 0; i < m; i++) {
			int u = ir.nextInt() - 1;
			int v = ir.nextInt() - 1;
			g[u].add(v);
			g[v].add(u);
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < g[i].size(); j++) {
				for (int k = j + 1; k < g[i].size(); k++) {
					if (isKadomatsu(a[g[i].get(j)], a[i], a[g[i].get(k)])) {
						out.println("YES");
						return;
					}
				}
			}
		}
		out.println("NO");
	}

	static boolean isKadomatsu(int a, int b, int c) {
		if (a == b || b == c || c == a) {
			return false;
		}
		return (a < b && b > c) || (a > b && b < c);
	}

	static class Graph extends ArrayList<Integer> {
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}
0