結果

問題 No.77 レンガのピラミッド
ユーザー threepipes_sthreepipes_s
提出日時 2014-11-26 00:19:33
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,202 bytes
コンパイル時間 2,743 ms
コンパイル使用メモリ 87,228 KB
実行使用メモリ 37,164 KB
最終ジャッジ日時 2024-06-11 00:24:46
合計ジャッジ時間 5,135 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
36,668 KB
testcase_01 WA -
testcase_02 AC 55 ms
37,064 KB
testcase_03 AC 53 ms
36,676 KB
testcase_04 AC 55 ms
37,040 KB
testcase_05 AC 53 ms
36,780 KB
testcase_06 AC 57 ms
36,640 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 53 ms
36,804 KB
testcase_10 AC 53 ms
36,628 KB
testcase_11 AC 53 ms
36,900 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 53 ms
36,960 KB
testcase_16 AC 53 ms
36,804 KB
testcase_17 AC 54 ms
36,912 KB
testcase_18 WA -
testcase_19 AC 53 ms
36,816 KB
testcase_20 AC 53 ms
36,516 KB
testcase_21 AC 56 ms
36,632 KB
testcase_22 AC 54 ms
36,672 KB
testcase_23 AC 54 ms
36,836 KB
testcase_24 AC 59 ms
36,912 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[] r;
//	public static long[] buy;
//	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();
		int n = in.nextInt();
		int count = 0;
		int[] renga = new int[n];
		int rengaNum = 0;
		for(int i=0; i<n; i++){
			renga[i] = in.nextInt();
			rengaNum += renga[i];
		}
		int base = 0;
		for(int i=1; i<=100; i++){
			if(i*i >= rengaNum){
				base = i;
				break;
			}
		}
		
		base = base*2-1;
		int max = Math.min(base, n);
//		int subc = 0;
		for(int i=0; i<max; i++){
			if(i<base/2){
				int val = renga[i] - (i+1);
				if(val > 0) count += val;
			}else{
				int val = renga[i] - (base-i);
				if(val > 0)	count += val;
			}
		}
		if(base < n){
			for(int i=base; i<n; i++) count += renga[i];
		}
		else if(base > n){
			int subc = 0;
			int[] renga2 = new int[base];
			for(int i=0; i<n; i++){
				renga2[i] = renga[i];
			}
			for(int j=1; j<base; j++){
				for(int i=0; i<base/2; i++){
					if(i<j/2){
						int val = renga2[i] - (i+1);
						if(val > 0) subc += val;
					}else{
						int val = renga2[i] - (j-i);
						if(val > 0)	subc += val;
					}

				}
			}
			count = Math.min(count, subc);
				
		}
		
		
		
		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