i've got a data:array[0..80000] of longint for save numbers and got AC! why there aren't tests like 100000 operators:
100000
PUSH 1 1
PUSH 1 2
...
PUSH 1 100000    ?

funny: data:array[0..100000] gives MLE 1
data:array[0..50000] gives WA 16
data:array[0..90000] gives WA 10
data:array[0..80000] gives AC...

Can anybody give me an idea(push) how to solve this problem using interval tree?
Thx

Если программа, которую выводит моя программа, работает дольше 1 секунды, какой вердикт я получу?

Excuse me, I have next problem: I have got 'compilation error' twice because of using function round() from library 'cmath'. But it works normally in Code::Blocks on my PC. What is the problem and how can I substitute round function?

As they changed the compiler, I tried to re-submit some of my solutions, (in order to get a higher rank in the Rating page :)  )
In that problem 1100, there's lots of I/O staff, so I wrote a brief function to accelerate. Generally, it tried to in/output numbers by characters, using getchar() and putchar(). It did work.
However, I find the result now very disappointing. Previously 0.046s, but now 0.291s. Even slower than to use scanf() and printf() !!
I don't know why this happens, but I hope there's some way to improve...

Why there is no koefficient for these two languages?
Yes, we know that these langs are a little bit slower then C++/C/Pascal, but why not to add some multiplier(коэффициент, множитель) for java/c# when counting MLE/TLE?
I think it will be fair, 'cause really some of us (may be not some, but a big half) doesnt know C++/C and they dont need to learn them, 'cause they (for example) participate in contest like TopCoder, CodeForces where solution always possible in any language(dont speak about script langs on CodeForces).

So maybe some good changes?

PS.
I thought about this trying to solve problem "Stacks" ( http://acm.timus.ru/status.aspx?space=1&num=1220&author=73720 ) in C#... but its unreal to get even 500KB (my empty program, without any vars, structs and so on uses ~800-900KB) But if substract for example 700kb from these 800-900 we have 100-200 kb empty working program on C#, so maybe its possible to solve some low memory problems using right technics.

Thx for reading and responding :)

Edited by author 05.08.2010 13:03

Edited by author 06.08.2010 21:26

Edited by author 06.08.2010 13:36

Edited by author 06.08.2010 14:20

Is it possible to solve some problems using less then 1 MB in C# ?
I tried 1010 problem to solve, but less then 941 KB I cannot do... :( it's bad...
May be there are some tricks to lower memory consumption ?

Thx.

PS
If code neded - just say, I will show.. maybe some ideas will appear.

Edited by author 03.08.2010 21:17

using System;
using System.Collections.Generic;

namespace Task_1020
{
    public class Program
    {
        private struct Point {
            public double X { get; set; }
            public double Y { get; set; }
        }
        public static void Main() {
            Point nR = Read();
            double n = nR.X;
            double r = nR.Y;

            var points = new List<Point>((int)n);
            for (int i = 0; i < n; i++) {
                points.Add(Read());
            }

            double l = 2*Math.PI*r;

            if (n == 1) {
                Console.Write(String.Format("{0:f2}", l).Replace(',', '.'));
            }
            else {
                l += ComputeLength(points[0], points[(int) (n - 1)]);

                for (int i = 0; i < n - 1; i++) {
                    l += ComputeLength(points[i], points[i + 1]);
                }
                Console.Write(String.Format("{0:f2}", l).Replace(',', '.'));
            }

        }

        private static double ComputeLength(Point p1, Point p2) {
            return Math.Sqrt(Math.Pow(p1.X - p2.X, 2)
                + Math.Pow(p1.Y - p2.Y, 2));
        }

        private static Point Read () {
            var twoNum = Console.ReadLine().Split(' ');
            twoNum[0] = twoNum[0].Replace('.', ',');
            twoNum[1] = twoNum[1].Replace('.', ',');
            return new Point {X = Double.Parse(twoNum[0]), Y = Double.Parse(twoNum[1])};
        }
    }
}

Random shuffle of matrix`s rows help me to avoid TLE

Someone who solved this problem, give some ideas, please.

If you encounter any problems please describe it in this thread.

1) I used Dictionary<,> and had crash 4, 'cause there were equal words.
2) For example you have two(three) words like:
akt
blu
ckv

*they all have code 258, so you can take any of these words.

These two "bugs" after fixing gave me AC with 0.14 time and ~9MB on C#.

Good Luck.

Edited by author 04.08.2010 14:08

I got AC with interval tree. but it's so painful coding it. How to do it with segment tree? The range is too large...

please help.

thanks in advance

Can anyone tell me what does the problem say in short ?
This problem is too long to read...-.-"

I thought that we must do with heads (n) next:
2*2*2*...*(n div 2)      ---> for odd(n)=false and
2*2*2*...*3*((n-3) div 2)---> for odd(n)=true.
What why answer for n=:
5-->2*3=6
6-->2*2*2=8
7-->2*2*3=12
8-->2*2*2*2=16
9-->2*2*2*3=24
but when I write solution, a saw that ans
for 6=3*3=9(not an 8),
for 9=3*3*3=27(not a 24).
COULD YOU HELP ME WITH RIGHT IDEA?

Edited by author 29.05.2006 18:25

does anyone know what's the Test 5 ?

Or can sent some tests.

Thx

Try to find minimal and maximal distance between figure's center and border, and think about possible shapes.