結果

問題 No.81 すべて足すだけの簡単なお仕事です。
ユーザー threepipes_sthreepipes_s
提出日時 2014-11-28 00:51:46
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,650 bytes
コンパイル時間 4,601 ms
コンパイル使用メモリ 92,416 KB
実行使用メモリ 55,172 KB
最終ジャッジ日時 2024-06-11 04:30:20
合計ジャッジ時間 9,021 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 163 ms
54,508 KB
testcase_01 AC 167 ms
54,740 KB
testcase_02 AC 173 ms
54,784 KB
testcase_03 WA -
testcase_04 AC 161 ms
54,776 KB
testcase_05 AC 160 ms
54,420 KB
testcase_06 AC 154 ms
54,900 KB
testcase_07 AC 155 ms
54,740 KB
testcase_08 AC 166 ms
55,128 KB
testcase_09 AC 159 ms
54,724 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 150 ms
54,776 KB
testcase_14 AC 150 ms
54,700 KB
testcase_15 AC 152 ms
54,656 KB
testcase_16 AC 150 ms
54,876 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 148 ms
54,588 KB
testcase_26 AC 160 ms
54,680 KB
testcase_27 WA -
testcase_28 AC 150 ms
54,544 KB
testcase_29 WA -
権限があれば一括ダウンロードができます

ソースコード

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.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 NodeW[] product;
	public static void main(String[] args) throws NumberFormatException, IOException{

		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		long res = 0;
		long under = 0;
		String line0;
		for(int i=0; i<n; i++){
			line0 = in.nextToken();
			String[] line = line0.split("\\.");
			long up = Long.parseLong(line[0]);
			long und = 0;
			for(int j=0; j<10; j++){
				if(line.length == 2 && j < line[1].length()) und += Long.parseLong(""+line[1].charAt(j));
				und *= 10;
			}
			und /= 10;
			if(line0.charAt(0)=='-'){
				res += up;
				under -= und;
			}else{
				res += up;
				under += und;
			}
		}
//		long sub = 0;
//		for(int j=0; j<10; j++){
//			sub += und
//		}
		if(under > 0 && res < 0){
			under = -under;
		}
		while(under >= 10000000000L){
			res += under / 10000000000L;
			under %= 10000000000L;
			
		}while(under < 0){
			res -= 1;
			under += 10000000000L;
		}
		
//		if(under > 0){
		System.out.println(res+"."+String.format("%010d", under));
//			}
//		else if(under == 0) System.out.println(res+"."+"0000000000");
//		else{
//			under = 10000000000L-under;
//			res -= 10000000000L;
//			System.out.println(res+"."+under);
//		}
		

	}
	
}
//class MyComp implements Comparator<int[]>{
//	public int compare(int[] a, int[] b) {
//		return Main.product[a[0]].dist - Main.product[b[0]].dist;
//	}
//}


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


class NodeW{
	int id;
//	int dist;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
//		node.setDist(dist+1);
	}
//	public void setDist(int dist){
//		this.dist = Math.max(this.dist, dist);
//		for(NodeW node: edge){
//			node.setDist(dist+1);
//		}
//	}
}

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 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