結果

問題 No.30 たこやき工場
ユーザー threepipes_sthreepipes_s
提出日時 2014-11-26 02:54:39
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,671 bytes
コンパイル時間 3,149 ms
コンパイル使用メモリ 87,812 KB
実行使用メモリ 39,028 KB
最終ジャッジ日時 2024-06-11 03:58:57
合計ジャッジ時間 3,793 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
37,144 KB
testcase_01 AC 43 ms
37,048 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 46 ms
37,312 KB
testcase_09 AC 49 ms
37,176 KB
testcase_10 AC 86 ms
39,028 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 51 ms
37,008 KB
testcase_16 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.TreeSet;
public class Main {
	public static int w;
	public static int k;
	public static int n;
//	public static int[][] dp;
	public static int[] r;
	public static long[] buy;
	public static List<double[]> list = new ArrayList<double[]>();
	public static TreeSet<Integer> set = new TreeSet<Integer>();
//	public static PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
	public static void main(String[] args) throws NumberFormatException, IOException{

		ContestScanner in = new ContestScanner();
		n = in.nextInt();
		int m = in.nextInt();
//		int[] p = new int[m];
//		int[] q = new int[m];
//		r = new int[m];
		int[][] pqr = new int[m][3];
		int[] need = new int[n];
		buy = new long[n];
//		NodeW[] product = new NodeW[n];
//		for(int i=0; i<n; i++){
//			product[i] = new NodeW(i);
//		}
		for(int i=0; i<m; i++){
			pqr[i][1] = in.nextInt()-1; // p:1
			pqr[i][2] = in.nextInt(); // q:2
			pqr[i][0] = in.nextInt()-1; // r:0
			buy[pqr[i][0]] = -1;
//			product[r[i]-1].createEdge(product[p[i]-1], q[i]);
		}
//		dfs(product[n-1], 1);
		Arrays.sort(pqr, new MyComp());
		need[n-1] = 1;
		for(int i=0; i<m; i++){
			need[pqr[i][1]] += pqr[i][2]*need[pqr[i][0]];
		}
		for(int i=0; i<n-1; i++){
			if(buy[i] != -1) System.out.println(need[i]);
			else System.out.println(0);
		}

	}
	
//	public static void dfs(NodeW head, long times){
//		if(head.edge.size() == 0){
//			buy[head.id] += times;
//			return;
//		}
//		int size = head.edge.size();
//		for(int i=0; i<size; i++){
//			dfs(head.edge.get(i), times*head.costList.get(i));
//		}
//	}
	
}
class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return b[0] - a[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg0 - arg1;
	}
}


class NodeW{
	int id;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		System.err.println("Don't use this func");
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}

class MyMath{
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	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());
	}
}
0