結果
問題 | No.1016 三目並べ |
ユーザー | narushima |
提出日時 | 2020-04-03 23:18:18 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,164 bytes |
コンパイル時間 | 2,423 ms |
コンパイル使用メモリ | 78,068 KB |
実行使用メモリ | 52,312 KB |
最終ジャッジ日時 | 2024-07-03 06:13:23 |
合計ジャッジ時間 | 4,143 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,828 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 120 ms
39,612 KB |
testcase_10 | AC | 121 ms
39,220 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { static final int mod = (int) 1e9 + 7; static final int DX[] = { -1, 0, 1, 0 }, DY[] = { 0, -1, 0, 1 }; static final int[] DX8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, DY8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static final int INF = Integer.MAX_VALUE / 3; static final long LINF = Long.MAX_VALUE / 3; static final String nextLine = "\n"; public static void main(String[] args) { FastScanner fs = new FastScanner(System.in); int t = fs.nextInt(); for(int i=0;i<t;i++) { int n = fs.nextInt(); String s = fs.next(); char c[] = s.toCharArray(); if(check(s)) { System.out.println("O"); continue; } boolean win = false; boolean ok = false; int cnt = 0; for(int j=1;j<n;j++) { if(ok) { if(c[j]=='-')cnt++; if(c[j]=='x') { ok = false; cnt = 0; } if(c[j]=='o') { if(cnt >= 1 && cnt%2==1) { System.out.println("O"); win = true; break; } } continue; } if(c[j] == '-') { if(c[j-1]=='o') { ok = true; cnt ++; } } } if(win)continue; System.out.println("X"); } } static boolean check(String s) { if(s.contains("oo-")||s.contains("-oo")||s.contains("o-o")||s.contains("ooo"))return true; return false; } //MOD culculations static long plus(long x, long y) { long res = (x + y) % mod; return res < 0 ? res + mod : res; } static long sub(long x, long y) { long res = (x - y) % mod; return res < 0 ? res + mod : res; } static long mul(long x, long y) { long res = (x * y) % mod; return res < 0 ? res + mod : res; } static long div(long x, long y) { long res = x * pow(y, mod - 2) % mod; return res < 0 ? res + mod : res; } static long pow(long x, long y) { if (y < 0) return 0; if (y == 0) return 1; if (y % 2 == 1) return (x * pow(x, y - 1)) % mod; long root = pow(x, y / 2); return root * root % mod; } } //高速なScanner class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }