結果

問題 No.2178 Payable Magic Items
ユーザー tenten
提出日時 2023-01-25 11:00:41
言語 Java
(openjdk 23)
結果
AC  
実行時間 383 ms / 4,000 ms
コード長 2,393 bytes
コンパイル時間 4,687 ms
コンパイル使用メモリ 89,588 KB
実行使用メモリ 49,632 KB
最終ジャッジ日時 2024-06-26 16:17:29
合計ジャッジ時間 10,646 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int k = sc.nextInt();
int[] base = new int[k];
base[0] = 1;
for (int i = 1; i < k; i++) {
base[i] = base[i - 1] * 5;
}
int count = base[k - 1] * 5;
boolean[] enables = new boolean[count];
int[] counts = new int[count];
for (int i = 0; i < n; i++) {
int mask = 0;
for (char c : sc.next().toCharArray()) {
mask *= 5;
mask += c - '0';
}
counts[mask]++;
}
int ans = 0;
for (int i = count - 1; i >= 0; i--) {
for (int j = 0; j < k && !enables[i]; j++) {
if (i / base[j] % 5 < 4) {
enables[i] = enables[i + base[j]];
}
}
if (enables[i]) {
ans += counts[i];
}
enables[i] |= (counts[i] > 0);
}
System.out.println(ans);
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0