Submission #19261204

---

Source Code Expand

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

public class Main {

	static long mod = 1000000007;

	public static void main(String[] args) {
		FastScanner sc = new FastScanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();

		int[] a = new int[n], b = new int[n], c = new int[n], w = new int[n];
		for(int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
			b[i] = sc.nextInt();
			c[i] = sc.nextInt();
			w[i] = sc.nextInt();
		}

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

		int[][][] dp = new int[101][101][101];
		for(int i = 0; i < n; i++) {
			dp[a[i]][b[i]][c[i]] = Math.max(dp[a[i]][b[i]][c[i]],w[i]);
		}

		for(int i = 0; i < 101; i++) {
			for(int j = 0; j < 101; j++) {
				for(int k = 0; k < 101; k++) {
					int tmp = dp[i][j][k];

					if(i != 0) {
						tmp = Math.max(tmp, dp[i-1][j][k]);
					}
					if(j != 0) {
						tmp = Math.max(tmp, dp[i][j-1][k]);
					}
					if(k != 0) {
						tmp = Math.max(tmp, dp[i][j][k-1]);
					}

					dp[i][j][k] = tmp;
				}
			}
		}

		for(int i = 0; i < m; i++) {
			System.out.println(dp[x[i]][y[i]][z[i]]);
		}


	}

}



class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in2) {
		// TODO 自動生成されたコンストラクター・スタブ
	}
	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());}
}

Submission Info

Judge Result