結果
| 問題 |
No.1457 ツブ消ししとるなHard
|
| コンテスト | |
| ユーザー |
neko_the_shadow
|
| 提出日時 | 2021-04-06 10:59:51 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,507 bytes |
| コンパイル時間 | 2,829 ms |
| コンパイル使用メモリ | 83,820 KB |
| 実行使用メモリ | 60,424 KB |
| 最終ジャッジ日時 | 2025-01-02 20:27:07 |
| 合計ジャッジ時間 | 8,071 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 13 WA * 4 |
ソースコード
package _1457;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Objects;
public class Main {
public void exec() {
int n = stdin.nextInt();
int m = stdin.nextInt();
int x = stdin.nextInt();
int y = stdin.nextInt();
int z = stdin.nextInt();
long[] a = stdin.nextLongArray(n);
long sum = 0;
long count = 0;
List<Long> b = new ArrayList<>();
for (int i = 0; i < n; i++) {
if (a[i] >= x) {
sum += a[i];
count++;
}
if (y < a[i] && a[i] < x) b.add(a[i]);
}
if (m < count) {
stdout.println("Handicapped");
return;
}
long ans = 0;
for (int p = 0; p <= m-count; p++) {
for (List<Long> comb : new Combinations<>(b, p)) {
long numer = sum;
for (long v : comb) numer += v;
long denom = count + p;
if (denom > 0 && numer%denom==0 && numer/denom==z) {
ans++;
}
}
}
stdout.println(ans);
}
private static final Stdin stdin = new Stdin(System.in);
private static final Stdout stdout = new Stdout(System.out);
private static final Stderr stderr = new Stderr(System.err, false);
public static void main(String[] args) {
try {
new Main().exec();
} finally {
stdout.flush();
}
}
public class Combinations<T> implements Iterable<List<T>>{
private List<T> src;
private int n;
public Combinations(List<T> src, int n) {
this.src = src;
this.n = n;
}
@Override
public Iterator<List<T>> iterator() {
return new CombinationsIterator<>(src, n);
}
private class CombinationsIterator<S> implements Iterator<List<S>> {
private List<S> src;
private int m;
private int len;
private int bit;
private List<S> ptr;
public CombinationsIterator(List<S> src, int m) {
this.src = src;
this.len = src.size();
this.m = m;
this.bit = 0;
}
@Override
public boolean hasNext() {
while (bit < (1<<len)) {
if (m<=0 || Integer.bitCount(bit)==m) {
this.ptr = new ArrayList<>();
for (int i = 0; i < len; i++) {
if ((bit&(1<<i))!=0) ptr.add(src.get(i));
}
bit++;
return true;
} else {
bit++;
}
}
return false;
}
@Override
public List<S> next() {
return this.ptr;
}
}
}
// ASCII ONLY
public static class Stdin {
private InputStream in;
private byte[] buf;
private int ptr;
private int len;
public Stdin(InputStream in) {
this.in = in;
this.buf = new byte[1024];
this.ptr = 0;
this.len = 0;
}
public String nextString() {
StringBuilder sb = new StringBuilder();
byte b;
while ((b = read()) != -1) {
sb.appendCodePoint(b);
}
return sb.toString();
}
public int nextInt() {
return (int)nextLong();
}
public double nextDouble() {
return Double.parseDouble(nextString());
}
public long nextLong() {
boolean negative = false;
int x = 0;
byte b = read();
if (b == '-') {
negative = true;
} else {
x += b-'0';
}
while ((b=read()) != -1) {
x *= 10;
x += b-'0';
}
return negative ? -x : x;
}
private byte read() {
byte b = readByte();
if (b == '\r') {
readByte(); // LFを読み飛ばす
return -1;
} else if (b == '\n' || b == ' ') {
return -1;
} else {
return b;
}
}
private byte readByte(){
if (len == ptr) {
try {
ptr = 0;
len = in.read(buf);
if (len == -1) return -1;
} catch (IOException e) {
throw new UncheckedIOException(e);
}
}
return buf[ptr++];
}
public String[] nextStringArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++) a[i] = nextString();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++) a[i] = nextDouble();
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 static class Stdout {
private PrintWriter stdout;
public Stdout(PrintStream stdout) {
this.stdout = new PrintWriter(stdout, false);
}
public void println(Object ... objs) {
for (int i = 0, len = objs.length; i < len; i++) {
stdout.print(objs[i]);
if (i != len-1) stdout.print(' ');
}
stdout.println();
}
public void flush() {
stdout.flush();
}
}
public static class Stderr {
private PrintWriter stderr;
private boolean debug;
public Stderr(PrintStream stderr, boolean debug) {
this.stderr = new PrintWriter(stderr, false);
this.debug = debug;
}
public void println(Object ... objs) {
if (!debug) return ;
stderr.print("DEBUG: ");
for (int i = 0, len = objs.length; i < len; i++) {
stderr.print(deepToString(objs[i]));
if (i != len-1) stderr.print(' ');
}
stderr.println();
stderr.flush();
}
private String deepToString(Object o) {
if (o == null) {
return "null";
}
// 配列の場合
if (o.getClass().isArray()) {
int len = Array.getLength(o);
String[] tokens = new String[len];
for (int i = 0; i < len; i++) {
tokens[i] = deepToString(Array.get(o, i));
}
return "{" + String.join(", ", tokens) + "}";
}
return Objects.toString(o);
}
}
}
neko_the_shadow