The answers of the tests aren't unique. For example for the first sample test my AC program outputs 4.564191068 4.136298156 5.377150309. It can be also 0 0 (and the respective radius). But don't forget to check if the coordinates of your answer don't coincide with some from the input.

length of convex hull + 2 * PI * l :D

Can you have me why solution is 1628 ??

What the 17 test? why WA?
armenia1993@mail.ru
int charact(int v) {
    used[v] = true;
    vector<int> dp;
    for (int i=0; i<g[v].size(); ++i) {
        int to = g[v][i];
        if (!used[to])
            dp.push_back(charact(to));
    }
        if (dp.size() == 0)
            return 0;
        sort(dp.begin(), dp.end());
        for (int i=dp.size(); i>0;--i)
            dp[i-1] += dp.size() - i + 1;
        return *max_element(dp.begin(), dp.end());
}

#include <iostream>
#include <stdio.h>
#include <math.h>

using namespace std;

int main(void){
    double a[300];
    unsigned long int n;
    short int i=0, k=0;
    while (cin>>n){
        k++;
        a[k]=sqrt((double)n);
    }
    for (i=k; i>0; i--){
        printf("\n%.4f",a[i]);
    }
    return(0);
}

I don't know where the error =(

Edited by author 20.05.2012 23:10

if unconnected graph, alway maximal difference is 49.
if connected graph ??


AC!!! I found bug!!!

Edited by author 22.12.2011 21:28

Edited by author 22.12.2011 21:28

#include<iostream>
#include <stdio.h>
using namespace std;

int main(){
    freopen("in.txt", "r", stdin);
    int i = 0;
    double mas[9310];
    cin >> mas[i];
    while(mas[i]>=0) {
        i++;
        cin >> mas[i];
    }
    for(int k = i-1; k>=0; k--)
        printf("%.4lf\n",sqrt(mas[k]));
}

При проверки программы на сайте выдается время работы программы, как это можно самому проверить?
When checking program on the site is issued by the time of work program, as this is the test?

Program p1019;

Const MaxN = 6000;

Var S : Array[1..MaxN, 1..2]of Longint;
    Del : Array[1..MaxN]of Byte;
    N, s0, ai, bi : Longint;
    ci : Char;

Procedure Check;
Var i, j, k : Longint;
  begin
    k := 0;
    for i := 1 to s0 do begin
      if i > s0 - k then break;
      if (Del[i] = 1) or (S[i, 1] = S[i, 2]) then begin
        k := k + 1;
        for j := i to s0 - 1 do
          S[j] := S[j + 1];
      end;
    end;
    s0 := s0 - k;
  end;

Procedure Black;
Var i, ts0 : Longint;
  begin
    FillChar(Del, SizeOf(Del), 0);
    ts0 := s0;
    for i := 1 to s0 do
      if (ai <= S[i, 1]) and (bi >= S[i, 1]) and (bi <= S[i, 2]) then
        S[i, 1] := bi else
      if (ai >= S[i, 1]) and (ai <= S[i, 2]) and (bi >= S[i, 2]) then
        S[i, 2] := ai else
      if (ai <= S[i, 1]) and (bi >= S[i, 2]) then
        Del[i] := 1 else
      if (ai >= S[i, 1]) and (bi <= S[i, 2]) then begin
        ts0 := ts0 + 1;
        S[ts0, 1] := bi;
        S[ts0, 2] := S[i, 2];
        S[i, 2] := ai;
      end;
    s0 := ts0;
    Check;
  end;

Procedure Merge;
Var i, j : Longint;
    ex : Boolean;
  begin
    FillChar(Del, SizeOf(Del), 0);
    While True do begin
      ex := true;
      for i := 1 to s0 - 1 do
        if Del[i] = 0 then
          for j := i + 1 to s0 do
            if Del[j] = 0 then
              if (S[i, 1] <= S[j, 1]) and (S[i, 2] >= S[j, 1]) then
begin
                if S[j, 2] > S[i, 2] then S[i, 2] := S[j, 2];
                Del[j] := 1;
                ex := false;
              end else
              if (S[i, 1] <= S[j, 2]) and (S[i, 2] >= S[j, 2]) then
begin
                if S[j, 1] <= S[i, 1] then S[i, 1] := S[j, 1];
                Del[j] := 1;
                ex := false;
              end else
              if (S[i, 1] >= S[j, 1]) and (S[i, 2] <= S[j, 2]) then
begin
                Del[i] := 1;
                ex := false;
              end else
              if (S[j, 1] >= S[i, 1]) and (S[j, 2] <= S[i, 2]) then
begin
                Del[j] := 1;
                ex := false;
              end;
      if ex then break;
    end;
  end;

Procedure WriteIt;
Var L, R, i : Longint;
  begin
    L := 0; R := 0;
    for i := 1 to s0 do
      if (S[i, 2] - S[i, 1] > R - L) or
         ((S[i, 2] - S[i, 1] = R - L) and (S[i, 1] < L)) then begin
        L := S[i, 1];
        R := S[i, 2];
      end;
    Writeln(L, ' ', R);
  end;

begin
  S[1, 1] := 0; S[1, 2] := 1000000000;
  s0 := 1;
  Readln(N);
  While N > 0 do begin
    N := N - 1;
    Readln(ai, bi, ci, ci);
    if ai >= bi then Continue;
    if ci = 'b' then
      Black
    else begin
      s0 := s0 + 1;
      S[s0, 1] := ai;
      S[s0, 2] := bi;
    end;
  end;
  Merge;
  WriteIt;
end.

I got AC, but on test:

6
0 30
10 70
20 80
40 110
90 130
120 140

my AC program output:
2
0 30
90 130

but answer must be:
3
0 30
40 110
120 140

Something is wrong with test 11. When I wrote

while (scanf("%d", &n) >= 1)
{
  ...
}

I got WA11. But when I wrote

while (scanf("%d", &n) >= 1)
{
  ...
  break;
}

I got AC.

what is test 5??

what is test 12????

What's the second test?? Any hints??

I have a TL#10, I did Dijkstra's algarithm !!! Tel me please better algarithm than Dijkstra.

what's wrong about my code ? Why it is wrong answer on test 5?

zzz

Edited by author 17.05.2012 17:06

Edited by author 17.05.2012 17:06

give me wrong test, please
{$n+}
[be ili ne be] spasibo toliany


Edited by author 10.01.2006 02:12

Help!!!


import java.util.*;
public class Ll {
    public static class Line implements Comparable{
        int a,b;
        Line(int x, int y){
            a = x;
            b = y;
        }
        public int compareTo(Object obj){
            Line tmp =  (Line)obj;
            if (this.b>tmp.b) return 1;
            if (this.b<tmp.b) return -1;
            return 0;
        }
    }


    public static void main(String args[]){
        Scanner stream = new Scanner(System.in);
        short M  = stream.nextShort();
        ArrayList<Line> arL = new ArrayList<Line>();
        arL.add(new Line(stream.nextInt(), stream.nextInt()) );
        while(true){
            int a=stream.nextInt(), b=stream.nextInt();
            if ((a==0)&&(b==0)) break;

            if((b>0)&&(a<M))
                for (int i=0;i<arL.size();i++){
                    if  ((arL.get(i).a>=a) && (arL.get(i).b<=b)){
                        arL.set(i,new Line(a,b)) ;}
                    else  {if (!((arL.get(i).a<=a) && (arL.get(i).b>=b)))
                    arL.add(new Line(a,b));} break;
                }
            }


        if(arL.size()==0) {
            System.out.println("No solution");
            return;
        }
        arL.trimToSize();
        Collections.sort(arL);
         ArrayList<Integer> arV= new ArrayList<Integer>();
        int i=arL.size()-1,F =0;
        while ((i>=0)&&(arL.get(i).b>0)){


            if (arL.get(i).a<=F){
                F=arL.get(i).b;
                arV.add(i);
                i = arL.size();
            }

            if (F>=M){
                System.out.println(arV.size());
                for (int g= 0;g<arV.size();g++){
                    System.out.println(arL.get(arV.get(g)).a + " "+ arL.get(arV.get(g)).b);

                }
                return;

            }
            i--;
        }
        System.out.println("No solution");
    }


}