A dozen of new tests has been added.
Time limit has been decreased to 500 ms.
All submissions have been rejudged - 58 authors have lost their AC.

need help. i used Kruskal's algorithm

My AC is 0.8 seconds, what is the idea for 0.01sec solutions?

please help!

var n,i:longint;
    a:array[1..50000] of extended;
begin
n:=0;
while not seekeof  do
begin
  n:=n+1;
  read(a[n]);
end;
for i:=n downto 1 do
  writeln(sqrt(a[i]):0:4);
end.

Edited by author 31.01.2016 20:01

Edited by author 31.01.2016 20:02

Edited by author 31.01.2016 20:02

Please give me test 11!!!=(

Решал на паскале по инструкции http://acm.timus.ru/help.aspx?topic=pascal
Вот код.
var
i :integer;
   a: int64;
   b:array[1..100] of real;
begin
{$IFNDEF ONLINE_JUDGE}
i:=1;
  assign(input, 'input.txt');
   reset(input);
   assign(output, 'output.txt');
   rewrite(output);
   {$ENDIF}
while not seekeof(input) do
begin
read(a);
b[i]:=Sqrt(a);
i:=i+1;
end;

   for i:=i-1 downto 1 do
   writeln(b[i]:1:4);
   {$IFNDEF ONLINE_JUDGE}
   close(input);
   close(output);
   {$ENDIF}
end.
Отправляю на сайт - выдает Wrong answer.

Since one paragraph says that "Each time a duelist may aim at any other alive duelist or purposely shoot in the air."

But the next one says that "The first one (let's call him A) always hits his target and always aims at the best of the living rivals."

Does it mean A always hits the guy who has greater shot accuracy?

nope.

Edited by author 30.01.2016 16:32

Edited by author 30.01.2016 16:33

I try to solve different polygons that i feign myself. And everything is OK include some special cases like two equal points or all points in the same line. But when i try to submit solution test number 2 break all my hopes. What is the input data for test 2 and expected answer?

thanks a lot

u menja uzhe gorit
proboval ispravit' vse - ne pomogaet

zada4a to4no rewaetsja na pyhon?

I've used greedy algo, but got WA3. What's wrong?

Please, help test № 9

Edited by author 21.01.2016 20:56

Edited by author 21.01.2016 20:56

import java.text.*;
import java.util.*;

public class Main {

    public static final int TREAD_MAX_SIZE = 262144;

    public static void main (String[] args) {

        DecimalFormatSymbols s = new DecimalFormatSymbols();
        s.setDecimalSeparator('.');
        DecimalFormat f = new DecimalFormat("0.0000",s);

        Scanner scan = new Scanner(System.in);

        int size = 0;
        String string = "";
        while (scan.hasNextLine()) {
            String line = scan.nextLine();
            int sizeline = line.length();
            size += sizeline;
            if (size <= TREAD_MAX_SIZE) {
                string += line;
            } else {
                break;
            }
        }
        scan.close();

        double min = 0;
        double max = Math.pow(10, 18);
        String[] str = string.trim().split("\\s+");
        for (int i = str.length - 1; i >= 0; i--) {
            Double val = Double.valueOf(str[i]);
            if (val >= min && val <= max) {
                val = Math.sqrt(val);
                System.out.println(f.format(val));
            }
        }
    }
}

What's wrong?
Code without checking the boundary conditions passed test (0 ≤ Ai ≤ 10^18 and 256КB)! Why?



Edited by author 28.01.2016 14:06

I used segment tree with update func and HashMap for indexes of elements(+). Java AC 0.34sec


Edited by author 27.01.2016 19:10

Edited by author 27.01.2016 19:38

Edited by author 27.01.2016 19:49

i have WA on test #3

my code here:

#include <iostream>
using namespace std;

int main()
{
    int n, s = 0;
    cin >> n;

    string *arr = new string[n];
    string a;
    getline(cin, a);
    for(int i = 0; i < n; i++)
    {
        getline(cin, a);
        for(int j = 0; j < i; j++)
        {
            if(a == arr[j])
            {
                s++;
                break;
            }
            else arr[i] = a;
        }
    }

    cout << s << endl;

    return 0;
}

Edited by author 26.01.2016 21:58

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;

int main()
{
    cout.setf(cout.fixed);
    cout.setf(cout.showpoint);
    cout.precision(4);
    vector <double> a;
    double c;
    while(cin>>c)
    {
        a.push_back(sqrt(c));
    }
    for(int i = a.size()-1;i>=0;i--)
        cout << a[i] << endl;
}

i have wa on 2 test.can someone help me.i'm trying to solve it with fenwick.

import java.util.Scanner;

/**
 * Created by Oxygen! on 25.01.2016.
 */
public class BitvaUBolota1991Var2 {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int x=0,y=0;
        int n=sc.nextInt();
        int k=sc.nextInt();
        int a[]=new int[n];
        for(int i=0; i<n; i++) {
            a[i]=sc.nextInt();
            if(a[i]<=0) {
                y+=k-a[i];

            } else {
                x+=a[i]-k;
            }
            System.out.println(x+" "+y);
        }
    }
}