Submission #1898466


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		char[] c=ir.next().toCharArray();
		int n=c.length;
		int ret=0;
		for(int i=0;i<2;i++){
			int now=0;
			int x=(int)1e9,y=(int)1e9;
			for(;;){
				while(now<n&&c[now]!='0'+i)
					now++;
				int p=now;
				while(now<n&&c[now]=='0'+i)
					now++;
				x=Math.min(x,now-p);
				y=Math.min(y,Math.max(p,n-now));
				if(now>=n)
					break;
			}
			ret=Math.max(ret,Math.max(x, y));
		}
		out.println(ret);
	}

	public static void main(String[] args) throws Exception {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		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;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}

Submission Info

Submission Time
Task D - Wide Flip
User holeguma
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 3528 Byte
Status AC
Exec Time 159 ms
Memory 23252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 30
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 103 ms 21844 KB
02.txt AC 103 ms 21460 KB
03.txt AC 91 ms 20180 KB
04.txt AC 102 ms 21716 KB
05.txt AC 159 ms 18388 KB
06.txt AC 91 ms 20948 KB
07.txt AC 98 ms 22996 KB
08.txt AC 88 ms 18772 KB
09.txt AC 103 ms 17492 KB
10.txt AC 106 ms 21460 KB
11.txt AC 100 ms 21588 KB
12.txt AC 88 ms 21460 KB
13.txt AC 91 ms 21460 KB
14.txt AC 101 ms 16084 KB
15.txt AC 104 ms 19536 KB
16.txt AC 101 ms 18260 KB
17.txt AC 99 ms 21460 KB
18.txt AC 92 ms 19284 KB
19.txt AC 101 ms 21332 KB
20.txt AC 95 ms 20948 KB
21.txt AC 72 ms 18900 KB
22.txt AC 72 ms 18388 KB
23.txt AC 72 ms 18644 KB
24.txt AC 72 ms 23252 KB
25.txt AC 72 ms 18644 KB
26.txt AC 73 ms 19156 KB
27.txt AC 72 ms 18004 KB
s1.txt AC 72 ms 21204 KB
s2.txt AC 72 ms 19156 KB
s3.txt AC 71 ms 19156 KB