fork download
copy 
  1. import java.io.*;
  2. import java.util.*;
  3.  
  4. class Main
  5. {
  6. 	public static void main (String[] args) throws IOException
  7. 	{
  8. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  9. 		String readSTR = br.readLine();
  10. 		int set = Integer.parseInt(readSTR);
  11.  
  12. 		for(int t = 0; t < set; t++)
  13. 		{
  14. 			readSTR = br.readLine();
  15. 			int N = Integer.parseInt(readSTR);
  16. 			readSTR = br.readLine();
  17. 			char[] NY =  readSTR.toCharArray();
  18.  
  19. 			//本棚データ格納
  20. 			ArrayList<String> a = new ArrayList<>();
  21. 			ArrayList<String> b = new ArrayList<>();
  22. 			int NYF = 0;
  23. 			for(int i = 0; i < NY.length; i++)
  24. 			{
  25. 				if(NYF == 8)
  26. 				{
  27. 					NYF = 0;
  28. 				}
  29.  
  30. 				if(NYF < 4 )
  31. 				{
  32. 					a.add(String.valueOf(NY[i]));
  33. 				}else{
  34. 					b.add(String.valueOf(NY[i]));
  35. 				}
  36. 				NYF++;
  37. 			}
  38.  
  39. 			boolean[][] map = CreateMap(a , b);
  40. for(int z =0;z<map.length;z++)
  41. {
  42. 	System.out.println(map[z][0] +" "+map[z][1]);
  43.  
  44. }
  45. 			//"Y"の座標格納
  46. 			Moving m = new Moving();
  47. 			m.setEnd(map.length - 1);
  48. 			for(int i = 0; i < map.length; i++)
  49. 			{
  50. 				if(map[i][0] == true)
  51. 				{
  52. 					m.roots.add(Integer.toString(i) + "0");
  53. 				}
  54. 				if(map[i][1] == true)
  55. 				{
  56. 					m.roots.add(Integer.toString(i) + "1");
  57. 				}
  58. 			}
  59. 			m.CountSteps();
  60. 			System.out.println(m.steps);
  61.  
  62. 		}
  63.  
  64.  
  65.  
  66. 		System.out.println();
  67. 	}
  68.  
  69. 	public static boolean NYJudgment(String s1,String s2)
  70. 	{
  71. 		boolean f;
  72. 		if(s1.equals("Y") || s2.equals("Y"))
  73. 		{
  74. 			f = true;
  75. 		}else{
  76. 			f = false;
  77. 		}
  78. 		return f;
  79. 	}
  80.  
  81. 	public static boolean[][] CreateMap(ArrayList<String> a, ArrayList<String> b)
  82. 	{
  83. 		boolean[][] map = new boolean[a.size() / 2 + 1][2];
  84. 		map[0][0] = NYJudgment(a.get(0),"N");
  85. 		map[0][1] = NYJudgment(b.get(0),"N");
  86. 		map[map.length - 1][0] = NYJudgment(a.get(a.size() - 1),"N");
  87. 		map[map.length - 1][1] = NYJudgment(b.get(b.size() - 1),"N");	
  88.  
  89. 		for(int i = 1; i <= map.length - 2; i++)
  90. 		{
  91. 			map[i][0] = NYJudgment(a.get(i*2), a.get(i*2-1));
  92. 			map[i][1] = NYJudgment(b.get(i*2), b.get(i*2-1));
  93. 		}
  94. 		return map;
  95. 	}
  96.  
  97.  
  98.  
  99.  
  100. }
  101.  
  102. class Moving
  103. {
  104. 	int[] location = new int[2];
  105. 	//location[0] = 0;
  106. 	//location[1] = 0;
  107. 	int steps = 0;
  108. 	int end;
  109. 	ArrayList<String> roots = new ArrayList<>();
  110.  
  111. 	public void setEnd(int end)
  112. 	{
  113. 		this.end = end;
  114. 	}
  115.  
  116. 	public void CountSteps()
  117. 	{
  118. 		for(String s: roots)
  119. 		{
  120. 			String[] str = s.split("");
  121. 			int x = Integer.parseInt(str[0]);
  122. 			int y = Integer.parseInt(str[1]);
  123. 			if(location[0] != x)
  124. 			{
  125. 				moveRight(x);
  126. 			}
  127. 			moveUpDown(y);
  128. 		}
  129.  
  130. 	}
  131.  
  132. 	public void moveUpDown(int y)
  133. 	{
  134. 		if(location[1] == 0)
  135. 		{
  136. 			if(y == 0)
  137. 			{
  138. 				steps += 1;
  139. 				location[1] = 1;
  140. 			}else if(y == 1){
  141. 				steps += 2;
  142. 				location[1] = 2;
  143. 			}
  144.  
  145. 		}
  146.  
  147. 		if(location[1] == 1)
  148. 		{
  149. 			if(y == 0)
  150. 			{
  151. 				location[1] = 0;
  152. 			}else if(y == 1)
  153. 			{
  154. 				location[1] = 2;
  155. 			}
  156. 			steps += 1;
  157. 		}
  158.  
  159. 		if(location[1] == 2)
  160. 		{
  161. 			if(y == 1)
  162. 			{
  163. 				steps +=1;
  164. 				location[1] = 1;
  165. 			}else if( y == 0){
  166. 				steps += 2;
  167. 				location[1] = 0;
  168. 			}
  169.  
  170. 		}
  171. 	}
  172.  
  173. 	public void moveRight(int x)
  174. 	{
  175. 		for(int i = location[0]; i < x; i++)
  176. 		{
  177. 			steps++;
  178. 			location[0]++;
  179. 		}
  180. 	}
  181.  
  182. 	public void moveEnd()
  183. 	{
  184. 		if(location[0] != end)
  185. 		{
  186. 			moveRight(end);
  187. 		}
  188. 		if(location[1] != 0)
  189. 		{
  190. 			moveUpDown(0);
  191. 		}
  192. 	}
  193. }
Success #stdin #stdout 0.04s 4575232KB
comments (?)
stdin
copy 
2
2
YNNNNYYY
4
NYNNYYNNNYNYYNNN
stdout
copy 
true false
false true
false true
9
false true
true true
false true
true false
true false
16
https://ideone.com/M2Da7o
language:
Java (HotSpot 12)
created:
6 years 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!