Merge pull request ashutosh97#71 from amcs1729/master

ZOMCAV

Author: ashutosh97

ZOMCAV/ZOMCAV.txt

@@ -0,0 +1,39 @@
+The solution given along is written solely by the author and using it anywhere else without prior written permission might result in legal actions taken against the guilty person
+
+
+
+
+
+There are N caves in a row, numbered 1 through N. For each valid i, the radiation power in the i-th cave is Ci. Originally, the radiation level in each cave was 0. Then, for each valid i, the radiation power in cave i increased the radiation levels in the caves i-Ci,�,i+Ci inclusive (if they exist) by 1, so all the caves are radioactive now.
+
+Radiation is not the only problem, though. There are also N zombies with health levels H1,H2,�,HN. You want to kill all of them by getting them to the caves in such a way that there is exactly one zombie in each cave. A zombie dies in a cave if and only if the radiation level in that cave is equal to the health level of the zombie. Is it possible to kill all the zombies?
+
+Input
+The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
+The first line of each test case contains a single integer N.
+The second line contains N space-separated integers C1,C2,�,CN.
+The third line contains N space-separated integers H1,H2,�,HN.
+Output
+For each test case, print a single line containing the string "YES" if it is possible to kill all the zombies or "NO" if it is impossible (without quotes).
+
+Constraints
+1=T=100
+1=N=105
+1=Ci,Hi=109 for each valid i
+Subtasks
+Subtask #1 (30 points): 1=N=1,000
+Subtask #2 (70 points): original constraints
+
+Example Input
+2
+5
+1 2 3 4 5
+1 2 3 4 5
+5
+1 2 3 4 5
+5 4 3 4 5
+Example Output
+NO
+YES
+Explanation
+In both example test cases, the final radiation levels in the caves are (5,5,4,4,3). For example, the radiation power in cave 1 increased the radiation levels in caves 1 and 2 (there is no cave 0) by 1, and the radiation power in cave 4 increased the radiation levels in all caves by 1.

ZOMCAV/codechef.class

@@ -0,0 +1,5 @@
+#BlueJ class context
+comment0.target=codechef
+comment1.params=args
+comment1.target=void\ main(java.lang.String[])
+numComments=2

ZOMCAV/codechef.ctxt

@@ -0,0 +1,78 @@
+import java.util.*;
+import java.io.*;
+class codechef
+{
+    public static void main(String args[])throws IOException
+    {
+        BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
+        int t= Integer.parseInt(br.readLine());
+        for(int phi=0; phi<t;phi++)
+        {
+            int n= Integer.parseInt(br.readLine());
+            String ra= br.readLine();
+            String zo= br.readLine();
+            
+            int radpow[]= new int[n];
+            
+            int starting[]= new int[n];
+            
+            for(int i=0;i<n;i++)
+            {
+                starting[i]=0;
+            }
+            
+                
+            
+            StringTokenizer st = new StringTokenizer(ra);
+            
+            int cou=0;
+            
+            while(st.hasMoreTokens())
+            {
+                long val = Long.parseLong(st.nextToken());
+                
+                int start= (int)Math.max(0, cou-val);
+                int stop=  (int)(cou+val+1);
+                
+                
+                cou++;
+                
+                
+                starting[start]+=1;
+                if(stop<=n-1)
+                starting[stop]-=1;
+               
+                
+            }
+            
+            
+            
+            
+            cou=0;
+            for(int i=0;i<n;i++)
+            {
+                cou+=starting[i];
+                if(cou<0)
+                cou=0;
+                radpow[i]+=cou;
+            }
+            
+            
+            
+            
+            StringTokenizer newst= new StringTokenizer(zo);
+
+            long xor=0;
+            for(int i=0;i<n;i++)
+            {
+                xor= (xor^radpow[i])^Long.parseLong(newst.nextToken());
+            }
+      
+            if(xor==0)
+           System.out.println("YES");
+           else
+           System.out.println("NO");
+        }
+    }
+}
+