結果

問題 No.165 四角で囲え！
ユーザー threepipes_sthreepipes_s
提出日時 2015-03-26 00:42:01
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,687 bytes
コンパイル時間 2,563 ms
コンパイル使用メモリ 80,236 KB
実行使用メモリ 54,780 KB
最終ジャッジ日時 2024-06-29 01:06:21
合計ジャッジ時間 59,695 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 51 ms
36,600 KB
testcase_03 AC 50 ms
36,848 KB
testcase_04 AC 52 ms
36,900 KB
testcase_05 WA -
testcase_06 AC 461 ms
53,972 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 55 ms
50,256 KB
testcase_10 AC 55 ms
50,276 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 3,199 ms
53,192 KB
testcase_15 WA -
testcase_16 TLE -
testcase_17 AC 4,729 ms
53,872 KB
testcase_18 AC 300 ms
51,728 KB
testcase_19 TLE -
testcase_20 TLE -
testcase_21 AC 4,551 ms
53,644 KB
testcase_22 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		int b = in.nextInt();
		long[][] p = new long[n][3];
		for(int i=0; i<n; i++){
			p[i][0] = in.nextLong();
			p[i][1] = in.nextLong();
			p[i][2] = in.nextLong();
		}
		int res = 0;
		for(int i=0; i<n; i++){
			if(p[i][2] <= b){
				res = 1;
				break;
			}
		}
		Arrays.sort(p, new MyComp1());
		for(int i=0; i<n-1; i++){
			for(int j=i+1; j<n; j++){
				long xmax = Math.max(p[i][0], p[j][0]);
				long xmin = Math.min(p[i][0], p[j][0]);
				int minIdx = 0;
				while(minIdx < n && (p[minIdx][0] < xmin || xmax < p[minIdx][0] || p[minIdx][2] > b)){
					minIdx++;
				}
				if(minIdx >= n) continue;
				int maxIdx = minIdx;
				long nowPoint = p[minIdx][2];
				while(minIdx < n){
					long point = 0;
					int count = 0;
					int max = maxIdx<n?maxIdx:n-1;
					for(int k=minIdx; k<=max; k++){
						if(p[k][0] < xmin || xmax < p[k][0]) continue;
						point += p[k][2];
						count++;
					}
					if(point <= b && count > res){
//						System.out.println("xmax:"+xmax+"\txmin:"+xmin+"\tymax:"+maxIdx+"\tymin:"+minIdx+"\tcount:"+count);
//						if(count == 8)
//							System.out.println(count);
						res = count;
					}
					
					if(maxIdx >= n) break;
					maxIdx++;
					while(maxIdx < n && (p[maxIdx][0] < xmin || xmax < p[maxIdx][0])) maxIdx++;
					if(maxIdx < n) nowPoint += p[maxIdx][2];
					while(maxIdx < n-1 && p[maxIdx][1] == p[maxIdx+1][1]){
						maxIdx++;
						nowPoint += p[maxIdx][2];
					}
					while(minIdx < maxIdx && nowPoint > b){
						minIdx++;
						nowPoint -= p[minIdx][2];
					}
					while(minIdx < n-1 && p[minIdx][1] == p[minIdx+1][1]){
						minIdx++;
						nowPoint -= p[minIdx][2];
					}
					
//					if(maxIdx < n-1){
//						do{
//							while(maxIdx < n && (p[maxIdx][0] < xmin || xmax < p[maxIdx][0] || maxIdx == minIdx)){
//								maxIdx++;
//							}
//							if(maxIdx < n) nowPoint += p[maxIdx][2];
//						}while(maxIdx < n-1 && p[maxIdx][1] == p[maxIdx+1][1]);
//					}else if(nowPoint <= b) break;
//					minIdx++;
//					while(minIdx < maxIdx && (nowPoint > b || (minIdx < n-1 && p[minIdx][1] == p[minIdx+1][1]))){
//						minIdx++;
//						if(p[minIdx][0] < xmin || xmax < p[minIdx][0]) continue;
//						nowPoint -= p[minIdx][2];
//					}
				}
			}
		}
		System.out.println(res);
	}
}

class MyComp0 implements Comparator<int[]> {
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}

class MyComp1 implements Comparator<long[]> {
	public int compare(long[] a, long[] b) {
		return Long.compare(a[1], b[1]);
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node {
	int id;
	List<Node> edge = new ArrayList<Node>();

	public Node(int id) {
		this.id = id;
	}

	public void createEdge(Node node) {
		edge.add(node);
	}
}

class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0