Advertisement
Guest User

Untitled

a guest
Feb 28th, 2015
194
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.81 KB | None | 0 0
  1. import java.io.BufferedReader;
  2. import java.io.BufferedWriter;
  3. import java.io.FileReader;
  4. import java.io.FileWriter;
  5. import java.io.IOException;
  6. import java.io.PrintWriter;
  7. import java.util.StringTokenizer;
  8.  
  9. public class route{
  10. public static void main(String[] args) throws IOException{
  11. BufferedReader r = new BufferedReader(new FileReader("route.in"));
  12. PrintWriter w = new PrintWriter(new BufferedWriter(new FileWriter("route.out")));
  13.  
  14. StringTokenizer st = new StringTokenizer(r.readLine());
  15.  
  16. int A = Integer.parseInt(st.nextToken());
  17. int B = Integer.parseInt(st.nextToken());
  18. int N = Integer.parseInt(st.nextToken());
  19.  
  20. int totalcost = 1000000000;
  21. int checkpoints = 10000000;
  22.  
  23. int steps;
  24.  
  25. for(int i=0;i<N;i++){
  26. StringTokenizer st1 = new StringTokenizer(r.readLine());
  27. StringTokenizer st2 = new StringTokenizer(r.readLine());
  28. int cost = Integer.parseInt(st1.nextToken());
  29. steps = Integer.parseInt(st1.nextToken());
  30.  
  31. //System.out.println(st2.countTokens());
  32.  
  33. int[] cities = new int[steps];
  34. boolean check = false;
  35. int stops = 0;
  36.  
  37. for(int g=0; g < 3 ; i++){
  38.  
  39. //cities[g] = Integer.parseInt(st2.nextToken());
  40.  
  41. System.out.println(steps);
  42.  
  43. if(check == true){
  44. stops++;
  45. }
  46. if(cities[g] == A){
  47. check = true;
  48. stops++;
  49. }
  50. if(check == true && cities[g] == B){
  51. check = false;
  52. }
  53.  
  54. }
  55.  
  56. if(stops < checkpoints && cost < totalcost){
  57. totalcost = cost;
  58. checkpoints = stops;
  59. }
  60. }
  61.  
  62.  
  63. if(checkpoints==0){
  64. w.println(-1);
  65. } else{
  66. w.println(totalcost);
  67. }
  68. w.close();
  69. }
  70. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement