Why WA#8?

I got WA at test18, can somebody give some test or hint, please?

It could be proven that for n != 4 there is always 'NO' answer.
Is it right for each test?

i've got memory limit on test #3 what can i do???
i use array of int64[1..200000]

Edited by author 11.04.2010 19:24

Edited by author 11.04.2010 19:41

When I wrote my first version, I had TLE#13.
I optimize it - Crash#13.
Help me with tests or hints. Please.
Thanks.

Edited by author 10.05.2006 20:37

what's wrong?
program t1688;
var
  h:array [1..3000] of int64;
  a,p:int64;
  n,m:int64;
  b,i,j:longint;
begin
  readln(a,b);
  for i:=1 to b do
    readln(h[i]);
  for i:=1 to b-1 do
    for j:=b downto i+1 do
    begin
      if h[i]>h[j] then
      begin
        p:=h[i];
        h[i]:=h[j];
        h[j]:=p;
      end;
    end;

  for i:=1 to b do
  begin
    m:=m+h[i];
    if a*3<m then inc(n);
  end;
  if n=0 then writeln('Team.GOV!')
  else writeln('Free after ',b-n,' times.');
end.



Edited by author 16.04.2010 11:37

Any help?

problem solved
Edited by author 13.04.2010 14:37

Edited by author 13.04.2010 14:37

I got WA6 in this case:
if (inc1 == inc2) {
    cout << labs(cr2x - cr1x) + labs(cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

but I got AC in this case:
if (inc1 == inc2) {
    cout << (cr2x - cr1x) + labs(cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

and in this case:
if (inc1 == inc2) {
    cout << labs(cr2x - cr1x) + (cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

and in this:
if (inc1 == inc2) {
    cout << (cr2x - cr1x) + (cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

p.s. cr1x, cr1y, cr2x, cr2y is long long, (cr2x - cr1x)>=0 and (cr2y - cr1y)>=0 always, but why in this case does not labs() work correctly ?

0.001 142 КБ

let a[i] stand for the member of party i;
sort it to make a[1]<a[2]<...<a[n]
for i:=1 to (k+1) div 2 do inc(answer,(a[i]+1) div 2);
the answer is sure to be the best one.

Pleeeeeseee!!!

any suggestion?

Edited by author 12.04.2010 19:19

Edited by author 12.04.2010 19:20

program ministerstvo;
var a,n,i,b,j,k,p,l:longint;
    s,w,q,r:string;
begin
readln(s);
readln(w);
n:=length(s);
k:=length(w);
i:=1;
j:=1;
l:=1;
p:=1;
while i<n do begin
if s[i]<>w[j] then begin
while s[p]<>w[l] do begin
if s[p]=' ' then
s[p]:=' ' else
s[p]:='_';
p:=p+1;
i:=i+1;
end;
end;
if s[i]=w[j] then begin
i:=i+1;
j:=j+1;
l:=j;
p:=i;
end;
end;
k:=0;
for i:=1 to n do
if s[i]<>'_' then k:=k+1;
if k<length(w) then
writeln('I HAVE FAILED!!!')
else
begin
if w[length(w)]=s[n] then
write(s[i])
else
begin
for i:=1 to n-1 do
write(s[i]);
end;
end;
end.

WHERE IS MY MISTAKE???

#include <iostream>
#include <cmath>
using namespace std;
int main ()
{
    int a[100000],n,i,s1=0,s2=0,min;
    cin>>n;
    for (i=1;i<=n;i++)
    cin>>a[i];
    for (i=1;i<=n;i++)
    {
        if (s1>s2)  s2+=a[i];
        else if (s1==s2) s1+=a[i];
        else s1+=a[i];
    }
    min=abs (s1-s2);
    cout<<min<<endl;
    return 0;
}

8
3 7 9 11 13 18 21 42

my dynamic programming solution isn't really dynamic programming solution, because this test ruined it. facinating is that, when test is written back to front answer is right.

answer is 0, my is 2.

sorry for my magnificent english.
=)

Edited by author 11.04.2009 18:41

2 -1
-2 0
0 2
0 -2

answer: 1

Sorry, but get tired of it. Are there any suggestions, what checks test #3?

HINT: dec(Ep);dec(Dp); //for Pascal
      Ep--;Dp--; //for C/C++