I submit prim's realization that got AC at olympiads.ru. Also i submitted kruskal's realization that got AC at some past contest. Why both AC programms can't pass test #1? can somebody give me tricky test cases?

Hi!

I used greedy, but I get WA on #12!

Can somebody help me?

Nevermind, I found my problem in the code.

Edited by author 24.04.2010 02:55

thank you!

...Выяснилось, то данный модуль был написан 8 лет назад, к первому Чемпионату Урала, и его исходные коды за это время успели потерятся...

нужен мягкий знак в слове "потерятЬся"

It is my program.
program sad;
var
tu:array[1..100,1..100] of int64;
d,p:array[1..1000] of int64;
f:array[1..1000] of boolean;
k,pre,pree:array[1..1000] of int64;
a:array[1..90,1..6,1..8] of int64;
ii,jj,w,i,j,m,n,u,v,bit,l,r,t,q,sum,g,i1,i2,i3,i4,n1,n2,n3,n4:longint;
c:char;s:string;

function pd:boolean;
var w:longint;
begin
for w:=1 to 4 do
if  a[i,j,w]<>a[ii,jj,w] then exit(false);
exit(true);
end;




procedure spfa(s:longint);
var i,j,k,h,t,x:longint;
begin

fillchar(f,sizeof(f),false);
fillchar(p,sizeof(p),0);
for i:=1 to n do
d[i]:=maxlongint shr 1;
f[s]:=true;
t:=1;
h:=0;
d[s]:=0;
p[t]:=s;
 while h<>t do
 begin
h:=(h mod n)+1;
x:=p[h]; f[x]:=false;
for j:=1 to n do
  if (tu[x,j]<>0) and   (d[x]+tu[x,j]<d[j])  then
  begin
  d[j]:=d[x]+tu[x,j];
  if not f[j] then
  begin
  t:=(t mod n) +1;  p[t]:=j; f[j]:=true;
  pre[j]:=x;
  end;
  end;
 end;
end;


begin
readln(n);
for i:=1 to n do
begin
readln(k[i]);
for j:=1 to k[i] do
begin
readln(s);
g:=pos('.',s);val(copy(s,1,g-1),i1);delete(s,1,g);
g:=pos('.',s);val(copy(s,1,g-1),i2);delete(s,1,g);
g:=pos('.',s);val(copy(s,1,g-1),i3);delete(s,1,g);
g:=pos(' ',s);val(copy(s,1,g-1),i4);delete(s,1,g);
g:=pos('.',s);val(copy(s,1,g-1),n1);delete(s,1,g);
g:=pos('.',s);val(copy(s,1,g-1),n2);delete(s,1,g);
g:=pos('.',s);val(copy(s,1,g-1),n3);delete(s,1,g);
val(s,n4);
a[i,j,1]:=i1 and n1;
a[i,j,2]:=i2 and n2;
a[i,j,3]:=i3 and n3;
a[i,j,4]:=i4 and n4;
end;
end;
for i:=1 to n do
for ii:=1 to n do
for j:=1 to k[i] do
for jj:=1 to k[ii] do
begin
if not pd then break;
tu[i,ii]:=1;
tu[ii,i]:=1;
end;
readln(l,r);
spfa(l);
q:=r;
sum:=0;
while q<>0 do
begin
inc(sum);
pree[sum]:=q;
q:=pre[q];
end;
if (sum>1) and (sum<>0) then begin
writeln('Yes');
for i:=sum downto 1 do
write(pree[i],' '); end else
write('No');
writeln;
end.

WA at 5# ~~
Help me~!

I found my stupid mistake!

need have only one:
#include <cmath>

Edited by author 30.04.2010 02:30

I think, that there was no adjustment to the "order of the computers" for output in problem "Output" paragraph. I think, that it was no difference between direct path and reverse path.
So, for example code, that printed
Yes
1 3 5 6
was Accepted, but code, that printed
Yes
6 5 3 1
was rejected.

New tests were added. 196 authors lost AC after rejudge.

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N=100;
int main()
{
    int n,i,k;
    int x[N],y[N];
    string z[N];
    int total_s=0,total_h=0;
    cin>>n;
    cin>>ws;
    for(i=0;i<n;i++)
    {
        getline(cin,z[i]);
    }
    for(i=0;i<n;i++)
    {
        if(z[i][2]=='s')
        {
            y[total_s++]=z[i][0]-48;
        }
        if(z[i][2]=='h')
        {
            x[total_h++]=z[i][0]-48;
        }
    }
    sort(x,x+total_h);
    sort(y,y+total_s);
    if(total_s==0)
    {
        cout<<"10"<<endl;
    }
    else
    {
        if(y[0]<=x[total_h-1])
        {
            cout<<"Inconsistent"<<endl;
        }
        else
        {
            cout<<y[0]<<endl;
        }

    }
    return 0;
}

From the statement it is not obvious whether the triangle isosceles with AiMi = Ai+1Mi or some other legs equality. I think it is worth adding that to the statement.

I think, the tests for this problem are not very good. In my code i forgot to check the case, where x or y are not positive, but i get AC. I think, that there must be a test case like that: -2 1.

run_id = 2970301
test:
10 10
1 1
10 10
1211211212
2111221212
2221001111
1112112012
2112102112
2111200222
1112021212
2222011211
2112222222
2012122122
right_answer: 12 1
my program produces answer 14 1

I found that an AC program(by others) gave me a incorrect answer in this test:
#XO
X#O
X#O
my program outputs:Ouths win
but the AC program outputs:Crosses win

So i think this test should be added up and the problem should be rejudged.thanks.

Getting WA in case number 2. Do anyone know what is test #2???? Please help.

Algorithm right, but what in 8 test? Please, give me test;

OH I've found my mistake!!!!!

Edited by author 19.04.2010 17:58

Edited by author 19.04.2010 17:59

I have a good test. Can you add it?

#include<iostream>
using namespace std;
double a[100],s1,s2;
int n;
void read()
{
    int i;
    cin>>n;
    for(i=0;i<n;i++) cin>>a[i];
}
void z()
{
    int i;
    s1=a[0];
    for(i=1;i<n;i++)
    {
        if(s1<s2) s1+=a[i];
        else s2+=a[i];
    }
    if(s1<s2) cout<<s2-s1<<endl;
    else cout<<s1-s2<<endl;

}

int main ()
{
    read();
    z();
    return 0;
}

Edited by author 03.11.2009 03:34