0 0
import java.math.BigInteger; import java.util.Arrays; import java.util.HashMap; import java.util.LinkedList; import java.util.Map; import java.util.Queue; import java.util.Scanner; import java.util.Stack; import java.util.Vector; public class Main1 { static Scanner in=new Scanner(System.in); static int m; static int n; public static void main(String[] args) { m=in.nextInt(); n=in.nextInt(); int map[][]=new int[m][n]; int x,y,k;String s; for(int i=0;i<m;i++) for(int j=0;j<n;j++){ map[i][j]=in.nextInt(); } x=in.nextInt();y=in.nextInt();s=in.next();k=in.nextInt(); for(int i=0;i<k;i++){ if(map[x][y]==0){ if(s.charAt(0)=='U'){ map[x][y]=1; s="L"; y=y-1; if(y<0)y=0; } else if(s.charAt(0)=='D'){ map[x][y]=1; s="R"; y=y+1; if(y>=n)y=n-1; } else if(s.charAt(0)=='L'){ map[x][y]=1; s="D"; x=x+1; if(x>=m)x=m; } else if(s.charAt(0)=='R'){ map[x][y]=1; s="U"; x=x-1; if(x<0)x=0; } } else{ if(s.charAt(0)=='U'){ map[x][y]=0; s="R"; y=y+1; if(y>=n)y=n-1; } else if(s.charAt(0)=='D'){ map[x][y]=0; s="L"; y=y-1; if(y<0)y=0; } else if(s.charAt(0)=='L'){ map[x][y]=0; s="U"; x=x-1; if(x<0)x=0; } else if(s.charAt(0)=='R'){ map[x][y]=0; s="D"; x=x+1; if(x>=m)x=m-1; } } } System.out.println(x+" "+y); } private static boolean panduan(int x, int y) { // TODO Auto-generated method stub if(x>=0&&x<m&&y>=0&&y<n) return true; return false; } } if+if+if一定用else if