#419401 (Java21) No.973 余興

• 問題: No.973 余興
• ユーザー: uwi
• 提出日時: 2020-01-18 04:30:44
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 232 ms / 4,000 ms
• コード長: 6,895 bytes
• コンパイル時間: 4,164 ms
• コンパイル使用メモリ: 78,936 KB
• 実行使用メモリ: 52,252 KB
• 最終ジャッジ日時: 2023-09-08 15:45:08
• 合計ジャッジ時間: 12,418 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	228 ms; 51,812 KB
testcase_01	AC	229 ms; 52,064 KB
testcase_02	AC	229 ms; 51,560 KB
testcase_03	AC	228 ms; 51,796 KB
testcase_04	AC	231 ms; 51,792 KB
testcase_05	AC	232 ms; 51,600 KB
testcase_06	AC	228 ms; 51,908 KB
testcase_07	AC	232 ms; 51,628 KB
testcase_08	AC	227 ms; 51,804 KB
testcase_09	AC	230 ms; 51,716 KB
testcase_10	AC	227 ms; 51,776 KB
testcase_11	AC	85 ms; 52,212 KB
testcase_12	AC	85 ms; 52,220 KB
testcase_13	AC	83 ms; 52,196 KB
testcase_14	AC	83 ms; 52,076 KB
testcase_15	AC	64 ms; 51,692 KB
testcase_16	AC	64 ms; 52,028 KB
testcase_17	AC	62 ms; 51,732 KB
testcase_18	AC	63 ms; 51,708 KB
testcase_19	AC	63 ms; 51,792 KB
testcase_20	AC	60 ms; 51,744 KB
testcase_21	AC	64 ms; 51,744 KB
testcase_22	AC	64 ms; 51,688 KB
testcase_23	AC	63 ms; 51,568 KB
testcase_24	AC	62 ms; 51,496 KB
testcase_25	AC	60 ms; 52,132 KB
testcase_26	AC	62 ms; 51,672 KB
testcase_27	AC	67 ms; 51,540 KB
testcase_28	AC	65 ms; 51,748 KB
testcase_29	AC	64 ms; 51,572 KB
testcase_30	AC	107 ms; 51,764 KB
testcase_31	AC	107 ms; 51,792 KB
testcase_32	AC	108 ms; 51,628 KB
testcase_33	AC	107 ms; 51,784 KB
testcase_34	AC	104 ms; 52,108 KB
testcase_35	AC	107 ms; 51,940 KB
testcase_36	AC	102 ms; 52,252 KB
testcase_37	AC	103 ms; 52,104 KB
testcase_38	AC	105 ms; 52,232 KB
testcase_39	AC	104 ms; 52,104 KB
testcase_40	AC	41 ms; 49,340 KB
testcase_41	AC	41 ms; 49,320 KB
testcase_42	AC	41 ms; 47,416 KB
testcase_43	AC	41 ms; 49,492 KB
testcase_44	AC	41 ms; 49,336 KB
testcase_45	AC	42 ms; 49,360 KB
testcase_46	AC	111 ms; 51,720 KB
testcase_47	AC	111 ms; 51,780 KB
testcase_48	AC	110 ms; 51,800 KB
testcase_49	AC	106 ms; 51,796 KB
testcase_50	AC	110 ms; 51,740 KB
testcase_51	AC	112 ms; 51,796 KB
testcase_52	AC	113 ms; 51,780 KB
testcase_53	AC	112 ms; 51,560 KB
testcase_54	AC	112 ms; 51,840 KB
testcase_55	AC	113 ms; 51,740 KB

ソースコード

package contest200117;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class E3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// win[l][r] = win[i][r]
		int n = ni(), X = ni();
		int[] a = na(n);
		int[] prer = new int[n];
		int[] prec = new int[n];
		Arrays.fill(prer, -1);
		Arrays.fill(prec, -1);
		
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i];
		
		boolean last = false;
		for(int len = 1;len <= n;len++) {
			for(int i = 0;i+len-1 < n;i++) {
				int j = i+len-1;
				if(len == 1) {
					last = false;
					prer[i] = j;
					prec[j] = i;
				}else {
					{
						int pren = prec[j];
						if(pren != -1 && pren <= j && cum[pren] - cum[i] <= X) {
							last = true;
							continue;
						}
					}
					{
						int pren = prer[i];
						if(pren != -1 && pren >= i && cum[j+1] - cum[pren+1] <= X) {
							last = true;
							continue;
						}
					}
					last = false;
					prer[i] = j;
					prec[j] = i;
				}
			}
		}
		
		out.println(last ? "A" : "B");
	}
	
	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	
	public static int lowerBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	public static class LST {
		public long[][] set;
		public int n;
//		public int size;
		
		public LST(int n) {
			this.n = n;
			int d = 1;
			for(int m = n;m > 1;m>>>=6, d++);
			
			set = new long[d][];
			for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
				set[i] = new long[m+1];
			}
//			size = 0;
		}
		
		// [0,r)
		public LST setRange(int r)
		{
			for(int i = 0;i < set.length;i++, r=r+63>>>6){
				for(int j = 0;j < r>>>6;j++){
					set[i][j] = -1L;
				}
				if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
			}
			return this;
		}
		
		// [0,r)
		public LST unsetRange(int r)
		{
			if(r >= 0){
				for(int i = 0;i < set.length;i++, r=r+63>>>6){
					for(int j = 0;j < r+63>>>6;j++){
						set[i][j] = 0;
					}
					if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
				}
			}
			return this;
		}
		
		public LST set(int pos)
		{
			if(pos >= 0 && pos < n){
//				if(!get(pos))size++;
				for(int i = 0;i < set.length;i++, pos>>>=6){
					set[i][pos>>>6] |= 1L<<pos;
				}
			}
			return this;
		}
		
		public LST unset(int pos)
		{
			if(pos >= 0 && pos < n){
//				if(get(pos))size--;
				for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
					set[i][pos>>>6] &= ~(1L<<pos);
				}
			}
			return this;
		}
		
		public boolean get(int pos)
		{
			return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
		}
		
		public LST toggle(int pos)
		{
			return get(pos) ? unset(pos) : set(pos);
		}
		
		public int prev(int pos)
		{
			for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
				int pre = prev(set[i][pos>>>6], pos&63);
				if(pre != -1){
					pos = pos>>>6<<6|pre;
					while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
					return pos;
				}
			}
			return -1;
		}
		
		public int next(int pos)
		{
			for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
				int nex = next(set[i][pos>>>6], pos&63);
				if(nex != -1){
					pos = pos>>>6<<6|nex;
					while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
					return pos;
				}
			}
			return -1;
		}
		
		private static int prev(long set, int n)
		{
			long h = set<<~n;
			if(h == 0L)return -1;
			return -Long.numberOfLeadingZeros(h)+n;
		}
		
		private static int next(long set, int n)
		{
			long h = set>>>n;
			if(h == 0L)return -1;
			return Long.numberOfTrailingZeros(h)+n;
		}
		
		@Override
		public String toString()
		{
			List<Integer> list = new ArrayList<Integer>();
			for(int pos = next(0);pos != -1;pos = next(pos+1)){
				list.add(pos);
			}
			return list.toString();
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E3().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}