結果

問題 No.216 FAC
ユーザー threepipes_s
提出日時 2015-05-26 22:24:11
言語 Java
(openjdk 23)
結果
AC  
実行時間 57 ms / 1,000 ms
コード長 2,858 bytes
コンパイル時間 4,179 ms
コンパイル使用メモリ 78,376 KB
実行使用メモリ 37,256 KB
最終ジャッジ日時 2024-10-15 00:08:04
合計ジャッジ時間 6,584 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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[101];
        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());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0