Common Board @ Timus Online Judge

Valentin Pimenov C++ // Problem 1521. War Games 2 30 Aug 2007 19:21

Bespaly Evgeny WA#4 [2] // Problem 1513. Lemon Tale 29 Aug 2007 22:38

CHIDEMYAN SERGEY What is answer on this tests?Thank!!! [1] // Problem 1217. Unlucky Tickets 28 Aug 2007 21:27

SerailHydra Just simply Greedy [2] // Problem 1431. Diplomas 29 Aug 2007 20:56

Apiwat The upper right and the lower left don't have to be connected !!! // Problem 1033. Labyrinth 29 Aug 2007 04:47

Loky_Yuri [USTU] WA#7 [3] // Problem 1077. Travelling Tours 24 Aug 2007 15:58

Nazarov Denis (nsc2001@rambler.ru) I wonder, why I get WA? Please, help me! [2] // Problem 1130. Nikifor's Walk 27 Jan 2002 14:24

My program:

Program t1130;{$N+}

Const MaxN=10000;

Var T         :array[1..MaxN,1..3]of longint;
     N,i,j     :longint;
     L         :extended;
     Ci,Cj     :extended;
     ex        :boolean;

begin
FillChar(T,SizeOf(T),0);
Ci:=0;
Cj:=0;
Read(N,L);
for i:=1 to N do begin
   Read(T[i,1],T[i,2]);
   T[i,3]:=1;
   Ci:=Ci+T[i,1];
   Cj:=Cj+T[i,2];
end;
Repeat
ex:=true;
for i:=1 to N do
   if T[i,3]=1 then
    if Sqr(Ci-2*T[i,1])+Sqr(Cj-2*T[i,2])<Ci*Ci+Cj*Cj then begin
     T[i,3]:=-1;
     Ci:=Ci-2*T[i,1];
     Cj:=Cj-2*T[i,2];
     ex:=false;
    end
   else
    if Sqr(Ci+2*T[i,1])+Sqr(Cj+2*T[i,2])<Ci*Ci+Cj*Cj then begin
     T[i,3]:=1;
     Ci:=Ci+2*T[i,1];
     Cj:=Cj+2*T[i,2];
     ex:=false;
    end;
if (ex)and(Ci*Ci+Cj*Cj>2*L*L) then begin
   T[N,3]:=-1*T[N,3];
   Ci:=Ci+2*T[N,3]*T[N,1];
   Cj:=Cj+2*T[N,3]*T[N,2];
   ex:=false;
end;
Until ex;
   Writeln('YES');
   for i:=1 to N do
    if T[i,3]=1 then Write('+') else Write('-');
   Writeln;
end.

XueMao My program is similar to yours , but I 've got accept [1] // Problem 1130. Nikifor's Walk 29 Jul 2002 11:58

{$n+}
Program Walk;

Var i,j,k,m,n,bj:longint;
    x,y,z:double;
    a:array[1..10001,1..2] of integer;
    e:array[1..10001] of shortint;

Begin
fillchar(a,sizeof(a),0);
fillchar(e,sizeof(e),0);
read(n);
read(z);
x:=0;
y:=0;
for i:=1 to n do
begin
    e[i]:=1;
    read(a[i,1],a[i,2]);
    x:=x+a[i,1];
    y:=y+a[i,2];
end;
while x*x+y*y-2*z*z>1e-14 do
begin
    for i:=1 to n do
    if sqrt(x*x+y*y)-Sqrt(sqr(x-2*a[i,1]*e[i])+sqr(y-2*a[i,2]*e[i]))
>1e-14 then
    begin
      x:=x-2*a[i,1]*e[i];
      y:=y-2*a[i,2]*e[i];
      e[i]:=-e[i];
      if 2*z*z-x*x-y*y>1e-14 then break;
    end;
end;
writeln('YES');
for i:=1 to n do
if e[i]=-1 then write('-')
else write('+');
writeln;
End.

Iqrom_BeK Re: My program is similar to yours , but I 've got accept // Problem 1130. Nikifor's Walk 28 Aug 2007 19:47

Dont believe this programm it gets TLE on test12

check WHY WA on Test#14???? // Problem 1036. Lucky Tickets 28 Aug 2007 18:25

nickolas stoudemire Thank you // Problem 1244. Gentlemen 28 Aug 2007 11:01

alext What is wrong? C++ WA2 Pascal WA3 [2] // Problem 1413. Mars Jumper 28 Aug 2007 00:20

Bychkov=>[ProgMyaZzz] PLEASE TEST MY PROGRAM! // Problem 1190. Bar of Chocolate 27 Aug 2007 20:55

Black^n^White Compilation Error (C#) [3] // Problem 1295. Crazy Notions 30 Jan 2007 15:23

Vladimir Milenov Vasilev Is it possible such an input??? Problem 1195 [2] // Problem 1195. Ouths and Crosses 5 Mar 2002 19:03

Hayk Blrtsyan Why Compile Error [2] // Problem 1446. Sorting Hat 24 Aug 2007 17:10

Razdolbay from SIS Troubles with Java [5] // Problem 1220. Stacks 23 Aug 2007 04:11

I tried to receive accept using Java...

Now I have only one trouble:
"PrintStream System.out" saves all data which is outputted.
So it uses unnecessary almost 1MB :(

If somebody knows how to cope with it, please, tell me.

[SPbSPU]crazylammer Re: Troubles with Java [4] // Problem 1220. Stacks 25 Aug 2007 17:43

I'm not sure, but mb calling "System.out.flush()" several times while outputing can help...

Razdolbay from SIS Re: Troubles with Java [3] // Problem 1220. Stacks 26 Aug 2007 12:33

Thank you :)

I already tried...
System.out is autoflushable so flush() doesn't change anything.

Edited by author 26.08.2007 12:40

[SPbSPU]crazylammer Re: Troubles with Java [2] // Problem 1220. Stacks 27 Aug 2007 02:05

Hm... IMHO there is no place to store the previous output in java.lang.PrintStream. I think that plenty of temporary objects are creating in some operations (using Strings) in System.out.print(...). Of course they aren't deleting by the garbage collector during one-second thread lifetime.
Try to use System.out.write(byte), it seems to be OK there. (So you have to implement some boring things...).

I also had troubles with java.lang.String... Discovering O(n) performance of operator+ was at the wrong time :).

Edited by author 27.08.2007 02:05

Razdolbay from SIS Re: Troubles with Java [1] // Problem 1220. Stacks 27 Aug 2007 13:03

System.out=F;

Of course, i used exactly F.write(int), it
calls F.out.write(int) where F.out is OutputStream
which F gets from its constructor.

And how F.out is implemented, i don't know...
And don't know where it can be read about :(

Btw... I tried to use garbage collector with hands, it uses 1.5M itself :(

>> I also had troubles with java.lang.String... Discovering O(n) performance of operator+ was at the wrong time :).

Thank you for experience =)

Edited by author 27.08.2007 13:05

[SPbSPU]crazylammer Re: Troubles with Java // Problem 1220. Stacks 27 Aug 2007 13:31

Source code of all java libraries is fully avalible, there is the src.zip file in the root folder of JDK. That code isn't so complicated.

In this problem... I've tried to submit code like this:

public class A {
    public static void main(String[] args) {
        int[]a = new int[100000]; //to get ML, not OL, the size was different - I can't remember it
        for(int i = 0; i < 100000; ++i) { //also 100000 isn't true
            //System.out.print('1'); - case 1
            //System.out.write((int)'1'); - case 2
        }
    }
}

Case 1 got ML, but case 2 uses the same amount of memory like the code without any output..

Edited by author 27.08.2007 13:34

AlexF [USTU Frogs] WA#12 Hint // Problem 1416. Confidential 26 Aug 2007 19:19

Fu Dong I just used DFS and got AC with 0.001s! [3] // Problem 1115. Ships 20 May 2005 15:30

mathfrog test #3 is quite werid [1] // Problem 1024. Permutations 25 Aug 2007 19:12

<-UnderFelixAbove-> Troubles with itoa // Problem 1222. Chernobyl’ Eagles 26 Aug 2007 03:17

Alias (Alexander Prudaev) statement of problem is not logistical // Problem 1156. Two Rounds 25 Aug 2007 17:03