結果

問題 No.33 アメーバがたくさん
ユーザー threepipes_sthreepipes_s
提出日時 2014-11-25 20:49:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 5,000 ms
コード長 4,950 bytes
コンパイル時間 2,679 ms
コンパイル使用メモリ 94,304 KB
実行使用メモリ 50,556 KB
最終ジャッジ日時 2024-09-24 10:00:19
合計ジャッジ時間 3,705 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,324 KB
testcase_01 AC 53 ms
50,408 KB
testcase_02 AC 53 ms
50,072 KB
testcase_03 AC 54 ms
50,220 KB
testcase_04 AC 55 ms
50,512 KB
testcase_05 AC 54 ms
50,556 KB
testcase_06 AC 54 ms
50,476 KB
testcase_07 AC 54 ms
50,456 KB
testcase_08 AC 54 ms
50,440 KB
testcase_09 AC 54 ms
50,436 KB
testcase_10 AC 53 ms
50,268 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.TreeSet;
public class Main {
	public static int w;
	public static int k;
	public static int n;
//	public static int[][] dp;
	public static int[] a;
	public static int[] b;
	public static List<double[]> list = new ArrayList<double[]>();
	public static TreeSet<Integer> set = new TreeSet<Integer>();
//	public static PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
	public static void main(String[] args) throws NumberFormatException, IOException{

		ContestScanner in = new ContestScanner();
		n = in.nextInt();
		long d = in.nextLong();
		long t = in.nextLong();
		HashMap<Long, HashSet<Long>> set = new HashMap<Long, HashSet<Long>>();
		for(int i=0; i<n; i++){
			long x = in.nextLong();
			long mod = x%d;
			long div = x/d;
			if(mod < 0){
				mod += d;
				div--;
			}
			if(!set.containsKey(mod)){
				HashSet<Long> sub = new HashSet<Long>();
				sub.add(div);
				set.put(mod, sub);
			}else{
				HashSet<Long> sub = set.get(mod);
				sub.add(div);
			}
		}
		long count = 0;
		for(HashSet<Long> list: set.values()){
			if(list.size() > 1){
				RangeSet<Long> rset = new RangeSet<Long>();
				for(Long val: list){
					rset.add(new Range<Long>(val-t, val+t));
				}
				for(Range<Long> rng: rset.ranges){
					count += rng.end - rng.start + 1;
				}
			}
			else{
				count += 2*t+1;
			}
		}
		System.out.println(count);
	}
	
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


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 MyMath{
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}
}

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

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	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