Submission #1070393

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>


typedef long double ld;
typedef long long ll;
using namespace std;
const ll MX=5e6+9;
const ld pi = acos(-1);
const ll mod = 1e8;

//bool cmp ( int a,int b ) { return a>b; }

ll po ( ll a , ll b )
{
    if ( b==0 ) { return 1; }
    ll x = po ( a , b/2 );
    x *= x%mod;
    if ( b%2 ) { x*=a%mod; }
    return x%mod;
}

ll gcd (  ll a , ll b )
{
    if ( b==0 ) return a;
    else { gcd( b , a%b ); }
}
bool cmp ( int a , int b ) { return (a>b); }
int dx[]={ 0 , 0 , -1 , 1 , 1 , -1 , -1 , 1 };
int dy[]={ 1 , -1 , 0 , 0 , 1 , -1 , 1 , -1 };
ll a[MX],b[MX],c[MX];
int n,m,l;


ll bs ( ll x , ll id )
{
    ll st,en,mid;
    if ( id==2 )
    {
        st=0,en=m;
    }
    else { st=0,en=l; }
    ll ans=0;
    if ( id==2 ){
    ans=m-1;
    while ( st<=en )
    {
        mid = st+(en-st)/2;
        if ( b[mid]>=x ) { ans=mid; en=mid-1; }
        else { st=mid+1; }
    }
    }
    else
    {
    ans=l-1;
    while ( st<=en )
    {
        mid = st+(en-st)/2;
        if ( c[mid]>=x ) { ans=mid; en=mid-1; }
        else { st=mid+1; }
    }
    }
    return ans;



}

int main()
{
    int x,y,s,e;
    cin>>x>>y>>s>>e;
    string ans;

    int xx=x,yy=y;

    while ( xx<s ) { ans += "R"; xx++; }
    while ( yy<e ) { ans += "U"; yy++; }

    for ( int i=0 ; i<ans.length() ; i++ )
    {
        if ( ans[i]=='U' ) { ans+= "D"; }
        if ( ans[i]=='R' ) { ans+= "L"; }
    }

    ans += "D";
    xx = x;
    yy = y-1;

    while ( xx<=s ) { ans += "R"; xx++; }
    while ( yy<e ) { ans += "U"; yy++; }

    ans += "L";
    ans += "U";

    xx = s;
    yy = e+1;

    while ( xx>=x ) { ans += "L"; xx--; }
    while ( yy>y  ) { ans += "D"; yy--; }

    ans += "R";

    cout<<ans;



	return 0;
}

Submission Info

Judge Result