結果

問題 No.973 余興
ユーザー uwiuwi
提出日時 2020-01-17 23:51:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,211 ms / 4,000 ms
コード長 7,082 bytes
コンパイル時間 4,550 ms
コンパイル使用メモリ 84,784 KB
実行使用メモリ 272,308 KB
最終ジャッジ日時 2024-06-26 01:58:14
合計ジャッジ時間 46,968 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,194 ms
270,688 KB
testcase_01 AC 1,187 ms
270,700 KB
testcase_02 AC 1,180 ms
270,716 KB
testcase_03 AC 1,187 ms
269,944 KB
testcase_04 AC 1,187 ms
270,608 KB
testcase_05 AC 1,185 ms
270,624 KB
testcase_06 AC 1,189 ms
270,412 KB
testcase_07 AC 1,205 ms
270,004 KB
testcase_08 AC 1,191 ms
269,280 KB
testcase_09 AC 1,211 ms
270,676 KB
testcase_10 AC 1,167 ms
261,372 KB
testcase_11 AC 417 ms
131,184 KB
testcase_12 AC 413 ms
130,976 KB
testcase_13 AC 409 ms
131,120 KB
testcase_14 AC 408 ms
131,096 KB
testcase_15 AC 127 ms
61,280 KB
testcase_16 AC 125 ms
61,272 KB
testcase_17 AC 115 ms
56,988 KB
testcase_18 AC 120 ms
56,988 KB
testcase_19 AC 118 ms
56,940 KB
testcase_20 AC 115 ms
56,936 KB
testcase_21 AC 128 ms
61,000 KB
testcase_22 AC 133 ms
61,072 KB
testcase_23 AC 119 ms
56,856 KB
testcase_24 AC 120 ms
56,788 KB
testcase_25 AC 111 ms
53,744 KB
testcase_26 AC 114 ms
56,996 KB
testcase_27 AC 167 ms
63,132 KB
testcase_28 AC 121 ms
56,876 KB
testcase_29 AC 119 ms
56,844 KB
testcase_30 AC 1,101 ms
270,564 KB
testcase_31 AC 1,111 ms
270,248 KB
testcase_32 AC 1,107 ms
270,748 KB
testcase_33 AC 1,091 ms
270,148 KB
testcase_34 AC 1,108 ms
269,616 KB
testcase_35 AC 1,140 ms
270,816 KB
testcase_36 AC 1,076 ms
264,524 KB
testcase_37 AC 1,099 ms
264,724 KB
testcase_38 AC 1,134 ms
269,932 KB
testcase_39 AC 1,095 ms
270,172 KB
testcase_40 AC 60 ms
50,160 KB
testcase_41 AC 60 ms
49,892 KB
testcase_42 AC 60 ms
50,056 KB
testcase_43 AC 59 ms
50,068 KB
testcase_44 AC 59 ms
50,276 KB
testcase_45 AC 62 ms
49,780 KB
testcase_46 AC 1,107 ms
270,348 KB
testcase_47 AC 1,100 ms
270,300 KB
testcase_48 AC 1,095 ms
270,724 KB
testcase_49 AC 1,110 ms
253,184 KB
testcase_50 AC 1,108 ms
268,724 KB
testcase_51 AC 1,100 ms
270,452 KB
testcase_52 AC 1,127 ms
270,668 KB
testcase_53 AC 1,066 ms
266,640 KB
testcase_54 AC 1,092 ms
270,528 KB
testcase_55 AC 1,101 ms
272,308 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 E2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// win[l][r] = win[i][r]
		int n = ni(), X = ni();
		int[] a = na(n);
		boolean[][] win = new boolean[n][n];
		int[][] prer = new int[n][n];
		int[][] prec = new int[n][n];
		for(int i = 0;i < n;i++) {
			Arrays.fill(prer[i], -1);
			Arrays.fill(prec[i], -1);
		}
		
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i];
		
		for(int len = 1;len <= n;len++) {
			for(int i = 0;i+len-1 < n;i++) {
				int j = i+len-1;
				if(len == 1) {
					win[i][j] = false;
					prer[i][j] = j;
					prec[i][j] = i;
				}else {
					if(j-1 >= 0)prer[i][j] = prer[i][j-1];
					if(i+1 < n)prec[i][j] = prec[i+1][j];
					{
						int pren = prec[i][j];
						if(pren != -1 && pren <= j && cum[pren] - cum[i] <= X) {
							win[i][j] = true;
							continue;
						}
					}
					{
						int pren = prer[i][j];
						if(pren != -1 && pren >= i && cum[j+1] - cum[pren+1] <= X) {
							win[i][j] = true;
							continue;
						}
					}
					prer[i][j] = j;
					prec[i][j] = i;
				}
			}
		}
		
//		tf(win);
		out.println(win[0][n-1] ? "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 E2().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)); }
}
0