結果
問題 | No.1588 Connection |
ユーザー | watarimaycry2 |
提出日時 | 2021-07-09 00:31:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 482 ms / 2,000 ms |
コード長 | 4,995 bytes |
コンパイル時間 | 2,757 ms |
コンパイル使用メモリ | 84,576 KB |
実行使用メモリ | 75,008 KB |
平均クエリ数 | 551.78 |
最終ジャッジ日時 | 2024-07-17 12:50:24 |
合計ジャッジ時間 | 13,110 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 189 ms
70,652 KB |
testcase_01 | AC | 172 ms
71,244 KB |
testcase_02 | AC | 172 ms
70,700 KB |
testcase_03 | AC | 166 ms
71,240 KB |
testcase_04 | AC | 163 ms
71,020 KB |
testcase_05 | AC | 176 ms
71,860 KB |
testcase_06 | AC | 184 ms
71,972 KB |
testcase_07 | AC | 165 ms
71,508 KB |
testcase_08 | AC | 198 ms
70,892 KB |
testcase_09 | AC | 214 ms
71,344 KB |
testcase_10 | AC | 209 ms
71,388 KB |
testcase_11 | AC | 207 ms
71,772 KB |
testcase_12 | AC | 367 ms
72,224 KB |
testcase_13 | AC | 397 ms
72,572 KB |
testcase_14 | AC | 177 ms
70,808 KB |
testcase_15 | AC | 178 ms
71,308 KB |
testcase_16 | AC | 167 ms
70,992 KB |
testcase_17 | AC | 172 ms
71,020 KB |
testcase_18 | AC | 180 ms
71,260 KB |
testcase_19 | AC | 170 ms
71,008 KB |
testcase_20 | AC | 164 ms
71,280 KB |
testcase_21 | AC | 468 ms
74,784 KB |
testcase_22 | AC | 482 ms
74,560 KB |
testcase_23 | AC | 363 ms
72,432 KB |
testcase_24 | AC | 311 ms
72,412 KB |
testcase_25 | AC | 397 ms
74,616 KB |
testcase_26 | AC | 390 ms
74,380 KB |
testcase_27 | AC | 310 ms
72,084 KB |
testcase_28 | AC | 274 ms
71,416 KB |
testcase_29 | AC | 477 ms
74,752 KB |
testcase_30 | AC | 479 ms
75,008 KB |
testcase_31 | AC | 167 ms
71,176 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //見なくていいよ ここから------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = null;//new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join StringBuilder sb = new StringBuilder(""); String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof long[]){ long[] tmp = (long[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof int[]){ int[] tmp = (int[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof ArrayList){ ArrayList tmp = (ArrayList)list; if(tmp.size() == 0){ return ""; } sb.append(tmp.get(0)); for(int i = 1; i < tmp.size(); i++){ sb.append(joinString).append(tmp.get(i)); } return sb.toString(); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } static ArrayList<String> myconv(String str, String no){ return new ArrayList<String>(Arrays.asList(str.split(no))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //見なくていいよ ここまで------------------------------------------ //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること static void solve(){//ここがメイン関数 Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); int count = 0; ArrayDeque<Q> queue = new ArrayDeque<>(); boolean[][] access = new boolean[N + 1][N + 1]; int[] dy = {-1,0,1,0}; int[] dx = {0,-1,0,1}; queue.add(new Q(1,1)); access[1][1] = true; while(queue.size() > 0){ Q now = queue.pollFirst(); int y = now.y; int x = now.x; for(int i = 0; i < dy.length; i++){ int nextY = y + dy[i]; int nextX = x + dx[i]; if(nextY >= 1 && nextY <= N && nextX >= 1 && nextX <= N){ if(access[nextY][nextX]){ continue; } access[nextY][nextX] = true; System.out.println(nextX + " " + nextY); System.out.flush(); String s = sc.next(); if(s.equals("Black")){ queue.addLast(new Q(nextY, nextX)); count++; if(nextY == N && nextX == N){ System.out.println("Yes"); System.out.flush(); return; } } } } } System.out.println("No"); System.out.flush(); } //メソッド追加エリア ここから static class Q{ int y; int x; Q(int y, int x){ this.y = y; this.x = x; } } //メソッド追加エリア ここまで }