結果

問題 No.165 四角で囲え！
ユーザー uwi
提出日時 2015-03-12 23:34:47
言語 Java
(openjdk 23)
結果
AC  
実行時間 477 ms / 5,000 ms
コード長 4,690 bytes
コンパイル時間 7,096 ms
コンパイル使用メモリ 84,532 KB
実行使用メモリ 40,836 KB
最終ジャッジ日時 2024-12-26 03:13:04
合計ジャッジ時間 10,793 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q2xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q264 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), B = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = na(3);
			co[i][0] += 1000000000;
			co[i][1] += 1000000000;
		}
		shrinkXI(co, new int[]{0});
		shrinkXI(co, new int[]{1});
		int[][] sum = new int[n+1][n+1];
		int[][] num = new int[n+1][n+1];
		for(int i = 0;i < n;i++){
			sum[co[i][0]+1][co[i][1]+1] += co[i][2];
			num[co[i][0]+1][co[i][1]+1]++;
		}
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				sum[i][j] += sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1];
				num[i][j] += num[i-1][j] + num[i][j-1] - num[i-1][j-1];
			}
		}
		
		int ret = 0;
		for(int i = 0;i <= n;i++){
			for(int j = i+1;j <= n;j++){
				int l = 0;
				for(int k = 0;k <= n;k++){
					while(l <= k && sum[j][k]-sum[i][k]-sum[j][l]+sum[i][l] > B){
						l++;
					}
					ret = Math.max(ret, num[j][k]-num[i][k]-num[j][l]+num[i][l]);
				}
			}
		}
		out.println(ret);
	}

	public static int[] shrinkXI(int[][] co, int[] dim)
	{
		int n = co.length;
		int m = dim.length;
		int p = 0;
		long[] b = new long[n*m];
		for(int i = 0;i < n;i++){
			for(int v : dim){
				b[p] = (long)co[i][v]<<32|p; p++;
			}
		}
		Arrays.sort(b);
		
		int[] interval = new int[n*m];
		p = 0;
		for(int i = 0;i < n*m;i++){
			if(i > 0 && b[i]>>>32 > b[i-1]>>>32){
				interval[p] = (int)((b[i]>>>32) - (b[i-1]>>>32));
				p++;
			}
			int ind = (int)b[i];
			co[ind/m][dim[ind%m]] = p;
		}
		return Arrays.copyOf(interval, p);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0