OJ Board

Everybody is talking about getting PE, but man I cannot remove WA talk about PE later. Anyways looked for Adrian's inputs, but they are not any more available neither from Stefen site nor Adrians. Somebody please come to rescue, I'm going crazy already tried arnd 20 submissions with different ...

Ac Output


7 7
0 0 1 1 1 0 0
0 1 0 0 0 1 0
1 0 0 0 0 0 1
1 0 0 1 0 0 1
1 0 0 0 0 0 1
0 1 0 0 0 1 0
0 0 1 1 1 0 0
5 5
0 0 1 0 0
0 0 1 0 0
0 1 1 1 0
0 1 0 1 0
0 0 0 0 0
5 5
0 0 0 0 0
0 1 0 1 0
0 1 1 1 0
0 0 1 0 0
0 0 1 0 0
2 2
1 1
1 1
3 3
0 0 0
0 1 0
0 0 0
3 3
1 1 1
1 0 1
1 1 1
8 8
0 1 1 1 1 1 1 0
1 ...

I found out the problem it was with setting the limit for the line segment intersection check.

I'm using DP to calculate the cost.
cost[0] = 0
cost = cost[i-1] + min(len[j]+len[k]) [j,k are tree's leaves length of i-1th and ith tree. and also no line segments between the j and k intersects and the straight line distance is less then the specified.]
and then again minimized cost = min(cost ...

Thanx ntrhieu got ac.

Hello
I have tried everything, I have atleast submitted this probnlem a hundred times but still can't figure out anything.

what I did was
1)Created convex hulls of the supporters
2) if any point is less than 1 then yes
3) if both contains 1 point then yes
4) if ( one contains 1 point and the other ...

Thanx Adrien. If the first time step

######
#00#0#
######
######

2nd

######
#0000#
#0000#
######

here # stands for place which was monitored by inspector robstop and 0 where there was no monitoring.

what'll be the output.

thanx

As I have asked before, anyone who did the problem can u explain it to me?

Thanx in advance

Thanx Tomal for ur time. But how do i do it?

As said
Your output seems to be incorrect.
My AC solution gives 106 lines of output for N=6 , and 2353 lines of output for N=8 .

for N=6:
102510
104260
105210
105264
105750
....
....
789250
794088
809964
815958
829696
939658

for N=8:
10025010
10042510
10052010
10052064
10081260
10102252 ...

I think you are getting it all wrong. Plz check I don't think there are two same characters in a string. Mine one got AC.

Hello

1
3 6
0 1
0 2
0 4
0 5
0 7
0 8

This input should give 2.0 as we have 3 satellites so if we number the vertices
[0,1] = 1
[0,2] = 2
[0,4] = 3
[0,5] = 4
[0,7] = 5
[0,8] = 6
Kruskal will make a tree
[1->2](1.0),[3->4](1.0),[5->6](1.0),[2->3](2.0),[4->5](2.0)
If we use three satellites ...

Hello,
I think I have gone mad that I can't solve this problem. :oops:
I even tried with kruskal.

The code goes like this.
[cpp]
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAXE 510
#define MAXV 125000

#define sqr(a) ((a)*(a))

struct Point
{
long x, y ...

Hello,
Thanx gvcormac for your patience to see the code. In the above code I found some mistakes and corrected it. The bottom portion I think should be like this.

[cpp]
i = 1;
while ( S && i < N )
{
if ( !selected[t .u] && S > 0 )
{
selected[t .u] = 1;
S--;
}
else
break;
if ( !selected[t ...

I did this. Could any one plz see and tell what i'm doing wrong. The explanation is posted on my previous post. See top.

Thanx

[cpp]
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>

#define MAXV 510
#define MAXVAL 200000000L

long S, N;

struct City
{
float x, y;
}b[MAXV ...