結果

問題 No.1017 Reiwa Sequence
ユーザー uwiuwi
提出日時 2020-04-03 22:07:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 555 ms / 2,000 ms
コード長 4,811 bytes
コンパイル時間 4,724 ms
コンパイル使用メモリ 81,340 KB
実行使用メモリ 397,452 KB
最終ジャッジ日時 2024-07-03 03:14:55
合計ジャッジ時間 49,156 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
38,588 KB
testcase_01 AC 109 ms
49,712 KB
testcase_02 AC 68 ms
38,040 KB
testcase_03 AC 253 ms
101,700 KB
testcase_04 AC 65 ms
37,900 KB
testcase_05 AC 153 ms
54,656 KB
testcase_06 AC 131 ms
51,044 KB
testcase_07 AC 67 ms
37,624 KB
testcase_08 AC 64 ms
37,520 KB
testcase_09 AC 270 ms
134,236 KB
testcase_10 AC 458 ms
313,644 KB
testcase_11 AC 265 ms
126,968 KB
testcase_12 AC 546 ms
383,416 KB
testcase_13 AC 518 ms
397,452 KB
testcase_14 AC 220 ms
126,412 KB
testcase_15 AC 263 ms
133,588 KB
testcase_16 AC 209 ms
126,600 KB
testcase_17 AC 345 ms
189,912 KB
testcase_18 AC 245 ms
126,432 KB
testcase_19 AC 535 ms
312,888 KB
testcase_20 AC 550 ms
313,220 KB
testcase_21 AC 552 ms
313,384 KB
testcase_22 AC 555 ms
313,240 KB
testcase_23 AC 537 ms
313,384 KB
testcase_24 AC 498 ms
313,220 KB
testcase_25 AC 527 ms
313,104 KB
testcase_26 AC 506 ms
313,172 KB
testcase_27 AC 544 ms
313,672 KB
testcase_28 AC 539 ms
313,724 KB
testcase_29 AC 448 ms
313,824 KB
testcase_30 AC 485 ms
313,800 KB
testcase_31 AC 512 ms
313,884 KB
testcase_32 AC 536 ms
313,756 KB
testcase_33 AC 454 ms
313,532 KB
testcase_34 AC 68 ms
37,948 KB
testcase_35 AC 63 ms
37,760 KB
testcase_36 AC 70 ms
37,824 KB
testcase_37 AC 520 ms
313,708 KB
testcase_38 AC 367 ms
313,768 KB
testcase_39 AC 542 ms
313,760 KB
testcase_40 AC 218 ms
48,364 KB
testcase_41 AC 227 ms
47,796 KB
testcase_42 AC 214 ms
48,076 KB
testcase_43 AC 223 ms
48,040 KB
testcase_44 AC 252 ms
50,776 KB
testcase_45 AC 226 ms
47,400 KB
testcase_46 AC 222 ms
47,752 KB
testcase_47 AC 215 ms
47,632 KB
testcase_48 AC 431 ms
54,052 KB
testcase_49 AC 288 ms
53,948 KB
testcase_50 AC 279 ms
53,796 KB
testcase_51 AC 71 ms
40,780 KB
testcase_52 AC 502 ms
313,720 KB
testcase_53 AC 493 ms
313,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[][] ai = new int[n][];
		for(int i = 0;i < n;i++){
			ai[i] = new int[]{a[i], i};
		}
		Arrays.sort(ai, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return a[0] - b[0];
			}
		});
		
		for(int i = 0;i < n-1;i++){
			if(ai[i+1][0] == ai[i][0]){
				out.println("Yes");
				int[] b = new int[n];
				b[ai[i][1]] = ai[i][0];
				b[ai[i+1][1]] = -ai[i][0];
				print(b); return;
			}
		}

		int[] hit = new int[150005];
		Arrays.fill(hit, -1);
		for(int i = 0;i < n-1;i++){
			int cha = ai[i+1][0] - ai[i][0];
			if(hit[cha] != -1 && hit[cha] < i-1){
				out.println("Yes");
				int[] b = new int[n];
				b[ai[i+1][1]] = ai[i+1][0];
				b[ai[i][1]] = -ai[i][0];
				b[ai[hit[cha]+1][1]] = -ai[hit[cha]+1][0];
				b[ai[hit[cha]][1]] = ai[hit[cha]][0];
				print(b); return;
			}
			if(hit[cha] == -1)hit[cha] = i;
		}
		
		// sqrt(n)
		int h = (n+1)/2;
		int[][] dp = new int[n+1][150005*h*2+1];
		int O = 150005*h;
		dp[0][O] = 1;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < dp[i].length;j++){
				dp[i+1][j] = dp[i][j];
			}
			for(int j = 0;j < dp[i].length;j++){
				if(dp[i][j] != 0){
					if(j+a[i] < dp[i].length)dp[i+1][j+a[i]] += dp[i][j]*3;
					if(j-a[i] >= 0)dp[i+1][j-a[i]] += dp[i][j]*5;
				}
			}
			if(dp[i+1][O] != 1){
				out.println("Yes");
				int cur = O;
				int[] b = new int[n];
				for(int k = i;k >= 0;k--){
					if(dp[k][cur] != 0 && k != i){
					}else if((k == 0 && cur-a[k] == O) || cur-a[k] >= 0 && dp[k][cur-a[k]] != 0){
						cur -= a[k];
						b[k] = a[k];
					}else{
						cur += a[k];
						b[k] = -a[k];
					}
				}
				print(b); return;
			}
		}
		out.println("No");
	}
	
	void print(int[] b)
	{
		for(int v : b){
			out.print(v + " ");
		}
		out.println();
	}
	
	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 C().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