結果

問題 No.497 入れ子の箱
コンテスト
ユーザー hiromi_ayase
提出日時 2017-03-24 23:26:05
言語 Java
(openjdk 23)
結果
AC  
実行時間 187 ms / 5,000 ms
コード長 4,577 bytes
コンパイル時間 2,383 ms
コンパイル使用メモリ 78,592 KB
実行使用メモリ 61,168 KB
最終ジャッジ日時 2024-07-06 00:10:16
合計ジャッジ時間 7,186 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();

    int[][] d = sc.nextIntTable(N, 3);
    

    List<int[]> edge = new ArrayList<>();
    for (int i = 0; i < N; i ++) {
      for (int j = 0; j < N; j ++) {
        if (i == j) continue;
        
        if (check(d[i], d[j])) {
          edge.add(new int[]{j, i});
        }
      }
    }
    int n = edge.size();
    int[] from = new int[n];
    int[] to = new int[n];
    for (int i = 0; i < n; i ++) {
      from[i] = edge.get(i)[0];
      to[i] = edge.get(i)[1];
    }

    memo = new int[N];
    int[][] g = packD(N ,from, to);
    
    int ans = 0;
    for (int i = 0; i < N; i ++) {
      ans = Math.max(ans, dfs(i, g));
    }
    System.out.println(ans);
  }
  
  private static boolean check(int[] a, int[] b) {
    if (a[0] < b[0] && a[1] < b[1] && a[2] < b[2]) {
      return true;
    }
    if (a[0] < b[0] && a[1] < b[2] && a[2] < b[1]) {
      return true;
    }
    if (a[0] < b[1] && a[1] < b[2] && a[2] < b[0]) {
      return true;
    }
    if (a[0] < b[2] && a[1] < b[0] && a[2] < b[1]) {
      return true;
    }
    if (a[0] < b[1] && a[1] < b[0] && a[2] < b[2]) {
      return true;
    }
    if (a[0] < b[2] && a[1] < b[1] && a[2] < b[0]) {
      return true;
    }
    return false;
  }
  
  private static int[] memo;
  private static int dfs(int now, int[][] graph) {
    if (memo[now] > 0) {
      return memo[now];
    }

    int max = 0;
    for (int v : graph[now]) {
      max = Math.max(max, dfs(v, graph));
    }
    
    int ret = max + 1;
    memo[now] = ret;
    return ret;
  }

  public static int[][] packD(int n, int[] from, int[] to)
  {
      int[][] g = new int[n][];
      int[] p = new int[n];
      for(int f : from)p[f]++;
      for(int i = 0;i < n;i++)g[i] = new int[p[i]];
      for(int i = 0;i < from.length;i++){
          g[from[i]][--p[from[i]]] = to[i];
      }
      return g;
  }
}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else 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;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		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() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0