OJ Board

pointless0

According to my assert() logic, I am not processing all input.

for (row = 1; row <= 10; ++row) {
row_ids["r" + number[row]] = row;
row_ids["R" + number[row]] = row;
}

while (std::cin >> token) {
if (row_ids.count(token) == 1) {
//...read 10 cells worth of content
}

// THIS ASSERT ...

pointless0

Problem statement contains the output specification guidance: The output should be labeled exactly as shown in the sample output below, with a blank line separating the outputs for consecutive data sets.

Following the quoted guidance gave me a Presentation Error. When I added an extra blank line ...

pointless0

Regarding the count of zero at (0,0)... "start" != "visit".

If this is applicable for other grids as well, can somebody please tell how the AC output for below input is 1 0?

+----------------------+------------------------------------------+
| (0, 0) -> (-29, -7) | X & Y Grid coordinates are ...

pointless0

This worked for me: assume the judge input contains concave polygons.

Concave polygon input:

Code: Select all

AC-ish output:

Code: Select all

41.87

Whether or not the judge input actually contains concave polygons I do not know.

pointless0

If anyone could clarify how totally off base this approach is, that would be great... I am attempting to solve this using baby step, giant step. Being my first attempt at solving a LFSR, I am very likely failing to model the problem correctly.

For input (3rd sample input case)

7 3
0 2 3
4d 1a ...

pointless0

Just noting...for test cases:

Code: Select all

uDebug AC output is:

Code: Select all

Top sticks: 1, 2.
Top sticks: 1, 2, 3, 4, 5, 6.

My AC output is:

Code: Select all

Top sticks: 2.
Top sticks: 5, 6.

pointless0

Input:

Code: Select all

A50W S49S S
TURN LEFT
TURN LEFT
STOP
END

FWIW, my AC output is:

Code: Select all

A49W S50S N

pointless0

In case anyone has a concern about producing a rounded output for this problem...

For input

3

0 0 0 10000
0 0 0 14999 0 20000 -1 -1

0 0 0 10000
0 0 0 15000 0 20000 -1 -1

0 0 0 10000
0 0 0 15001 0 20000 -1 -1

uDebug delivers the output

52

52

53

My AC output

52

53

53

My C++11 ...

pointless0

Interesting point of difference between my AC submission and uDebug...

Test input:

Code: Select all

1
0.00000000000007
0

My AC result:

Code: Select all

0.00000000000007

uDebug result:

Code: Select all

7E-14

Should I consider my solution unacceptable?

OJ Board

Search found 9 matches

Re: 1294 - Mini-Spreadsheet

Re: 1295 - Houses Divided

Re: 11906 - Knight in a War Grid

Re: 10117 - Nice Milk

Re: 11682 - Shift Register

Re: 10902 - Pick-up Sticks

Re: 163 - City Directions

10389 - Subway

Re: 11821 - High-Precision Number