結果
問題 | No.191 供託金 |
ユーザー | threepipes_s |
提出日時 | 2015-04-26 22:09:48 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,094 bytes |
コンパイル時間 | 2,788 ms |
コンパイル使用メモリ | 79,192 KB |
実行使用メモリ | 52,316 KB |
最終ジャッジ日時 | 2024-10-07 15:51:02 |
合計ジャッジ時間 | 4,479 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,284 KB |
testcase_01 | AC | 54 ms
50,232 KB |
testcase_02 | AC | 54 ms
49,820 KB |
testcase_03 | AC | 53 ms
50,136 KB |
testcase_04 | AC | 54 ms
50,188 KB |
testcase_05 | AC | 54 ms
49,928 KB |
testcase_06 | AC | 56 ms
49,944 KB |
testcase_07 | AC | 53 ms
50,416 KB |
testcase_08 | AC | 54 ms
49,956 KB |
testcase_09 | AC | 53 ms
50,332 KB |
testcase_10 | AC | 54 ms
50,308 KB |
testcase_11 | AC | 54 ms
50,376 KB |
testcase_12 | AC | 54 ms
50,440 KB |
testcase_13 | AC | 54 ms
50,272 KB |
testcase_14 | AC | 54 ms
50,212 KB |
testcase_15 | AC | 53 ms
50,156 KB |
testcase_16 | AC | 54 ms
50,372 KB |
testcase_17 | AC | 55 ms
50,364 KB |
testcase_18 | AC | 54 ms
52,316 KB |
testcase_19 | AC | 55 ms
50,180 KB |
testcase_20 | AC | 54 ms
50,152 KB |
testcase_21 | AC | 55 ms
50,328 KB |
testcase_22 | AC | 54 ms
50,484 KB |
testcase_23 | AC | 54 ms
50,380 KB |
testcase_24 | AC | 54 ms
50,340 KB |
testcase_25 | WA | - |
ソースコード
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.PriorityQueue; import java.util.Queue; public class Main { public static int[][] dist; public static int[][] distCp; public static int minId; public static void main(String[] args) throws NumberFormatException, IOException { ContestScanner in = new ContestScanner(); int n = in.nextInt(); int[] c = new int[n]; int sum = 0; for(int i=0; i<n; i++){ c[i] = in.nextInt(); sum += c[i]; } if(sum==0){ System.out.println(0); return; } int res = 0; for(int i=0; i<n; i++){ if((c[i]*100+(sum-1))/sum <= 10) res++; } System.out.println(res*30); } } class Node implements Comparable<Node>{ int id; HashSet<Node> edge = new HashSet<Node>(); public Node(int id) { this.id = id; } public void createEdge(Node node) { edge.add(node); } @Override public int compareTo(Node o) { // TODO 自動生成されたメソッド・スタブ return Main.distCp[Main.minId][id]-Main.distCp[Main.minId][o.id]; } } 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 String readLine() throws IOException{ return reader.readLine(); } 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()); } }