OJ Board

To make it easier to check if it is in the pyramid, I use 2D convex hull.


i am interested to know how a convex hull could be use to solve a linear system of equations...i am not very clear about the part on the pyramid and how the convex hull could be used in this case....it would be best if u ...

i tried to solve this problem using dynamic programming (lis)...i am not very sure if my algo is correct or if it is even considered dp, but it works as follows:

i have a 2d array tower(i, j) which is set to true or false, depending on whether i can form a tower of height i, with the color j facing ...

i seem to have confused the locations of the walls....so careless of me...now its an AC....thanks Anggakusuma..

thx for your suggestion....i have modified the code to use breadth first search...and tried my program with test data that i can think of...somehow the judge gives a WA....can anyone take a look at my code and see what i have overlooked or misunderstood....thanks....

[c]
code accepted..
[/c]

i attempted to do this problem using a depth first traversal, but it seems to be to inefficient to solve the problem within 10s.... and looking at the timings achieved by those who solved the problem, mostly below one fifths of a sec...so there should be another more efficient approach to this ...

i tried my program with many test cases and i am still getting wa from the judge...wonder wad i have overlooked...i considered the house being nearer to the source than the tree (pythagoras theorem), the house being out of range of the radiation (by the angle between tree, house and source)...and ...

i just carn figure out what is wrong with my code, the judge just gives me wa

[c]/* @BEGIN_OF_SOURCE_CODE /**/

#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdio.h>

#define MAX_M 55
#define MAX_N 55

void makeGrid(const int, const int, const int);
int playBall(const ...

you do not need to use string arithmetic, just some formula and a double will do the job...

after some long thinking, i manage to come up with equilateral triangles linking 3 circles together, and stuck there...

using that method, i found that i could fit 128 circles instead of 126 circles in the box 11 by 11, but i am not very sure about those dimensions with decimals...they are quite ...

the judge gave me WA but it worked well with the sample inputs...and some of my own inputs

[cpp]
/* @BEGIN_OF_SOURCE_CODE */

#include <iostream.h>

const int MAP_SIZE = 56;

typedef struct MAPTYPE {
bool canWalk;
int cost, value;
} MapType;

/* Function Prototypes */
void createMap(int, int, int ...

there is an O(n^3) algorithmn for finding the maximum sum....can anybody explain how it works?

i remembered someone saying that it is related to the largest subsequence problem

My question is that in prob No 100

will the program take all the input lines and then give output
OR
with each line of input it will give the output?

If its the 1st case then how to read the input.Please tell me.Because in other problems (next 2 )also I have same doubt.

it will work either ...

can anybody tell me the formulas i need to know for this problem?

thank you