結果

問題 No.115 遠足のおやつ
ユーザー tutuztutuz
提出日時 2018-09-14 23:02:39
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,262 bytes
コンパイル時間 2,300 ms
コンパイル使用メモリ 78,208 KB
実行使用メモリ 52,520 KB
最終ジャッジ日時 2024-07-06 12:24:53
合計ジャッジ時間 6,047 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,216 KB
testcase_01 AC 55 ms
50,180 KB
testcase_02 WA -
testcase_03 AC 57 ms
50,560 KB
testcase_04 WA -
testcase_05 AC 56 ms
50,004 KB
testcase_06 AC 56 ms
50,388 KB
testcase_07 AC 56 ms
50,160 KB
testcase_08 AC 57 ms
50,348 KB
testcase_09 AC 56 ms
50,244 KB
testcase_10 RE -
testcase_11 AC 55 ms
50,580 KB
testcase_12 RE -
testcase_13 AC 56 ms
50,188 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 56 ms
50,268 KB
testcase_18 AC 55 ms
50,300 KB
testcase_19 AC 55 ms
50,532 KB
testcase_20 AC 56 ms
50,160 KB
testcase_21 AC 55 ms
50,272 KB
testcase_22 WA -
testcase_23 AC 55 ms
50,576 KB
testcase_24 WA -
testcase_25 AC 55 ms
50,252 KB
testcase_26 AC 56 ms
50,008 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 56 ms
50,280 KB
testcase_30 WA -
testcase_31 AC 56 ms
50,304 KB
testcase_32 WA -
testcase_33 AC 58 ms
49,812 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 56 ms
50,292 KB
testcase_41 AC 56 ms
50,292 KB
testcase_42 AC 56 ms
50,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt(), d = in.nextInt(), k = in.nextInt();
			if (d < k*(k+1)/2 || n*(n+1)/2 < d) {
				out.println(-1);
				return;
			}

			int[] ans = new int[k];
			int idx = 0;
			int kk = k;
			while (kk > 1) {
				ans[idx] = idx+1;
				d -= ans[idx];
				idx++;
				kk--;
			}
			ans[k-1] = d;

			if (ans[k-1] > n) {
				int dx = ans[k-1] - n;
				ans[k-1] -= dx;
				ans[k-2] += dx;
			}

			for (int i = 0; i < k; i++) {
				if (i > 0) out.print(" ");
				out.print(ans[i]);
			}
			out.print("\n");
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0