Source code for submission s1111

Go to diff to previous submission

ants.java

  1. /*
  2.  * To change this template, choose Tools | Templates
  3.  * and open the template in the editor.
  4.  */
  5.  
  6. /**
  7.  *
  8.  * @author cteam040
  9.  */
  10. import java.util.*;
  11. import java.io.*;
  12.  
  13. public class ants 
  14. {
  15. 	public static void main(String[] s) throws Exception
  16. 	{
  19. 		String ln;
  20. 		while((ln=br.readLine())!=null)
  21. 		{
  22. 			st = new StringTokenizer(ln);
  23.                         boolean maxright=false,maxleft = true;
  24.  
  25. 			List<Integer> pp = new ArrayList<Integer>(2);
  26. 			final int len = Integer.parseInt(st.nextToken());
  27. 			int mrav = Integer.parseInt(st.nextToken());
  28.                         List<Ant> ants = new ArrayList<Ant>(mrav);
  29. 			int maxdist = -1;
  30. 			for(int i=0;i<mrav;i++)
  31. 			{
  32. 				st = new StringTokenizer(br.readLine());
  33.                                 int apos = Integer.parseInt(st.nextToken());
  34.                                 int dist = -1;
  35.                                 boolean left = false;
  36.                                 if("R".equals(st.nextToken()))
  37.                                 {
  38.                                     dist = len-apos;
  39.                                     left = false;
  40.                                     ants.add(new Ant(apos,false,dist));
  41.                                 }
  42.                                 else
  43.                                 {
  44.                                     dist = apos;
  45.                                     left = true;
  46.                                     ants.add(new Ant(apos,true,dist));
  47.                                 }
  48.                                 if(dist>maxdist)
  49.                                 {
  50.                                     pp.clear();
  51.                                     maxleft = false;
  52.                                     maxright = false;
  53.                                     maxdist = dist;
  54.                                 }
  55.                                 if(dist==maxdist)
  56.                                 {
  57.                                     if(left) maxleft = true;
  58.                                     else maxright = true;
  59.                                     pp.add(apos);
  60.                                 }
  61. 			}
  62.                         Collections.sort(ants, new Comparator<Ant>(){
  63.  
  64.                                 public int compare(Ant arg0, Ant arg1) {
  65.                                     return arg0.apos-arg1.apos;
  66.                                 }
  67.                             });
  68.  
  69.                         boolean ordered = true;
  70.                         int itcnt = 0;
  71.                         do
  72.                         {
  73.                             ordered = true;
  74.  
  75.                             for(int i=0;i<mrav-1;i++)
  76.                             {
  77.                                 if(ants.get(i).goesleft)
  78.                                     continue;
  79.                                 // assert goes right*/
  80.                                 for(int j=i+1;j<mrav;j++)
  81.                                 {
  82.                                     itcnt ++;
  83.                                     if(!ants.get(j-1).goesleft && ants.get(j).goesleft)
  84.                                     {
  85.                                         ordered = false;
  86.                                         ants.get(j-1).goesleft = true;
  87.                                         ants.get(j).goesleft = false;
  88.                                     }
  89.                                 }
  90.                             }
  91.                         }while(!ordered);
  92.                        // System.out.println(itcnt);
  93.                         int boundary = 0;
  94.                         for(int i=0;i<mrav;i++)
  95.                         {
  96.                             if(!ants.get(i).goesleft)
  97.                             {
  98.                                 boundary = i;
  99.                                 break;
  100.                             }
  101.                             boundary++;
  102.                         }
  103.                         System.out.print("The last ant will fall down in "+maxdist+" seconds - started at ");
  104.                         if(pp.size()==1)
  105.                             System.out.print(ants.get(maxright?boundary:(boundary-1)).apos);
  106.                         else
  107.                             System.out.print(ants.get(boundary-1).apos+" and "+ants.get(boundary).apos);
  108.                         System.out.println(".");
  109. 		}
  110. 	}
  111.  
  112.  
  113.                 public static class Ant
  114.                 {
  115.                     int apos;
  116.                     boolean goesleft;
  117.                     int fallsin=-1;
  118.  
  119.         public Ant(int apos, boolean goesleft,int fallsin) {
  120.             this.apos = apos;
  121.             this.goesleft = goesleft;
  122.             this.fallsin = fallsin;
  123.         }
  124.         public String toString()
  125.         {
  126.             return apos+"-"+goesleft;
  127.         }
  128.  
  129.                 }
  130. }

Diff to submission s1032

ants.java

--- c4.s1032.cteam040.ants.java.0.ants.java
+++ c4.s1111.cteam040.ants.java.0.ants.java
@@ -68,17 +68,27 @@
                         
                         boolean ordered = true;
+                        int itcnt = 0;
                         do
                         {
                             ordered = true;
-                            for(int i=1;i<mrav;i++)
+                            
+                            for(int i=0;i<mrav-1;i++)
                             {
-                                if(!ants.get(i-1).goesleft && ants.get(i).goesleft)
+                                if(ants.get(i).goesleft)
+                                    continue;
+                                // assert goes right*/
+                                for(int j=i+1;j<mrav;j++)
                                 {
-                                    ordered = false;
-                                    ants.get(i-1).goesleft = true;
-                                    ants.get(i).goesleft = false;
+                                    itcnt ++;
+                                    if(!ants.get(j-1).goesleft && ants.get(j).goesleft)
+                                    {
+                                        ordered = false;
+                                        ants.get(j-1).goesleft = true;
+                                        ants.get(j).goesleft = false;
+                                    }
                                 }
                             }
                         }while(!ordered);
+                       // System.out.println(itcnt);
                         int boundary = 0;
                         for(int i=0;i<mrav;i++)
@@ -100,4 +110,5 @@
         }
         
+        
                 public static class Ant
                 {