Submission #617972

---

Source Code Expand

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void dump(int[]a){for(int i=0;i<a.length;i++)System.out.print(a[i]+" ");System.out.println();};
	void dump(long[]a){for(int i=0;i<a.length;i++)System.out.print(a[i]+" ");System.out.println();};
	void dump(char[]a){for(int i=0;i<a.length;i++)System.out.print(a[i]);System.out.println();};
	void solve() throws NumberFormatException, IOException{
		final ContestScanner in = new ContestScanner();
		Writer out = new Writer();
		int n = in.nextInt();
		int m = in.nextInt();
		int st = in.nextInt();
		int dt = in.nextInt();
		List<Edge>[] node = new List[n];
		int[] dst = new int[n];
		for(int i=0; i<n; i++) node[i] = new ArrayList<>();
		int longest = 0;
		for(int i=0; i<m; i++){
			int l = in.nextInt();
			int[] s = new int[l];
			int[] w = new int[l-1];
			for(int j=0; j<l; j++){
				s[j] = in.nextInt();
			}
			int sum = 0;
			for(int j=0; j<l-1; j++){
				w[j] = in.nextInt();
				sum += w[j];
				node[s[j]].add(new Edge(s[j+1], w[j], s[0], sum));
			}
			sum = 0;
			for(int j=l-2; j>=0; j--){
				sum += w[j];
				node[s[j+1]].add(new Edge(s[j], w[j], s[l-1], sum));
			}
			longest = Math.max(longest, sum);
		}
		final int inf = Integer.MAX_VALUE;
		for(int i=0; i<n; i++) dst[i] = inf;
		Queue<P> qu0 = new PriorityQueue<>();
		dst[dt] = 0;
		qu0.add(new P(dt, 0));
		BitSet used = new BitSet(n);
		while(!qu0.isEmpty()){
			P p = qu0.poll();
			if(used.get(p.id)) continue;
			used.set(p.id);
			dst[p.id] = p.d;
			for(Edge e: node[p.id]){
				if(used.get(e.to)) continue;
				qu0.add(new P(e.to, p.d+e.d));
			}
		}
		used.clear();
		Queue<Pos> qu = new PriorityQueue<>();
		qu.add(new Pos(dt, 0, 0));
//		int[] maxd = new int[n];
//		int[] maxt = new int[n];
//		for(int i=0; i<n; i++){
//			maxd[i] = inf;
//			maxt[i] = inf;
//		}
		int ans = inf;
		while(!qu.isEmpty()){
			Pos p = qu.poll();
//			if(maxd[p.id]<=p.d && maxt[p.id]<=p.max) continue;
//			maxd[p.id] = p.d;
//			maxt[p.id] = p.max;
			if(used.get(p.id)) continue;
			used.set(p.id);
			if(p.id == st){
				ans = Math.min(ans, p.d);
				continue;
			}
			for(Edge e: node[p.id]){
				qu.add(new Pos(e.to, p.d+e.d, e.ld+dst[e.lst]));
			}
		}
		System.out.println(ans);
	}
}

class P implements Comparable<P>{
	int id, d;
	P(int id, int d){
		this.id = id;
		this.d = d;
	}
	@Override
	public int compareTo(P o) {
		return d-o.d;
	}
}
class Pos implements Comparable<Pos>{
	int id, d;
	Pos(int id, int d, int max){
		this.id = id;
		this.d = Math.max(d, max);
	}
	@Override
	public int compareTo(Pos o) {
		return d-o.d;
	}
}

class Edge{
	int to, d;
	int lst, ld;
	Edge(int to, int d, int lst, int ld){
		this.to = to;
		this.d = d;
		this.lst = lst;
		this.ld = ld;
	}
}

class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key)
	{final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
}
class Timer{
	long time;
	public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print()
	{System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner {
	private InputStreamReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new InputStreamReader(System.in);}
	public ContestScanner(String filename)throws IOException
	{in=new InputStreamReader(new FileInputStream(filename));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	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());}
}

Submission Info

Compile Error

Note: ./Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Judge Result