OJ Board

Do not forget to add a newline after the last line of output.

If there is an unmatched closing bracket, output the position of the first one with this property. Otherwise, output the length of expression plus one.

What is the output of an accepted solution for these test cases?

12
50,13N 45,10W 75,0N 44,50E
50,13N 90,10W 75,0N 89,50E
10,0N 129,30E 10,0S 50,30W
15,0N 0,0W 10,0N 0,0W
10,0N 0,0W 15,0N 0,0W
75,0N 44,50E 50,13N 45,10W
75,0N 89,50E 50,13N 90,10W
10,0N 0,0W 10,0S 0,0W
10,0S 0,0W 15,0S 0,0W
10,0S ...

I am using the O(n log k) algorithm but I cannot get it accepted. Could you post some test cases?

One test case that might be useful:

1
4
1 1
1 2
1 2
2 2

I hope it helps.

What is the output of accepted solutions for the following input?

-93 38 -153 -40 156 -135
18 98 244
134 144 67 -2 -97 114
25 65 270
99 -18 -149 78 151 -4
146 140 74
194 111 -21 86 -1 149
20 8 332

Thank you in advance.

I've tried unsuccessfully to solve this using breadth first search. Is it possible to solve this problem this way or not?

When computing the convex hull, be careful with the direction of the ordering. In my case it worked clockwise. Also is convenient to choose the first point of the input as reference.

While sorting using the Graham algorithm, do not forget to place the lowest point FIRST in the list.

You can find the full source code at:

http://www.cs.sunysb.edu/~skiena/392/pr ... distance.h
http://www.cs.sunysb.edu/~skiena/392/pr ... distance.c
http://www.cs.sunysb.edu/~skiena/392/pr ... ringedit.c

The code that they used for their algorithm is:

int string_compare(char *s, char *t)
{
int i,j,k; /* counters */
int opt[3]; /* cost of the three options */

for (i=0; i<MAXLEN; i++) {
row_init(i);
column_init(i);
}

for (i=1; i<strlen(s); i++)
for (j=1; j<strlen(t); j++) {
opt[MATCH] = m ...

I used the algorithm that appears in the Programming Challenges book, and now my code is rejected. Is the algorithm wrong or the judge solution has to be checked again?

I got it accepted. You were right.

Is there any tricky thing about this problem? I do not get it accepted.

I got it accepted: it was an stupid error about the output format.

Thanks everybody.