UVa OJ Board

how to solve this problem ?

Can you post links to similar problems.

input: 1 4 0 1 2 5 1 3 3 4 0 0 output: 3 0 1 1 3 2 5 #include<cstdio> #include<cmath> #include<cstring> #include<cstdlib> #include<cctype> #include<cassert> #include<iostream> #include<algorithm> #include<string> #include<vector> #include<deque> #include<map> #include<set> #include<iterator> #inclu...

I added this test case to your input and my AC output is 5 8 1 1 2 2 4 4 5 5 1 5 2 4 5 1 4 2 Case 1: 6 Case 2: 8 Case 3: 34 Case 4: 12 Case 5: 18 Case 6: 24 Case 7: 26 Case 8: 4 Case 9: 6 Case 10: 16 btw you can try your input outputs at uvatoolkit.com for hints look at this thread http://forums.top...

thanks , nice trick.

i got AC on 10089 but this problem is giving me trouble when i've vectors like (0,0,q) or (0,q,r). If all were positive i could convert it to 10089 by multiplying the lcm of (p,q,r) to make the ratio equations equal. But this zero is messing the whole thing. Any tricks , can we add newEPS=1e-3 in pl...

I've a O(n) after sorting. If the angle between 2 consecutive ,x{n} and x{n+1} > 180 , then we report false because we can translate the axis to x{n+1} and it will be < 180. Good stuff. Thanks mf for teaching me this. Generalising this to n - dimensions is a good. All i understand is reduce it to n-...

I knew that one. Didn't see it . It is just subtraction of 2 vectors and then making the independent components equal to 0. Now, to answer why it's useful. To check that you can make a zero vector, you basically need to check that your collection of vectors spans an angle of 180 degrees or more, i.e...

Well, isn't it obvious? A linear combinations of vectors (s2 - s1 , s3 - s1 ) is zero if and only if the same linear combination of vectors (s1 , s2 , s3 ) is a vector with three equal components, namely, all equal to this linear combination of s1 's. It's just simple algebra and manipulations of s...

uvatoolkit.com has program which accepts inputs and produces outputs for AC solution. You can generate some test cases and check it if it is the same as uvatoolkit.com. It doesn't have source , only it produces output for AC solution.

any hints ?

Hi! I have an other algorithm that is correct, and got AC. My algorithm goes like this : We treat is as the vectors on the plane. if the package is (s1,s2,s3) it is count as an vector [s2-s1,s3-s1]. And our problem is to find whether starting from point (0,0) you can return there. And that's all.. ...

i implemented Range tree which works for unique (x,y) pairs ie all x's and y's are different. How do we incorporate for equal values .My buildtree goes into infinite loop if i have unique x values because i split on left and right based upon median . If x < med then left, otherwise x>=med right. Now...

i'm really thankful to your replies and help on problems. I sometimes don't understand or vaguely understand what you wrote. I come back later and on an another day i re-read it and understand it. Only this time it was months ago :) Well i tried commenting that line and running it and it passed. But...

def increase(self, x, y, val): """Changes the value of point (x, y) to the maximum of val and its old value.""" self.increase1(y, val) if self.mid is not None: if x < self.mid: self.left.increase(x, y, val) ************* self.right.increase1(y, val) ******************** else: self.right.increase(x,...

in the obst optimization by knuth we do min (C[i,k-1] + C[k+1,j]) for all k such that r[i,j-1]<=k<=r[i+1,j] why doesn't this k run n/2 times or n/4 times in each loop , why is it a constant ? I view it as all nodes of left tree's -> right subtree and right tree's -> left subtree. If the total nodes ...