#482242 (Java21) No.1055 牛歩

提出ソース

結果

問題	No.1055 牛歩
ユーザー	uwi
提出日時	2020-05-15 22:38:58
言語	Java21 (openjdk 21)
結果	AC
実行時間	135 ms / 1,000 ms
コード長	4,081 bytes
コンパイル時間	4,150 ms
コンパイル使用メモリ	80,200 KB
実行使用メモリ	56,176 KB
最終ジャッジ日時	2023-10-22 08:01:40
合計ジャッジ時間	12,055 ms
ジャッジサーバーID （参考情報）	judge9 / judge10

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	135 ms 56,176 KB
testcase_01	AC	103 ms 54,988 KB
testcase_02	AC	113 ms 55,076 KB
testcase_03	AC	110 ms 55,164 KB
testcase_04	AC	111 ms 55,020 KB
testcase_05	AC	109 ms 55,200 KB
testcase_06	AC	114 ms 55,316 KB
testcase_07	AC	117 ms 55,368 KB
testcase_08	AC	112 ms 55,200 KB
testcase_09	AC	108 ms 55,228 KB
testcase_10	AC	109 ms 55,448 KB
testcase_11	AC	111 ms 53,408 KB
testcase_12	AC	95 ms 54,896 KB
testcase_13	AC	85 ms 52,564 KB
testcase_14	AC	109 ms 55,216 KB
testcase_15	AC	111 ms 55,092 KB
testcase_16	AC	86 ms 54,796 KB
testcase_17	AC	107 ms 54,956 KB
testcase_18	AC	108 ms 54,980 KB
testcase_19	AC	108 ms 55,392 KB
testcase_20	AC	94 ms 54,800 KB
testcase_21	AC	112 ms 55,216 KB
testcase_22	AC	116 ms 55,364 KB
testcase_23	AC	86 ms 54,972 KB
testcase_24	AC	110 ms 55,144 KB
testcase_25	AC	54 ms 53,468 KB
testcase_26	AC	105 ms 55,316 KB
testcase_27	AC	107 ms 55,460 KB
testcase_28	AC	106 ms 55,468 KB
testcase_29	AC	54 ms 52,712 KB
testcase_30	AC	108 ms 55,448 KB
testcase_31	AC	80 ms 54,380 KB
testcase_32	AC	55 ms 52,704 KB
testcase_33	AC	82 ms 54,652 KB
testcase_34	AC	56 ms 53,424 KB
testcase_35	AC	80 ms 54,376 KB
testcase_36	AC	78 ms 54,036 KB
testcase_37	AC	54 ms 53,428 KB
testcase_38	AC	56 ms 53,420 KB
testcase_39	AC	54 ms 53,436 KB
testcase_40	AC	55 ms 53,428 KB
testcase_41	AC	54 ms 53,424 KB
testcase_42	AC	57 ms 53,420 KB
testcase_43	AC	55 ms 53,420 KB
testcase_44	AC	55 ms 53,420 KB
testcase_45	AC	56 ms 52,352 KB
testcase_46	AC	56 ms 53,428 KB
testcase_47	AC	54 ms 53,428 KB
testcase_48	AC	54 ms 53,416 KB
testcase_49	AC	54 ms 53,416 KB
testcase_50	AC	56 ms 52,472 KB
testcase_51	AC	56 ms 52,488 KB
testcase_52	AC	54 ms 51,380 KB
testcase_53	AC	55 ms 53,428 KB
testcase_54	AC	56 ms 52,340 KB
testcase_55	AC	54 ms 53,416 KB
testcase_56	AC	54 ms 53,416 KB
testcase_57	AC	53 ms 53,420 KB
testcase_58	AC	54 ms 52,356 KB
testcase_59	AC	55 ms 53,424 KB
testcase_60	AC	54 ms 53,420 KB
testcase_61	AC	53 ms 53,436 KB
testcase_62	AC	53 ms 53,440 KB
testcase_63	AC	54 ms 53,424 KB
testcase_64	AC	53 ms 53,428 KB
testcase_65	AC	53 ms 53,440 KB
testcase_66	AC	52 ms 53,424 KB
testcase_67	AC	52 ms 53,424 KB
testcase_68	AC	54 ms 53,424 KB
testcase_69	AC	56 ms 53,420 KB
testcase_70	AC	53 ms 53,428 KB
testcase_71	AC	54 ms 52,380 KB
testcase_72	AC	54 ms 53,420 KB
testcase_73	AC	54 ms 53,428 KB
testcase_74	AC	53 ms 53,428 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest200515;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int W = ni();
		int n = ni();
		int[] xs = na(n);
		
		int[] mins = Arrays.copyOf(xs, n);
		int[] maxs = Arrays.copyOf(xs, n);
		for(int Q = ni();Q > 0;Q--){
			int id = ni()-1;
			mins[id]--;
			maxs[id]++;
			if(mins[id] < 1){
				mins[id] += 2;
			}
			if(maxs[id] > W){
				maxs[id] -= 2;
			}
			if(id-1 >= 0 && mins[id-1] >= mins[id]){
				mins[id] += 2;
			}
			if(id+1 < n && maxs[id] >= maxs[id+1]){
				maxs[id] -= 2;
			}
			if(mins[id] > maxs[id]){
				out.println("NO");
				return;
			}
			
			if(mins[id] == maxs[id]){
				for(int i = id+1;i < n;i++){
					if(maxs[i-1] == mins[i]){
						mins[i] += 2;
						if(mins[i] > maxs[i]){
							out.println("NO");
							return;
						}else if(mins[i] < maxs[i]){
							break;
						}
					}else{
						break;
					}
				}
				for(int i = id-1;i >= 0;i--){
					if(mins[i+1] == maxs[i]){
						maxs[i] -= 2;
						if(mins[i] > maxs[i]){
							out.println("NO");
							return;
						}else if(mins[i] < maxs[i]){
							break;
						}
					}else{
						break;
					}
				}
			}
		}
		out.println("YES");
	}
	
	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 F().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)); }
}

yukicoder

結果

テストケース

ソースコード