OJ Board

Hello, can anybody help me out
on this problem?
In my code, I assumed the times are
real numbers because I got a lot of
WA's assuming they were ints. :)

Thanks for any help.
Broderick

[c]
#include <stdio.h>
#include <math.h>

typedef struct {
double loc;
double g,y,r;
} light_t;

int n;
light ...

Thanks for the idea.
Hmm, I can't think of a reason (or a test case) as to why
you need to call it twice...One more thing to think about
today.

Broderick

I keep getting WA on this problem...can anybody help me out?
I use floyd's (with some extra checking for the feast cost).

Here's my code (I won't leave it up too long, just for a day or two
or until somebody helps me).

Thanks in advance

argh! I'm pulling my hair out in frustration with this problem!
Can anybody give me a test case where this fails?

Thanks in advance,
Broderick

[c]
#include <stdio.h>
#include <assert.h>

int w,h;
char grid[2048][2048],out[2048][2048];
int dx[] = { 0, 1,1,1,0,-1,-1,-1};
int dy[] = {-1,-1,0,1,1, 1 ...

Hello,
I've gotten several WA's for this problem but I can't figure out why.
I'd hate to post code but I don't see any other way...:)
can anybody think of a test case where this code will fail?

The algorithm i used is this:
- dfs from one mirror to the next flipping the mirrors correctly as we go ...

hmm, very strange. I had the exact same problem as xenon
with constant WA's...print a newline after the last case, and you get
PE. What I don't understand is how that can result in WA?

thanks for the tip

broderick

Hint: your output for the rule '00' is incorrect.
It should be

00
01
02
...
10
11
12
..
98
99

hehe, thanks for the tip. I'm not sure why i was even using
doubles to begin with, the integer-only solution is pretty obvious
and easy to code.

Oh, btw, those were L's (not ones) for printing long long's.

Broderick

hehe, i was being dumb. of course that's not a tree.
a simple one line fix and AC.

Thanks!
Broderick

why wouldn't that be a tree?

Did you mean:
1 2
2 1
0 0
-1 -1

In which case I get "is not a tree".

I don't think that's correct. for instance, you have the [0 4] domino
repeated twice (the second time as [4 0]). But there is only one of each
domino, so that layout isn't valid.

When i solved this problem I assumed that each domino had to be used
exactly once.

Hope this helps.

I'd hate to post code here, but I can't seem to find the bug...it's driving
me crazy! (Btw, this codes passes all the tests posted to this board,
but still gets WA).

Multiple input.

Could anybody help me out? my output matches the above tests
exactly, but I still get WA. any ideas?
Here's me code, I'll delete it if anybody helps me out.

If from==to, you're just printing out the number you read in.
what if you are given "000000"? the output should be "0", but
you write out "000000".

Broderick

(btw, i switched your code and got ac)