結果
| 問題 | No.95 Alice and Graph |
| ユーザー |
 atn112323
|
| 提出日時 | 2016-03-21 23:28:02 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,584 ms / 5,000 ms |
| コード長 | 13,201 bytes |
| コンパイル時間 | 2,787 ms |
| コンパイル使用メモリ | 93,604 KB |
| 実行使用メモリ | 48,500 KB |
| 最終ジャッジ日時 | 2024-10-01 12:30:54 |
| 合計ジャッジ時間 | 9,285 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 532 ms
47,892 KB |
| testcase_01 | AC | 199 ms
48,120 KB |
| testcase_02 | AC | 218 ms
48,500 KB |
| testcase_03 | AC | 83 ms
46,544 KB |
| testcase_04 | AC | 720 ms
47,956 KB |
| testcase_05 | AC | 497 ms
48,196 KB |
| testcase_06 | AC | 778 ms
48,072 KB |
| testcase_07 | AC | 200 ms
47,988 KB |
| testcase_08 | AC | 75 ms
38,572 KB |
| testcase_09 | AC | 47 ms
37,168 KB |
| testcase_10 | AC | 47 ms
37,132 KB |
| testcase_11 | AC | 92 ms
39,468 KB |
| testcase_12 | AC | 73 ms
38,612 KB |
| testcase_13 | AC | 1,584 ms
47,920 KB |
ソースコード
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
public class Main {
/**
* This class represents a problem setting.
*/
class Problem implements IProblem {
int[] NMK;
int[][] UV;
@Override
public void set(ProblemReader reader) throws IOException {
NMK = reader.nextIntArray();
UV = reader.nextIntArray2(NMK[1]);
}
@Override
public String toString() {
// TODO
return null;
}
}
/**
* Solver for the problem.
* It's the most important part of codes in this file.
*/
class Solver implements IProblemSolver<Problem> {
int INF = 1000000;
@Override
public String solve(Problem problem) {
int N = problem.NMK[0], M = problem.NMK[1], K = problem.NMK[2];
int[][] UV = problem.UV;
return StringUtils.toString(solve(N, M, K, UV));
}
private long solve(int N, int M, int K, int[][] UV) {
int[][] d = new int[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
d[i][j] = INF;
}
}
for (int i = 0; i < M; i++) {
int u = UV[i][0] - 1, v = UV[i][1] - 1;
d[u][v] = 1; d[v][u] = 1;
}
for (int k = 0; k < N; k++) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
d[i][j] = Math.min(d[i][j], d[i][k] + d[k][j]);
}
}
}
List<Integer> ids = new ArrayList<>();
ids.add(0);
int[][] dp = new int[1 << (K + 1)][K + 1];
for (int j = 0; j < 1 << (K + 1); j++) {
for (int k = 0; k < K + 1; k++) {
dp[j][k] = INF;
}
}
dp[1][0] = 0;
long res = 0;
for (int i = N - 1; i > 0 && ids.size() < K + 1; i--) {
ids.add(i);
for (int j = 1 << (ids.size() - 1); j < 1 << ids.size(); j++) {
for (int k = 0; k < ids.size(); k++) {
dp[j][k] = INF;
}
}
for (int j = 1 << (ids.size() - 1); j < 1 << ids.size(); j++) {
for (int k = 0; k < ids.size(); k++) {
if (((j >> k) & 1) == 1) {
for (int l = 0; l < ids.size(); l++) {
if (l != k && ((j >> l) & 1) == 1) {
dp[j][k] = Math.min(dp[j][k], dp[j ^ (1 << k)][l] + d[ids.get(l)][ids.get(k)]);
}
}
}
}
}
boolean ok = false;
for (int j = 0; j < ids.size(); j++) {
if (dp[(1 << ids.size()) - 1][j] <= K) {
ok = true;
break;
}
}
if (!ok) {
ids.remove(ids.size() - 1);
} else {
res += (1l << i) - 1;
}
}
return res;
}
}
/**
* This class is a solver to confirm the main solver.
* This solver often works only for a problem with a small number setting.
*/
class Solver2 implements IProblemSolver<Problem> {
@Override
public String solve(Problem problem) {
// TODO
return null;
}
}
class Factory implements IProblemFactory<Problem> {
@Override
public Problem newProblem() {
// TODO
return null;
}
@Override
public Problem newProblem(ProblemReader reader) throws IOException {
Problem problem = new Problem();
problem.set(reader);
return problem;
}
}
class ResultComparator implements IResultComparator {
@Override
public boolean same(String res1, String res2) {
// TODO
return res1.equals(res2);
}
}
ProblemProcessor<Problem> processor;
Main() {
Init();
}
void Init() {
ProblemProcessorConfig<Problem> config = new ProblemProcessorConfig<>();
config.factory = new Factory();
config.solver = new Solver();
config.solver2 = new Solver2();
config.comparator = new ResultComparator();
processor = new ProblemProcessor<Problem>(config);
}
void process(String mode) throws IOException {
processor.process(mode);
}
public static void main(String args[]) throws IOException {
String mode = "solve";
new Main().process(mode);
}
/*
Common library
*/
interface IProblem {
abstract void set(ProblemReader reader) throws IOException;
}
interface IProblemFactory<P extends IProblem> {
abstract P newProblem();
abstract P newProblem(ProblemReader reader) throws IOException;
}
interface IProblemSolver<P extends IProblem> {
abstract String solve(P problem);
}
interface IResultComparator {
abstract boolean same(String res1, String res2);
}
class ProblemReader {
BufferedReader br = null;
ProblemReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
int nextInt() throws IOException {
return StringUtils.toInt(br.readLine());
}
long nextLong() throws IOException {
return StringUtils.toLong(br.readLine());
}
double nextDouble() throws IOException {
return StringUtils.toDouble(br.readLine());
}
String nextString() throws IOException {
return br.readLine();
}
int[] nextIntArray() throws IOException {
return StringUtils.toIntArray(br.readLine());
}
long[] nextLongArray() throws IOException {
return StringUtils.toLongArray(br.readLine());
}
double[] nextDoubleArray() throws IOException {
return StringUtils.toDoubleArray(br.readLine());
}
String[] nextStringArray() throws IOException {
return StringUtils.toStringArray(br.readLine());
}
int[] nextIntArray(int n) throws IOException {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
long[] nextLongArray(int n) throws IOException {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
double[] nextDoubleArray(int n) throws IOException {
double[] a = new double[n];
for (int i = 0; i < n; i++) {
a[i] = nextDouble();
}
return a;
}
String[] nextStringArray(int n) throws IOException {
String[] strs = new String[n];
for (int i = 0; i < n; i++) {
strs[i] = nextString();
}
return strs;
}
int[][] nextIntArray2(int n) throws IOException {
int[][] a = new int[n][];
for (int i = 0; i < n; i++) {
a[i] = nextIntArray();
}
return a;
}
long[][] nextLongArray2(int n) throws IOException {
long[][] a = new long[n][];
for (int i = 0; i < n; i++) {
a[i] = nextLongArray();
}
return a;
}
double[][] nextDoubleArray2(int n) throws IOException {
double[][] a = new double[n][];
for (int i = 0; i < n; i++) {
a[i] = nextDoubleArray();
}
return a;
}
String[][] nextStringArray2(int n) throws IOException {
String[][] strs = new String[n][];
for (int i = 0; i < n; i++) {
strs[i] = nextStringArray();
}
return strs;
}
void close() throws IOException {
if (br != null) {
br.close();
}
}
}
class ProblemCreator<P extends IProblem> {
IProblemFactory<P> factory;
ProblemCreator(IProblemFactory<P> factory) {
this.factory = factory;
}
void create() throws FileNotFoundException {
P problem = factory.newProblem();
System.out.println(problem.toString());
}
}
class ProblemSolverComparator<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver1, solver2;
IResultComparator comparator;
ProblemSolverComparator(IProblemFactory<P> factory, IProblemSolver<P> solver1, IProblemSolver<P> solver2, IResultComparator comparator) {
this.factory = factory;
this.solver1 = solver1;
this.solver2 = solver2;
this.comparator = comparator;
}
void compare() throws IOException {
ProblemReader reader = null;
try {
reader = new ProblemReader();
P problem = factory.newProblem(reader);
String res1 = solver1.solve(problem);
String res2 = solver2.solve(problem);
if (comparator.same(res1, res2)) {
System.out.println(res1);
} else {
System.err.println(res1 + " " + res2);
}
} finally {
if (reader != null) {
reader.close();
}
}
}
}
class ProblemAnswerer<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver;
ProblemAnswerer(IProblemFactory<P> factory, IProblemSolver<P> solver) {
this.factory = factory;
this.solver = solver;
}
void answer() throws IOException {
ProblemReader reader = null;
try {
reader = new ProblemReader();
P problem = factory.newProblem(reader);
String res = solver.solve(problem);
System.out.println(res);
} finally {
if (reader != null) {
reader.close();
}
}
}
}
class ProblemProcessorConfig<P extends IProblem> {
IProblemFactory<P> factory;
IProblemSolver<P> solver, solver2;
IResultComparator comparator;
}
class ProblemProcessor<P extends IProblem> {
ProblemProcessorConfig<P> config;
ProblemCreator<P> creator;
ProblemSolverComparator<P> comparator;
ProblemAnswerer<P> answerer;
ProblemProcessor(ProblemProcessorConfig<P> config) {
this.config = config;
creator = new ProblemCreator<P>(config.factory);
comparator = new ProblemSolverComparator<P>(config.factory, config.solver, config.solver2, config.comparator);
answerer = new ProblemAnswerer<P>(config.factory, config.solver);
}
void process(String mode) throws IOException {
switch (mode) {
case "create":
creator.create();
break;
case "debug":
comparator.compare();
break;
case "solve":
answerer.answer();
break;
}
}
}
static class StringUtils {
static String toString(int a) {
return String.valueOf(a);
}
static String toString(long a) {
return String.valueOf(a);
}
static String toString(double a) {
return String.valueOf(a);
}
static String toString(String str) {
return str;
}
static String toString(int[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(long[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(double[] a, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i < a.length - 1) {
sb.append(a[i] + delimiter);
} else {
sb.append(a[i]);
}
}
return sb.toString();
}
static String toString(String[] strs, String delimiter) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < strs.length; i++) {
if (i < strs.length - 1) {
sb.append(strs[i] + delimiter);
} else {
sb.append(strs[i]);
}
}
return sb.toString();
}
static String toString(int[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(long[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(double[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static String toString(String[][] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++) {
if (j < a[i].length - 1) {
sb.append(a[i][j] + " ");
} else {
sb.append(a[i][j]);
}
}
sb.append("\n");
}
sb.setLength(sb.length() - 1);
return sb.toString();
}
static int toInt(String s) {
return Integer.parseInt(s);
}
static long toLong(String s) {
return Long.parseLong(s);
}
static double toDouble(String s) {
return Double.parseDouble(s);
}
static int[] toIntArray(String s) {
String[] tokens = s.split(" ");
int[] a = new int[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Integer.parseInt(tokens[i]);
}
return a;
}
static long[] toLongArray(String s) {
String[] tokens = s.split(" ");
long[] a = new long[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Long.parseLong(tokens[i]);
}
return a;
}
static double[] toDoubleArray(String s) {
String[] tokens = s.split(" ");
double[] a = new double[tokens.length];
for (int i = 0; i < tokens.length; i++) {
a[i] = Double.parseDouble(tokens[i]);
}
return a;
}
static String[] toStringArray(String s) {
return s.split(" ");
}
}
}