ac1196.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1196;
const
  maxn=1000;
var
  dist:array[0..maxn]of word;
  n,a0,b0,l0,a1,b1,l1,i,j:integer;
  flag:boolean;
procedure update(u,v,a,b:integer);
  var
    t:integer;
  begin
    t:=dist[u]+a;if t>dist[v] then begin dist[v]:=t;flag:=true;end;
    t:=dist[v]-b;if t>dist[u] then begin dist[u]:=t;flag:=true;end;
  end;
begin
  repeat
    read(n,a0,b0,l0,a1,b1,l1);
    i:=l0-a0;a0:=l0-b0;b0:=i;

    fillchar(dist,sizeof(dist),0);dist[0]:=0;
    for i:=1 to n do begin
      flag:=false;
      for j:=1 to n do update(j-1,j,0,1);
      for j:=l0 to n do update(j-l0,j,a0,b0);
      for j:=l1 to n do update(j-l1,j,a1,b1);
      if not flag then break;
    end;

    if flag then
      writeln(-1)
    else begin
      for i:=1 to n do
        write(dist[i]-dist[i-1]);
      writeln;
    end;
  until seekeof;
end.