Автор: Bronislav

Bronislav — Mon, 18 Feb 2019 13:28:09 +0000

1. Решение для электронного задачника PT4:

program Dynamic25; //pabc.net
  
uses PT4;

type
  TQueue = record
    head, tail: PNode;
  end;

function QueueIsEmpty(Q: TQueue) := Q.head = nil;

function Peek(Q: TQueue) := Q.head^.data;

procedure MoveQueue(var Q1, Q2: TQueue);
begin
  if Q2.head <> nil then
  begin
    if Q1.head = nil then
      Q1.head := Q2.head
    else
      Q1.tail^.next := Q2.head;
    Q1.tail := Q2.tail;
    Q2.head := nil;
    Q2.tail := nil;
  end;
end;

procedure EnqueueNode(var Q: TQueue; p: PNode);
begin
  if p = nil then exit;
  if Q.tail = nil then
  begin
    Q.tail := p;
    Q.head := p
  end
  else
  begin
    Q.tail^.next := p;
    Q.tail := p;
  end;
end;

function DequeueNode(var Q: TQueue): PNode;
begin
  if Q.head = nil then exit;
  Result := Q.head;
  Q.head := Q.head^.next;
  if Q.head = nil then
    Q.tail := nil;
  Result^.next := nil;
end;

begin
  Task('Dynamic25');
  var Q1, Q2: TQueue;
  Read(Q1.head, Q1.tail, Q2.head, Q2.tail);
  var Q3: TQueue := (head: nil; tail: nil);
  
  while not QueueIsEmpty(Q1) do
  begin
    if QueueIsEmpty(Q2) then
      MoveQueue(Q3, Q1)
    else
    begin
      if Peek(Q1) < Peek(Q2) then
        EnqueueNode(Q3, DequeueNode(Q1))
      else
        EnqueueNode(Q3, DequeueNode(Q2))
    end
  end;
  
  MoveQueue(Q3, Q2);

  Writeln(Q3.head, Q3.tail)
end.

program Dynamic25; //pabc.net

uses PT4;

type

TQueue = record

head, tail: PNode;

end;

function QueueIsEmpty(Q: TQueue) := Q.head = nil;

function Peek(Q: TQueue) := Q.head^.data;

procedure MoveQueue(var Q1, Q2: TQueue);

begin

if Q2.head <> nil then

begin

if Q1.head = nil then

Q1.head := Q2.head

else

Q1.tail^.next := Q2.head;

Q1.tail := Q2.tail;

Q2.head := nil;

Q2.tail := nil;

end;

procedure EnqueueNode(var Q: TQueue; p: PNode);

begin

if p = nil then exit;

if Q.tail = nil then

begin

Q.tail := p;

Q.head := p

end

else

begin

Q.tail^.next := p;

Q.tail := p;

end;

function DequeueNode(var Q: TQueue): PNode;

begin

if Q.head = nil then exit;

Result := Q.head;

Q.head := Q.head^.next;

if Q.head = nil then

Q.tail := nil;

Result^.next := nil;

end;

begin

Task('Dynamic25');

var Q1, Q2: TQueue;

Read(Q1.head, Q1.tail, Q2.head, Q2.tail);

var Q3: TQueue := (head: nil; tail: nil);

while not QueueIsEmpty(Q1) do

begin

if QueueIsEmpty(Q2) then

MoveQueue(Q3, Q1)

else

begin

if Peek(Q1) < Peek(Q2) then

EnqueueNode(Q3, DequeueNode(Q1))

else

EnqueueNode(Q3, DequeueNode(Q2))

end

end;

MoveQueue(Q3, Q2);

Writeln(Q3.head, Q3.tail)

end.

2. Решение с заполнением очередей.
Все типы и подпрограммы описаны в модуле MyQueue. Большинство используемых подпрограмм можно увидеть выше, в решении для электронного задачника PT4. Остальные в Pointer22.

program Dynamic25; //pabc.net

uses MyQueue;

begin
  var Q1: TQueue := (head: nil; tail: nil);
  var Q2: TQueue := (head: nil; tail: nil);
  var Q3: TQueue := (head: nil; tail: nil);
  
  // создаем первую очередь
  foreach var data in Range(1, 20, 2) do
    Enqueue(Q1, data);
  
  // создаем вторую очередь
  foreach var data in Range(2, 10, 2) do
    Enqueue(Q2, data);
  
  while not QueueIsEmpty(Q1) do
  begin
    if QueueIsEmpty(Q2) then
      MoveQueue(Q3, Q1)
    else
    begin
      if Peek(Q1) < Peek(Q2) then
        EnqueueNode(Q3, DequeueNode(Q1))
      else
        EnqueueNode(Q3, DequeueNode(Q2))
    end
  end;
  
  MoveQueue(Q3, Q2);
  
  Writeln(Q3.head, ' ', Q3.tail)  
end.

program Dynamic25; //pabc.net

uses MyQueue;

begin

var Q1: TQueue := (head: nil; tail: nil);

var Q2: TQueue := (head: nil; tail: nil);

var Q3: TQueue := (head: nil; tail: nil);

// создаем первую очередь

foreach var data in Range(1, 20, 2) do

Enqueue(Q1, data);

// создаем вторую очередь

foreach var data in Range(2, 10, 2) do

Enqueue(Q2, data);

while not QueueIsEmpty(Q1) do

begin

if QueueIsEmpty(Q2) then

MoveQueue(Q3, Q1)

else

begin

if Peek(Q1) < Peek(Q2) then

EnqueueNode(Q3, DequeueNode(Q1))

else

EnqueueNode(Q3, DequeueNode(Q2))

end

end;

MoveQueue(Q3, Q2);

Writeln(Q3.head, ' ', Q3.tail)

end.

Комментарии: Решаем задачи Абрамян на Паскале. Pointer25

Автор: Bronislav