Submission #7202387

---

Source Code Expand

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
  int k, m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    putchar_unlocked(c[i]);
  }
}
int SX;
int SY;
int TX;
int TY;
char res[100000];
int ress;
int main(){
  int a, b, i;
  rd(SX);
  rd(SY);
  rd(TX);
  rd(TY);
  a = TX - SX;
  b = TY - SY;
  for(i=0;i<(a);i++){
    res[ress++] = 'R';
  }
  for(i=0;i<(b);i++){
    res[ress++] = 'U';
  }
  for(i=0;i<(a);i++){
    res[ress++] = 'L';
  }
  for(i=0;i<(b+1);i++){
    res[ress++] = 'D';
  }
  for(i=0;i<(a+1);i++){
    res[ress++] = 'R';
  }
  for(i=0;i<(b+1);i++){
    res[ress++] = 'U';
  }
  res[ress++] = 'L';
  res[ress++] = 'U';
  for(i=0;i<(a+1);i++){
    res[ress++] = 'L';
  }
  for(i=0;i<(b+1);i++){
    res[ress++] = 'D';
  }
  res[ress++] = 'R';
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20190829-1

// --- original code ---
// int SX, SY, TX, TY;
// char res[1d5]; int ress;
// {
//   int a, b;
//   rd(SX,SY,TX,TY);
//   a = TX - SX;
//   b = TY - SY;
// 
//   rep(i,a) res[ress++] = 'R';
//   rep(i,b) res[ress++] = 'U';
//   rep(i,a) res[ress++] = 'L';
//   rep(i,b+1) res[ress++] = 'D';
//   rep(i,a+1) res[ress++] = 'R';
//   rep(i,b+1) res[ress++] = 'U';
//   res[ress++] = 'L';
//   res[ress++] = 'U';
//   rep(i,a+1) res[ress++] = 'L';
//   rep(i,b+1) res[ress++] = 'D';
//   res[ress++] = 'R';
//   wt(res);
// }

Submission Info

Judge Result