結果
問題 | No.216 FAC |
ユーザー | threepipes_s |
提出日時 | 2015-05-26 22:28:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 51 ms / 1,000 ms |
コード長 | 2,856 bytes |
コンパイル時間 | 2,530 ms |
コンパイル使用メモリ | 78,616 KB |
実行使用メモリ | 37,292 KB |
最終ジャッジ日時 | 2024-04-23 01:17:40 |
合計ジャッジ時間 | 4,113 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
36,944 KB |
testcase_01 | AC | 48 ms
37,092 KB |
testcase_02 | AC | 47 ms
37,160 KB |
testcase_03 | AC | 49 ms
37,164 KB |
testcase_04 | AC | 48 ms
37,112 KB |
testcase_05 | AC | 48 ms
37,144 KB |
testcase_06 | AC | 48 ms
37,116 KB |
testcase_07 | AC | 47 ms
36,732 KB |
testcase_08 | AC | 47 ms
37,292 KB |
testcase_09 | AC | 51 ms
37,288 KB |
testcase_10 | AC | 47 ms
37,292 KB |
testcase_11 | AC | 47 ms
36,904 KB |
testcase_12 | AC | 47 ms
36,832 KB |
testcase_13 | AC | 48 ms
37,292 KB |
testcase_14 | AC | 47 ms
37,196 KB |
testcase_15 | AC | 48 ms
37,272 KB |
testcase_16 | AC | 48 ms
37,292 KB |
testcase_17 | AC | 49 ms
36,804 KB |
testcase_18 | AC | 49 ms
37,096 KB |
testcase_19 | AC | 51 ms
37,132 KB |
testcase_20 | AC | 49 ms
36,908 KB |
testcase_21 | AC | 48 ms
36,836 KB |
testcase_22 | AC | 49 ms
37,200 KB |
testcase_23 | AC | 48 ms
37,196 KB |
testcase_24 | AC | 50 ms
37,156 KB |
testcase_25 | AC | 49 ms
37,156 KB |
testcase_26 | AC | 47 ms
37,148 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.ArrayList; import java.util.Comparator; 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[] a = new int[n]; int[] b = new int[n]; int[] point = new int[1000]; for(int i=0; i<n; i++){ a[i] = in.nextInt(); } int max = 0; for(int i=0; i<n; i++){ b[i] = in.nextInt(); point[b[i]] += a[i]; if(max < point[b[i]]) max = point[b[i]]; } if(max == point[0]) System.out.println("YES"); else System.out.println("NO"); } } class Node{ int id; ArrayList<Node> edge = new ArrayList<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 println(Object obj) { out.println(obj); } public void print(String str) { out.print(str); } public void print(Object obj) { out.print(obj); } 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()); } }