結果
| 問題 | No.942 プレゼント配り |
| ユーザー |
 Oland
|
| 提出日時 | 2019-12-05 21:18:14 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,694 bytes |
| コンパイル時間 | 5,436 ms |
| コンパイル使用メモリ | 81,512 KB |
| 実行使用メモリ | 51,964 KB |
| 最終ジャッジ日時 | 2024-12-22 23:20:24 |
| 合計ジャッジ時間 | 7,023 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 76 ms
38,272 KB |
| testcase_01 | AC | 281 ms
45,004 KB |
| testcase_02 | AC | 56 ms
37,080 KB |
| testcase_03 | AC | 56 ms
37,176 KB |
| testcase_04 | AC | 328 ms
51,964 KB |
| testcase_05 | AC | 276 ms
45,368 KB |
| testcase_06 | AC | 56 ms
37,108 KB |
| testcase_07 | AC | 76 ms
38,248 KB |
| testcase_08 | AC | 310 ms
50,756 KB |
| testcase_09 | AC | 308 ms
50,656 KB |
| testcase_10 | AC | 56 ms
37,208 KB |
| testcase_11 | AC | 57 ms
37,176 KB |
| testcase_12 | AC | 58 ms
37,248 KB |
| testcase_13 | AC | 55 ms
37,240 KB |
| testcase_14 | WA | - |
| testcase_15 | AC | 249 ms
47,660 KB |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | AC | 77 ms
38,080 KB |
| testcase_19 | AC | 56 ms
37,208 KB |
ソースコード
import java.io.*;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
long lcm(long a, long b){return a / gcd(a, b) * b;}
void solve() {
int N = in.nextInt(), K = in.nextInt();
if((N / K) % 2 != 0 && K != 1 && (N / K) % K != 0){
out.println("No");
return;
}
out.println("Yes");
if(K == 1){
for(int i = 1; i <= N; i++) out.print(i + " ");
out.println();
return;
}
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
for(int i = 0; i < K; i++) res.add(new ArrayList<>());
if((N / K) % K == 0){
for(int i = 0; i < K; i++){
for(int j = 0; j < K; j++){
res.get((i + j) % K).add(j + 1 + i * K);
}
}
}else{
int num = 1;
for(int i = 0; i < ((N / K) / 2); i++){
for(int j = 0; j < K; j++){
res.get(j).add(num);
num++;
}
for(int j = K-1; j >= 0; j--){
res.get(j).add(num);
num++;
}
}
}
for(int i = 0; i < K; i++){
long sum = 0;
for(int e : res.get(i)){
out.print(e + " ");
sum += e;
}
//out.print(sum);
out.println();
}
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "output.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
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;
}
}
}