fork download
copy 
  1. import math
  2. def find(u, par):
  3.  
  4.     if par[u] != u:
  5.         par[u] = find(par[u], par)
  6.     return par[u]
  7.  
  8. def union(u, v, par, size):
  9.     u_root = find(u, par)
  10.     v_root = find(v, par)
  11.  
  12.     if u_root == v_root:
  13.         return 
  14.  
  15.  
  16.     if size[u_root] < size[v_root]:
  17.         par[u_root] = v_root
  18.         size[v_root] += size[u_root]
  19.     else:
  20.         par[v_root] = u_root
  21.         size[u_root] += size[v_root]
  22.  
  23. def ip():
  24.     return map(int,input().split())
  25.  
  26.  
  27.  
  28.  
  29. T=1
  30. # T=int(input())
  31. for __ in range(T):
  32.     # n=int(input())
  33.     n,m,k=ip()
  34.     s=[]
  35.     for i in range(k):
  36.         sx,sy=ip()
  37.         s.append((sx,sy))
  38.  
  39.     t=[]
  40.     for i in range(k):
  41.         tx,ty=ip()
  42.         t.append((tx,ty))
  43.  
  44.     res=[]
  45.     for i in range(n-1):
  46.         res.append("U")
  47.     for i in range(m-1):
  48.         res.append("L")
  49.  
  50.     #d,r,u,r,d
  51.  
  52.     d=True
  53.     curr=1
  54.     while curr<=m:
  55.         s="R"
  56.         if not d:
  57.             s="L"
  58.         for i in range(n):
  59.             res.append(s)
  60.         d=not d
  61.         res.append("D")
  62.         curr+=1
  63.  
  64.     print(len(res))
  65.     print("".join(res))
  66.  
  67.  
  68.  
  69.  
Success #stdin #stdout 0.11s 14092KB
comments (?)
stdin
copy 
5 4 3
3 4
3 1
3 3
5 3
1 3
1 4
stdout
copy 
31
UUUULLLRRRRRDLLLLLDRRRRRDLLLLLD
https://ideone.com/qYemn1
language:
Python 3 (python  3.12)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!