Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.BufferedWriter;
- import java.io.FileReader;
- import java.io.FileWriter;
- import java.io.IOException;
- import java.io.PrintWriter;
- import java.util.StringTokenizer;
- public class route{
- public static void main(String[] args) throws IOException{
- BufferedReader r = new BufferedReader(new FileReader("route.in"));
- PrintWriter w = new PrintWriter(new BufferedWriter(new FileWriter("route.out")));
- StringTokenizer st = new StringTokenizer(r.readLine());
- int A = Integer.parseInt(st.nextToken());
- int B = Integer.parseInt(st.nextToken());
- int N = Integer.parseInt(st.nextToken());
- int totalcost = 1000000000;
- int checkpoints = 10000000;
- int steps;
- for(int i=0;i<N;i++){
- StringTokenizer st1 = new StringTokenizer(r.readLine());
- StringTokenizer st2 = new StringTokenizer(r.readLine());
- int cost = Integer.parseInt(st1.nextToken());
- steps = Integer.parseInt(st1.nextToken());
- //System.out.println(st2.countTokens());
- int[] cities = new int[steps];
- boolean check = false;
- int stops = 0;
- for(int g=0; g < 3 ; i++){
- //cities[g] = Integer.parseInt(st2.nextToken());
- System.out.println(steps);
- if(check == true){
- stops++;
- }
- if(cities[g] == A){
- check = true;
- stops++;
- }
- if(check == true && cities[g] == B){
- check = false;
- }
- }
- if(stops < checkpoints && cost < totalcost){
- totalcost = cost;
- checkpoints = stops;
- }
- }
- if(checkpoints==0){
- w.println(-1);
- } else{
- w.println(totalcost);
- }
- w.close();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement