結果

問題 No.497 入れ子の箱
ユーザー GrenacheGrenache
提出日時 2017-03-24 23:37:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 259 ms / 5,000 ms
コード長 6,160 bytes
コンパイル時間 3,315 ms
コンパイル使用メモリ 81,156 KB
実行使用メモリ 70,404 KB
最終ジャッジ日時 2024-07-06 01:14:40
合計ジャッジ時間 10,143 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
49,980 KB
testcase_01 AC 50 ms
50,144 KB
testcase_02 AC 48 ms
50,452 KB
testcase_03 AC 231 ms
67,964 KB
testcase_04 AC 242 ms
68,300 KB
testcase_05 AC 220 ms
69,032 KB
testcase_06 AC 232 ms
68,964 KB
testcase_07 AC 236 ms
70,220 KB
testcase_08 AC 234 ms
70,080 KB
testcase_09 AC 237 ms
70,012 KB
testcase_10 AC 259 ms
70,036 KB
testcase_11 AC 232 ms
70,404 KB
testcase_12 AC 193 ms
64,416 KB
testcase_13 AC 199 ms
63,860 KB
testcase_14 AC 203 ms
64,076 KB
testcase_15 AC 202 ms
64,160 KB
testcase_16 AC 201 ms
64,228 KB
testcase_17 AC 207 ms
64,140 KB
testcase_18 AC 218 ms
67,744 KB
testcase_19 AC 222 ms
67,544 KB
testcase_20 AC 225 ms
67,708 KB
testcase_21 AC 238 ms
67,684 KB
testcase_22 AC 235 ms
67,420 KB
testcase_23 AC 114 ms
53,144 KB
testcase_24 AC 123 ms
53,556 KB
testcase_25 AC 53 ms
50,400 KB
testcase_26 AC 53 ms
50,448 KB
testcase_27 AC 215 ms
64,436 KB
testcase_28 AC 212 ms
64,464 KB
testcase_29 AC 202 ms
64,548 KB
testcase_30 AC 130 ms
53,760 KB
testcase_31 AC 151 ms
54,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder497 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] x = new int[n];
		int[] y = new int[n];
		int[] z = new int[n];
		for (int i = 0; i < n; i++) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
			z[i] = sc.nextInt();
		}

		List<List<Edge>> edges = new ArrayList<>(n + 2);
		for (int i = 0; i < n + 2; i++) {
			edges.add(new ArrayList<>());
		}

		int sp = n;
		int ep = n + 1;
		for (int i = 0; i < n; i++) {
			edges.get(sp).add(new Edge(sp, i, 1));
			edges.get(i).add(new Edge(i, ep, 0));

			for (int j = i + 1; j < n; j++) {
				if ((x[i] < x[j] && y[i] < y[j] && z[i] < z[j])
						|| (x[i] < y[j] && y[i] < x[j] && z[i] < z[j])
						|| (x[i] < z[j] && y[i] < y[j] && z[i] < x[j])
						|| (x[i] < x[j] && y[i] < z[j] && z[i] < y[j])

						|| (x[i] < y[j] && y[i] < z[j] && z[i] < x[j])
						|| (x[i] < z[j] && y[i] < x[j] && z[i] < y[j])
						) {
					edges.get(i).add(new Edge(i, j, 1));
				} else if ((x[i] > x[j] && y[i] > y[j] && z[i] > z[j])
						|| (x[i] > y[j] && y[i] > x[j] && z[i] > z[j])
						|| (x[i] > z[j] && y[i] > y[j] && z[i] > x[j])
						|| (x[i] > x[j] && y[i] > z[j] && z[i] > y[j])

						|| (x[i] > y[j] && y[i] > z[j] && z[i] > x[j])
						|| (x[i] > z[j] && y[i] > x[j] && z[i] > y[j])
						) {
					edges.get(j).add(new Edge(j, i, 1));
				}
			}
		}

		n += 2;
		boolean[] used = new boolean[n];
		boolean[] gray = new boolean[n];

		List<Integer> ts = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			Deque<Integer> st = new ArrayDeque<>();
			st.push(i);
			while (!st.isEmpty()) {
				int e = st.peek();

				if (used[e]) {
					st.pop();
					continue;
				}

				if (gray[e]) {
					st.pop();
					used[e] = true;
					ts.add(e);
				} else {
					gray[e] = true;
					for (Edge next : edges.get(e)) {
						if (used[next.v]) {
							continue;
						}
						if (gray[next.v]) {
							// 後退辺
							continue;
						}

						st.push(next.v);
					}
				}
			}
		}

		Collections.reverse(ts);
		int[] d = new int[n + 2];
		for (int e : ts) {
			for (Edge next : edges.get(e)) {
				d[next.v] = Math.max(d[next.v], d[e] + next.w);
			}
		}

		pr.println(d[ep]);
	}

	private static class Edge {
		@SuppressWarnings("unused")
		int u; // from
		int v; // to
		int w; // cost

		Edge(int u, int v, int w) {
			this.u = u;
			this.v = v;
			this.w = w;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

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

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0