結果
問題 | No.178 美しいWhitespace (1) |
ユーザー | threepipes_s |
提出日時 | 2015-04-05 23:24:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,678 bytes |
コンパイル時間 | 2,201 ms |
コンパイル使用メモリ | 74,728 KB |
実行使用メモリ | 51,756 KB |
最終ジャッジ日時 | 2023-09-17 04:38:18 |
合計ジャッジ時間 | 5,129 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,356 KB |
testcase_01 | AC | 44 ms
49,144 KB |
testcase_02 | AC | 45 ms
49,424 KB |
testcase_03 | AC | 43 ms
49,996 KB |
testcase_04 | AC | 83 ms
51,688 KB |
testcase_05 | AC | 69 ms
51,432 KB |
testcase_06 | AC | 80 ms
51,564 KB |
testcase_07 | AC | 69 ms
50,304 KB |
testcase_08 | AC | 69 ms
50,904 KB |
testcase_09 | AC | 80 ms
50,536 KB |
testcase_10 | AC | 68 ms
51,132 KB |
testcase_11 | AC | 71 ms
51,756 KB |
testcase_12 | AC | 80 ms
51,396 KB |
testcase_13 | AC | 79 ms
51,600 KB |
testcase_14 | AC | 80 ms
51,708 KB |
testcase_15 | AC | 79 ms
50,596 KB |
testcase_16 | AC | 79 ms
51,560 KB |
testcase_17 | AC | 71 ms
51,388 KB |
testcase_18 | AC | 69 ms
50,212 KB |
testcase_19 | AC | 79 ms
50,456 KB |
testcase_20 | AC | 79 ms
51,272 KB |
testcase_21 | AC | 79 ms
50,852 KB |
testcase_22 | AC | 73 ms
50,288 KB |
testcase_23 | AC | 80 ms
51,308 KB |
testcase_24 | AC | 70 ms
51,652 KB |
ソースコード
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.Comparator; import java.util.HashSet; import java.util.TreeSet; public class Main { public static void main(String[] args) throws NumberFormatException, IOException { ContestScanner in = new ContestScanner(); int n = in.nextInt(); int[] spaces = new int[n]; int max = 0; for(int i=0; i<n; i++){ int a = in.nextInt(); int b = in.nextInt(); spaces[i] = a + b*4; if(spaces[i] > max) max = spaces[i]; } long res = 0; for(int i=0; i<n; i++){ int dif = max - spaces[i]; if(dif%2 == 1){ System.out.println(-1); return; } res += dif/2; } System.out.println(res); } } class Node{ int id; HashSet<Node> edge = new HashSet<Node>(); public Node(int id) { this.id = id; } public void createEdge(Node node) { edge.add(node); } } class MyComp implements Comparator<int[]> { final int idx; public MyComp(int idx){ this.idx = idx; } public int compare(int[] a, int[] b) { return a[idx] - b[idx]; } } class Reverse implements Comparator<Integer> { public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } 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()); } }