var n,i: integer;
x1,x2,y2,y1,xx,yy,e,r: real;
begin
 readln(n,r);
 readln(x1,y1);
 yy:=y1; xx:=x1;
 for i:=2 to n do
  begin
   readln(x2,y2);
   e:=e+sqrt(sqr(x2-x1)+sqr(y2-y1));
   x1:=x2; y1:=y2;
  end;
writeln((round((e+2*3.14159*r+sqrt(sqr(xx-x1)+sqr(yy-y1)))*100))/100);
end.

I'm using Heavy light Decomposition an I'm getting ML in test 9 WHY ????

could you give me test #7?
I can not  understand what is wrong!

I have Wa#4. Please help me!
#input
5 5
ooooo
ooooo
ooooo
ooooo
ooooo
2
1
13
#output
???

Edited by author 20.11.2014 20:26

I use fgets to read from stdin, when I try to store name in an array with length 201, i got WA 3,but when I changed the length to 210, I got AC, who can tell me why?

Hi,
This is my code:

#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>

using namespace std;

int main()
{
vector<int> V;
V.resize(0);
int n;

cin >> n;
while( n != EOF) {
    V.resize(V.size() + 1);
    V.push_back(n);
    cin >> n;
}

cout << setprecision(4) << fixed ;
while(V.size() > 0) {
n  = V.back();
V.pop_back();
cout << sqrt(n) << endl;
}

return 0;
}

Could someone please tell me why the memory got exceeded here ? The stream is just 256 KB, right ?

Regards,
Ankita

try

1
1
i

It helps me

Кт-т упрлс тк услв псть

Give me some tests please

#include <stdio.h>
#include <stdlib.h>

struct Team
  {
  int id;
  int m;
  };

int main()
  {
  int n;
  struct Team * res;

  scanf ("%d", &n);
  res = (struct Team*)malloc( n * sizeof(struct Team) );

  for (int i = 0; i < n; i++)
    scanf ("%d %d", &res[i].id, &res[i].m);

  struct Team tmp;

  for (int i = 0; i < n-1; i++)
    for (int j = 0; j < n-1; j++)
      if (res[j].m < res[ j+1 ].m)
        {
          tmp = res[j];
          res[j] = res[ j+1 ];
          res[ j+1 ] = tmp;
        }

  for (int i = 0; i < n; i++)
    printf ("%d %d\n", res[i].id, res[i].m);

  return 0;
  }

Simple test for programs with verdict WA #14:

Sample input:
0
2
1
1

Sample output
1 2

Your program outputs "-1"? Find your simple stupid mistake!!!

Edited by author 05.11.2005 18:58

How to prevent TLE? I use LinkedList (can AddFirst and AddLast) and use max size of set = n.

#define EPS 0.000001

you can use to check "YES" that simple DSU algorithm.
because DSU algorithm gives us all cycle, knot, multigraph ... so on

ошибка на тесте №2

Можете отправить работающую программу,если не сложно.Долго уже пытаюсь,не получается:(

Вот код:
#include <iostream>
using namespace std;

int main()
{
int k, n;
cin >> k >> n;

int a;
int sum = 0;
 for( int i = 0; i < n; i++ )
 {
   cin >> a;
   sum += a;
 }

if( ( sum - n * k ) < 0 )
cout << 0;
else
cout << sum - n * k;

return 0;
}
на тесте 6 загибается в чом проблемма?