Submission #3225914
Source Code Expand
import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Main { InputStream is; int __t__ = 1; int __f__ = 0; int __FILE_DEBUG_FLAG__ = __f__; String __DEBUG_FILE_NAME__ = "src/D1"; FastScanner in; PrintWriter out; public void solve() { String s = in.next(); int n = s.length(); int res = n; for (int i = 0; i < n - 1; i++) { if (s.charAt(i) != s.charAt(i + 1)) { res = Math.min(res, Math.max(i + 1, n - i - 1)); } } System.out.println(res); } public void run() { if (__FILE_DEBUG_FLAG__ == __t__) { try { is = new FileInputStream(__DEBUG_FILE_NAME__); } catch (FileNotFoundException e) { // TODO 自動生成された catch ブロック e.printStackTrace(); } System.out.println("FILE_INPUT!"); } else { is = System.in; } in = new FastScanner(is); out = new PrintWriter(System.out); solve(); } public static void main(final String[] args) { new Main().run(); } class FastScanner { private InputStream stream; private byte[] buf = new byte[1024]; private int curChar; private int numChars; public FastScanner(InputStream stream) { this.stream = stream; // stream = new FileInputStream(new File("dec.in")); } int read() { if (numChars == -1) throw new InputMismatchException(); if (curChar >= numChars) { curChar = 0; try { numChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (numChars <= 0) return -1; } return buf[curChar++]; } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } int[][] nextIntMap(int n, int m) { int[][] map = new int[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextIntArray(m); } return map; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } long[][] nextLongMap(int n, int m) { long[][] map = new long[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextLongArray(m); } return map; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } double[][] nextDoubleMap(int n, int m) { double[][] map = new double[n][m]; for (int i = 0; i < n; i++) { map[i] = in.nextDoubleArray(m); } return map; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Wide Flip |
User | hiro116s |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 4972 Byte |
Status | AC |
Exec Time | 90 ms |
Memory | 21588 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 89 ms | 20692 KB |
02.txt | AC | 88 ms | 17876 KB |
03.txt | AC | 90 ms | 19796 KB |
04.txt | AC | 88 ms | 19924 KB |
05.txt | AC | 90 ms | 20820 KB |
06.txt | AC | 87 ms | 21460 KB |
07.txt | AC | 87 ms | 19924 KB |
08.txt | AC | 89 ms | 21076 KB |
09.txt | AC | 87 ms | 21588 KB |
10.txt | AC | 90 ms | 21332 KB |
11.txt | AC | 89 ms | 21332 KB |
12.txt | AC | 87 ms | 20692 KB |
13.txt | AC | 88 ms | 21204 KB |
14.txt | AC | 89 ms | 18900 KB |
15.txt | AC | 89 ms | 18004 KB |
16.txt | AC | 90 ms | 21588 KB |
17.txt | AC | 86 ms | 17876 KB |
18.txt | AC | 86 ms | 17748 KB |
19.txt | AC | 90 ms | 21588 KB |
20.txt | AC | 86 ms | 19412 KB |
21.txt | AC | 69 ms | 20564 KB |
22.txt | AC | 69 ms | 19796 KB |
23.txt | AC | 68 ms | 17492 KB |
24.txt | AC | 69 ms | 19028 KB |
25.txt | AC | 70 ms | 21076 KB |
26.txt | AC | 70 ms | 20820 KB |
27.txt | AC | 69 ms | 20180 KB |
s1.txt | AC | 69 ms | 19540 KB |
s2.txt | AC | 68 ms | 17876 KB |
s3.txt | AC | 67 ms | 18260 KB |