OJ Board

Use your following processing while you are taking Input . for (i=1;i<=r;i++) for (j=1;j<=c;j++) for (k=0;k<n;k++) if (sqrt(sqr(v[k].x-i)+sqr(v[k].y-j)) <= (double)s[k] ) map[i][j] = blocked; And it is O(r*c*n). For clarity: ..... cin >>n; for (i=1;i<=n;i++) { cin >>p.x>>p.y>>l; //Put here the above...

I dont think that you need to use check() function. Just do the solution with the following recusive function. Its just a template. void f(int sum,int index) { if(sum==0){ //put those numbers which makes sum=0!!! return; } for(int k=index;k<n;k++){ //store the num[k] into an array f(sum-num[k],k); /...

Hints:
1) Make a relation table.
2) Order have to consider
3) If there is no unique solution, any of the possible solutions!

Please check my I/O!!!
Input: Output: All are correct?

beloni wrote:On gcc and allegro.h

On Turbo C, it will be "graphics.h".

See PM for link.

pintor(x-1,y,color); why did you use it here? Can you tell me? To fill polygon you must first define poly[] arrays, then the following: setfillstyle(...) fillpoly(...) it overflows the stack When this message shows? I made a small paint project 2yrs ago, that time we made similiar Paint's Polygon t...

Just clearcut problem if you use STL. Did you follow this: After reaching the destination stop they return empty to the originating stop First calculate cost1, after that reverse the direction of all edges with O(p^2), then calculate the cost2. Finally result=cost1+cost2 For case #2,(problem's) 4 6 ...

Try the following input: Then see, what will happen?
bye

emotional,
Would you tell me the GREEDY approach as a hint?

First try 524, then i think you will get.

http://acm.uva.es/p/v5/524.html

Can someone tell me why same type of problem comes in another contest?
May be the description of it is different but who solved 524, he/she definitely solve this one.

Randomly generate some INPUTs then store OUTPUTs into a file then compare. ok. Its best.

Spoiler:
http://www.algorithmist.com/index.php/L ... quence.cpp

So dont cut & paste.
Try to learn something from it.

Hope it helps.

bye
Rabbi

If you post your code then it will be easy for me to figure out your error.

Sorry that was typo.

No multiple edges. Clear cut dijkstra with Priority Queue. And Input below:(not tricky) 4 6 9 5 0 0 1 4 0 2 2 1 2 1 1 3 5 2 3 8 2 4 10 3 4 2 3 5 6 4 5 3 6 9 0 5 0 1 4 0 2 2 1 2 1 1 3 5 2 3 8 2 4 10 3 4 2 3 5 6 4 5 3 6 9 5 2 0 1 4 0 2 2 1 2 1 1 3 5 2 3 8 2 4 10 3 4 2 3 5 6 4 5 3 6 9 3 0 0 1 4 0 2 2 1...