Add files via upload

Author: javaarchive

Training/friday.in

@@ -0,0 +1 @@
+20

Training/friday.out

@@ -0,0 +1 @@
+36 33 34 33 35 35 34

Training/milk1.in

@@ -0,0 +1,11 @@
+10
+2 3 
+4 5 
+6 7 
+8 9 
+10 11 
+12 13 
+14 15 
+16 17 
+18 19 
+1 20 

Training/milk2.in

@@ -0,0 +1,4 @@
+3
+300 1000
+700 1200
+1500 2100

Training/milk2.out

@@ -0,0 +1 @@
+1500 1600

Training/milkerror.in

@@ -0,0 +1,4 @@
+3
+100 102
+64100 64102
+128100 128102

Training/milkio.in

@@ -0,0 +1,7 @@
+6
+100 200
+200 400
+400 800
+800 1600
+50 100
+1700 3200

Training/notes

@@ -0,0 +1 @@
+September april june novemeber 30

cowroute.java

@@ -0,0 +1,143 @@
+import java.io.*;
+import java.util.*;
+import java.util.*;
+/*
+ * 
+ * 
+ * Improvement for cowroute
+ */
+public class cowroute {
+	
+	
+	public static void main(String[] args) throws IOException {
+		StringTokenizer st;
+		BufferedReader f= new BufferedReader(new FileReader("6.in"));
+		st=new StringTokenizer(f.readLine());
+		
+		int[] route= {0,0,0};
+		ArrayList<int[]> aroutes=new ArrayList<int[]>();
+		ArrayList<int[]> broutes=new ArrayList<int[]>();
+		int A=Integer.parseInt(st.nextToken());
+		int B=Integer.parseInt(st.nextToken());
+		int N=Integer.parseInt(st.nextToken());
+		/*
+		 * A routes and B routes item structure
+		 * First item-price
+		 * 1-Index
+		 * 2-Which route
+		 */
+		 
+		 boolean Before;
+		 boolean after;
+		 @SuppressWarnings("unchecked")
+		 ArrayList<Integer>[] data=new ArrayList[N];
+		 int price;
+		 int M,id;
+		 for(int i=0;i<N;i++) {
+			 data[i]=new ArrayList<Integer>();
+			 st=new StringTokenizer(f.readLine());
+			 price=Integer.parseInt(st.nextToken());
+			 M=Integer.parseInt(st.nextToken());
+			 st=new StringTokenizer(f.readLine());
+			 for(int j=0;j<M;j++) {
+				 id=Integer.parseInt(st.nextToken());
+				 if(id==A) {
+					 route[0]=j;
+					 route[1]=i;
+					 route[2]=price;
+					 aroutes.add(route.clone());
+				 }else if(id==B) {
+					 route[0]=j;
+					 route[1]=i;
+					 route[2]=price;
+					 broutes.add(route.clone());
+				 }
+				 data[i].add(id);
+			 }
+			 data[i].add(0, price);
+		 }
+		 //System.out.println("Finished first loop Debug status A:"+A+"   B:"+B+"  N:"+N);
+		 int low=-1;
+		 boolean k=true;
+		 int r,x;
+		 int price2=0,index,index2,count;
+		 ArrayList<Integer> a,b;
+		 a=new ArrayList<Integer>();b=new ArrayList<Integer>();
+		 //System.out.println("====Entering main loop===");
+		 
+		 for(int[] stuff:aroutes) {
+			 a.clear();
+			 
+			 price=stuff[2];//Get price
+			 index=stuff[0];
+			 r=stuff[1];
+			 count=0;
+			 after=false;
+			 for(int i:data[r]) {//For every item in the A route
+				 
+				 if(i==A) {
+					 after=true;
+					 continue;
+				 }else if(i==B) {// If B is also in the route and we are past "A"
+					 if((price)<low||k) {
+						 k=false;
+						 //System.out.println("New low cost by all in one");
+						 System.out.println("Debug Info index:"+index+"- count:"+count);
+						 low=price;
+					 }
+				 
+				 }
+				 count++;
+				 
+				 if(after) {a.add(i);}
+			 }
+			 for(int[] dat:broutes) {
+				 
+				 b.clear();
+				 
+				 price2=dat[2];//Get price
+				 index2=dat[0];
+				 //r2=stuff[1];
+				 Before=true;
+				 for(int m=0;m<data[r].size();m++) {
+					 x=data[r].get(m);
+					 if(x==B) {
+						 Before=false;
+						 continue;
+					 }
+					 if(Before) {
+					 
+					 
+					 b.add(x);
+					 }
+				 }
+				 a.sort(null);
+				 b.sort(null);
+				 for(int i=0;i<a.size();i++) {
+					 System.out.println("Info I:"+i);
+					 count=a.get(i);
+					 
+					 if(Arrays.binarySearch(b.toArray(),(a.get(i)))>-1) {//Flight overlap
+						 if(((price2+price)<low||low==-1)) {
+							 System.out.println("Debug for new overlap: The same value is:"+a.get(i)+" The first price is price:"+price+" and price2:"+price2);
+							 System.out.println("Debug count:"+count+" index2:"+index2);
+							 System.out.println("New low cost by overlap");
+							 low=price2+price;
+						 }
+					 }
+				 }
+			 }
+			 
+			 
+			 
+			 
+		 }
+		 PrintWriter pw=new PrintWriter(new FileWriter("cowroute.out"));
+		 pw.println(low);
+		 pw.close();
+		 f.close();
+		 
+		 
+	}
+
+}

moocast.java

@@ -0,0 +1,108 @@
+import java.io.*;
+import java.util.*;
+public class moocast {
+	
+	private static int[][] data;
+	private static int[][] map;
+	private static int cowstargeted;
+	private static int[][] modifmap;
+	private static int cownum;
+	public static void d(String a) {
+		System.out.println(a);
+	}
+	public static void Cast(int cow) {
+		d("Loading data varibles");
+		
+		int range=data[cow][2];
+		int x=data[cow][0];
+		int y=data[cow][1];
+		int a,b;
+		d("Done");
+		//int count=0;
+		double calc=0;
+		 for(int x1=x-range;x1<x+range;x1++) {
+			 //count++;
+			 if(cownum==0) {break;}
+			 for(int y1=y-range;y1<y+range;y1++) {
+				 if(cownum==0) {break;}
+				 a=Math.max(x1-x, x-x1);
+				 b=Math.max(y1-y, y-y1);
+				 calc=Math.sqrt(a*a+b*b);
+				 
+				 if(-1<x1&&-1<y1&&y1<25000&&x1<25000&&modifmap[x1][y1]!=0&&-1<calc&&calc<range+1) {
+					 	 
+						 //count++;
+						 ////////////System.out.println("X Y = "+x1+" - "+y1+"   "+count);
+						 if(modifmap[x1][y1]>0) {
+							 cownum--;
+							 System.out.println("Cow found");
+							 ////////////System.out.println("RAnge:"+range);
+							 ////////////System.out.println(calc);
+							 ////////////System.out.println("We've hit a cow");
+							 cowstargeted++;
+							 modifmap[x1][y1]=0;//Eliminate the cow
+							 //Above disables a cow
+							 Cast(map[x1][y1]);
+						 }
+					 
+				 
+				
+			 }
+			 }
+			 if(cownum==0) {break;}
+		 }
+	}
+	public static void main(String[] args) throws IOException {
+		
+		d("Reading");
+		BufferedReader f = new BufferedReader(new FileReader("3.in"));
+		int N=Integer.parseInt(f.readLine());//Read N
+		d("Parsed N");
+		data = new int[N][3];
+		StringTokenizer st;
+		map = new int[25000][25000];
+		d("Data init done");
+		cownum = N;
+		for(int i=0;i<N;i++) {
+			cownum=N;
+			/*Data Format
+			 * 0 x
+			 * 1 y
+			 * 2 Power
+			 */
+			st=new StringTokenizer(f.readLine());
+			for(int j=0;j<3;j++) {
+				data[i][j]=Integer.parseInt(st.nextToken());
+			}
+			map[data[i][0]][data[i][1]]=i+1;
+			
+		} 
+		modifmap = map.clone();
+		f.close();
+		int high=1;
+		for(int i=0;i<N;i++) {
+			modifmap=map.clone();
+			cowstargeted=1;
+			////////////System.out.println("--Cow--");
+			Cast(i);
+			if(cowstargeted>high) {
+				System.out.println("New high");
+				high=cowstargeted;
+			}
+		}
+		////////////System.err.println(high);
+		f.close();
+		d("Closed f now writting output");
+		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("moocast.out")));
+
+	
+		pw.println(high);
+		pw.flush();
+		
+		pw.close();
+		
+		
+		
+	}
+
+}