OJ Board

Try using unsigned int instead of int. 34942 << 16 = overflow

Hi, I am trying to solve 775 using simple backtracking. I've also tried pruning using BFS to make sure there was still a path back to the start vertex at each step. I am getting TLE.. please help! ;) Thanks, - Andrew #include <iostream> #include <map> #include <stdio.h> #include <set> using namespac...

Yeah, I got AC Here is another testcase to help anyone who might have WA:

4
1
4
7
8
3
0
5
100000

Case 1:
Closest sum to 0 is 5.
Closest sum to 5 is 5.
Closest sum to 100000 is 15.

- Andrew

Hrrrmmm. Why am I getting WA? I've read all the other posts for this problem.. nothing helps
Thanks!
- Andrew

Jan, I don't think your sample input makes sense. For instance, your first test case looks like this: 110 011 110 with direction = 4. However, this is impossible - the direction must be 5 (giving a previous square of [0,2]). If the direction were indeed 4 then we would have a non-optimal previous sq...

Hi Deneb I had much troubles with this part, and that's what makes my code so ugly and so slow :oops: The algorithm is as follows : /* I don't mention global variables used to mark the cycles and to store the eulerian cycle */ /* direct_cycle is the direct cycle you're processing */ construct_euler...

Hi, I've read the other posts on 10029, and from what I've read it seems to me my implementation should work. I think the culprit may be in my calcVariations() function, where I generate all possible edit steps for a string.. maybe STL string is too slow for this? In any case, I wrote my own linked ...

I'm also having trouble with this problem. I got the solution for the sample input no problem, and also managed to calculate 1.29 for this testcase: 2 NE 2 S 1 -90 I'm pretty sure the problem is something to do with the way I handle angles.. I probably put too much faith in c++ trigonometric functio...

Hi everyone! My question is pretty straightforward: I have an array of pointers that I would like to sort using the sort() function prvoided in <algorithm>. If it was an array of objects, I would do the following: #include <algorithm> struct s { const bool operator<(const s other) const { return tru...

Thank-you so much!!

I implemented all of your suggestions, and I got my solution accepted (runtime was 28.586 seconds).

I'm curious as to how I could make my program go faster. Is there some obvious heurestic that I missed?

-Andrew

Hi, Thank you for your reply. I appreciate it :) I still can't crack this problem. I've tried many different things so far. Basically my solution does what you described. In an attempt to make my code run faster, my latest "optimization" was to make it so that before I recurse, I sort the remaining ...

Yo, I'm also having trouble with this question (I keep getting Time Limit Exceeded). Have you managed to solve it by any chance? If so -- any hints? Thanks in advance.

Hi, I've been working on 10247, but I keep getting alternations between WA and TLE from our dear pal the judge. My program seems to work for the sample inputs. I also ran some other inputs on the program, and here's what I got: 3 6: 1562426428985838116716663847602053919993687706682744920691775 87449...

Hi, I get the right answer for n = 64 and n = 28, but when I type in n = 9876 I get: 6964824117983874234650500427748868209542865000190576981818345 9167875096365227972472038355305206881965379346125792003500964 48775287769802767937463111146298807126530166456649252977 Some other test values I tried: n ...

Yeah.. I really hope they upgrade their java support soon

It's horrible.. you can't even do basic sorting using the Arrays or Collections classes.

Argh.. maybe I'll have to bite the bullet and learn the C++ STL.