OJ Board

Can someone explain me how is the answer for ABA 5?
I counted 4 :
1. leave as it is
2. remove B
3. remove A and A
4. remove everything

Is this case allowed? What's the AC program output? Thanks for replies. A4W S1N SW TURN RIGHT TURN HALF RIGHT TURN SHARP RIGHT GO STRAIGHT 41 GO -32 PW TURN RIGHT TURN RIGHT GO STRAIGHT 21 TURN HALF LEFT TURN SHARP LEFT GO ON 47 TURN HALF LEFT OPPEKEOBWFGFXRYISILEIMFGUFRZZZDWVO TURN SHARP LEFT TURN ...

Thanks, that makes sense.

EDIT: How do you check if tree is not obscured by another tree?

Why are you dividing problem into quarter planes? How do you deal with trees on the border between planes?

I also have trouble with that problem. I don't know how to do it...

Please Help.

Are you sure about correctness of your output? In the last case you repeated some lines.

Any replies? I'm sure somebody here got AC for this problem. I'm seriously stuck.

I get WA for this problem, and I have no idea what's wrong. I would be really thankful to anybody providing some tricky test case or answering the following questions: 1. Can we reuse words? 2. What about duplicate words? 3. Can we have multiple inputs? I would appreciate output from AC code for tha...

I'm doing that problem for a quite long time, and I'm desparate now. Could anybody supply some test cases that could brake that code: // Telephone Tangles - acm.uva.es/p/v1/139.html // by Artur Dmowski #include <cstdio> #include <cstdlib> #include <cstring> #define MAXL 10001 #define REP(i,n) for(in...

I have no idea what's wrong with my code. Does anybody have some special cases or other inputs. Here is my code: // Software CRC - acm.uva.es/p/v1/128.cpp // by Artur Dmowski #include <cstdio> #include <cstring> #define G 34943 using namespace std; char line[1500]; int crc,m,k,i; int main() { #ifnde...

I have no idea why it gets WA. I tested my program for all inputs available on board and it works. Any ideas? //Simulation Wizardry - acm.uva.es/p/v1/114.html #include <iostream> #include <cstring> #include <cstdio> #define MAXD 55 #define REP(i,n) for(int tn=n,i=0; i < tn; i++) using namespace std;...

Can anybody help me with that problem? Judge says WA and I have no idea what could be wrong. Thanks in advance, for replies. //SCUD Busters - acm.uva.es/p/v1/109.html #include <cstdio> #include <cstdlib> #include <cassert> #include <cstring> #include <climits> #include <cmath> #include <algorithm> #...

Can anybody help with that code. I try to find some bug that makes runtime error but it always works. Thanks in advance, for any replies. #include <cstdio> #include <cstring> #define MAXN 25 using namespace std; long contains[MAXN][MAXN], pos[MAXN], size[MAXN]; void setup(){ int i,j; for(i = 0; i < ...

Oh, there is no problem actually. I was solving that problem under winxp cause my linux box was 'injured' for a moment. WinXp is so memory devouring that I didn't have place to allocate 1<<21 integers which lead my to asking that question. Now everything is ok. Thanks again for your reply.

Hi. Thanks for your reply. So now I realized that my problem wasn't really a problem. I thought that 1<<21 is too much space but it's ok on usaco machinges. However, it gives errors on my machine. Does anybody know how to fix that? I guess there is some kind of flag that reduces it.