MRAVI

Posted 2021-01-10 godrose

题面：

 

思路：

       蚂蚁问题，转头可以忽略不计。模拟。

       注意L从0开始计算。

代码：

var t,n,len,i:longint;
 a:array[0..100005] of longint;
  ch,rrr:char;

    procedure sort(l,r: longint);
      var
         i,j,x,y: longint;
      begin
         i:=l;
         j:=r;
         x:=a[(l+r) div 2];
         repeat
           while a[i]<x do
            inc(i);
           while x<a[j] do
            dec(j);
           if not(i>j) then
             begin
                y:=a[i];
                a[i]:=a[j];
                a[j]:=y;
                inc(i);
                j:=j-1;
             end;
         until i>j;
         if l<j then
           sort(l,j);
         if i<r then
           sort(i,r);
      end;

begin

assign(input,‘mravi.in‘);
reset(input);
assign(output,‘mravi.out‘);
rewrite(output);

read(len,t,n);
t:=t mod (2*len);
for i:=1 to n do
 begin
  read(a[i]);
  read(rrr,ch);
  if ch=‘L‘ then
   begin
    if a[i]<t then
     begin
      a[i]:=t-a[i];
      if a[i]>len then a[i]:=len-(a[i]-len);
     end else a[i]:=a[i]-t;
   end;
  if ch=‘D‘ then
   begin
    if a[i]+t>len then
     begin
      a[i]:=len-(t-(len-a[i]));
      if a[i]<0 then a[i]:=a[i]*(-1);
     end else a[i]:=a[i]+t;
   end;
 end;

sort(1,n);

for i:=1 to n do write(a[i],‘ ‘);


close(input);close(output);
end.