結果

問題 No.688 E869120 and Constructing Array 2
ユーザー holegumaholeguma
提出日時 2019-07-17 20:20:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 89 ms / 1,000 ms
コード長 3,621 bytes
コンパイル時間 2,175 ms
コンパイル使用メモリ 77,488 KB
実行使用メモリ 53,444 KB
最終ジャッジ日時 2023-08-24 20:49:19
合計ジャッジ時間 4,949 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
53,296 KB
testcase_01 AC 79 ms
52,676 KB
testcase_02 AC 77 ms
53,112 KB
testcase_03 AC 86 ms
52,548 KB
testcase_04 AC 86 ms
52,352 KB
testcase_05 AC 77 ms
52,356 KB
testcase_06 AC 80 ms
52,432 KB
testcase_07 AC 88 ms
52,332 KB
testcase_08 AC 82 ms
53,444 KB
testcase_09 AC 89 ms
52,832 KB
testcase_10 AC 77 ms
52,288 KB
testcase_11 AC 78 ms
52,828 KB
testcase_12 AC 81 ms
52,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {

	static PrintWriter out;
	static InputReader ir;

	static void solve() {
		long k = ir.nextLong();
		long n = k * 2;
		for (int i = 0;; i++, n /= 2) {
			long ub = (long) Math.sqrt(Long.MAX_VALUE), lb = 0;
			while (ub - lb > 1) {
				long mid = (ub + lb) / 2;
				if (mid * (mid - 1) >= n) {
					ub = mid;
				} else {
					lb = mid;
				}
			}
			if (ub * (ub - 1) == n && i + ub <= 30) {
				out.println(i + ub);
				int[] res = new int[i + (int) ub];
				for (int j = 0; j < ub; j++) {
					res[i + (int) ub - 1 - j] = 1;
				}
				for (int j = 0; j < i + ub; j++) {
					out.print(res[j] + (j == i + ub - 1 ? "\n" : " "));
				}
				return;
			}
		}
	}

	public static void main(String[] args) {
		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;
		}
	}

	static void tr(Object... o) {
		out.println(Arrays.deepToString(o));
	}
}
0