結果

問題 No.216 FAC
ユーザー threepipes_sthreepipes_s
提出日時 2015-05-26 22:24:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 43 ms / 1,000 ms
コード長 2,858 bytes
コンパイル時間 2,155 ms
コンパイル使用メモリ 75,056 KB
実行使用メモリ 49,652 KB
最終ジャッジ日時 2023-08-05 02:14:16
合計ジャッジ時間 4,425 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,652 KB
testcase_01 AC 41 ms
49,296 KB
testcase_02 AC 41 ms
49,532 KB
testcase_03 AC 43 ms
49,532 KB
testcase_04 AC 42 ms
49,444 KB
testcase_05 AC 41 ms
49,628 KB
testcase_06 AC 40 ms
49,520 KB
testcase_07 AC 42 ms
49,196 KB
testcase_08 AC 40 ms
49,480 KB
testcase_09 AC 41 ms
49,268 KB
testcase_10 AC 42 ms
49,328 KB
testcase_11 AC 41 ms
49,316 KB
testcase_12 AC 41 ms
49,440 KB
testcase_13 AC 41 ms
49,576 KB
testcase_14 AC 43 ms
49,368 KB
testcase_15 AC 41 ms
49,636 KB
testcase_16 AC 43 ms
49,328 KB
testcase_17 AC 42 ms
49,428 KB
testcase_18 AC 42 ms
49,508 KB
testcase_19 AC 43 ms
47,628 KB
testcase_20 AC 43 ms
49,328 KB
testcase_21 AC 42 ms
47,528 KB
testcase_22 AC 43 ms
49,596 KB
testcase_23 AC 42 ms
49,368 KB
testcase_24 AC 43 ms
49,460 KB
testcase_25 AC 43 ms
49,464 KB
testcase_26 AC 40 ms
49,444 KB
権限があれば一括ダウンロードができます

ソースコード

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());
	}
}
0