結果
| 問題 |
No.1279 Array Battle
|
| コンテスト | |
| ユーザー |
neko_the_shadow
|
| 提出日時 | 2020-11-15 18:39:11 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 1,073 ms / 2,000 ms |
| コード長 | 6,672 bytes |
| コンパイル時間 | 2,761 ms |
| コンパイル使用メモリ | 86,108 KB |
| 実行使用メモリ | 110,772 KB |
| 最終ジャッジ日時 | 2024-07-23 01:19:23 |
| 合計ジャッジ時間 | 10,525 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 |
ソースコード
package yukicoder._1279;
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.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.stream.Collectors;
public class Main {
public void exec() {
int n = stdin.nextInt();
int[] a = stdin.nextIntArray(n);
int[] b = stdin.nextIntArray(n);
int ans = 0;
Map<Integer, Integer> count = new HashMap<>();
for (List<Integer> indexes : permutations(n)) {
int sum = 0;
for (int i = 0; i < n; i++) {
int diff = a[indexes.get(i)] - b[i];
if (diff >= 0) sum += diff;
}
count.put(sum, count.getOrDefault(sum, 0)+1);
}
int max = Collections.max(count.keySet());
stdout.println(count.get(max));
}
public List<List<Integer>> permutations(int n) {
Deque<LinkedHashSet<Integer>> stack = new ArrayDeque<>();
for (int i = 0; i < n; i++) {
LinkedHashSet<Integer> set = new LinkedHashSet<>();
set.add(i);
stack.add(set);
}
List<List<Integer>> answers = new ArrayList<>();
while (!stack.isEmpty()) {
LinkedHashSet<Integer> set = stack.removeLast();
if (set.size() == n) {
answers.add(set.stream().collect(Collectors.toList()));
} else {
for (int i = 0; i < n; i++) {
if (set.contains(i)) continue;
LinkedHashSet<Integer> nextSet = new LinkedHashSet<>();
nextSet.addAll(set);
nextSet.add(i);
stack.addLast(nextSet);
}
}
}
return answers;
}
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();
}
}
// 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