結果
| 問題 |
No.5014 セクスタプル (reactive)
|
| コンテスト | |
| ユーザー |
 EvbCFfp1XB
|
| 提出日時 | 2022-12-29 20:26:42 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 198 ms / 2,000 ms |
| コード長 | 11,450 bytes |
| コンパイル時間 | 2,428 ms |
| 実行使用メモリ | 68,480 KB |
| スコア | 545,148,517 |
| 平均クエリ数 | 35.00 |
| 最終ジャッジ日時 | 2022-12-29 20:27:14 |
| 合計ジャッジ時間 | 25,156 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge11 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 100 |
ソースコード
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private int[][] dice;
private int[][] table;
private int[] counts = new int[6];
public static void main(String[] args) throws Exception {
new Main().run();
}
private void run() {
solve();
}
private void solve() {
try (final Scanner in = new Scanner(System.in)) {
table = new int[6][6];
for (int r = 0; r < 6; r++) {
Arrays.fill(table[r], -1);
}
dice = new int[35][6];
for (int index = 0; index < 35; index++) {
for (int j = 0; j < 6; j++) {
dice[index][j] = in.nextInt() - 1;
if (index == 0 && j == 0) {
Constants.watch.init();
}
}
int[] counts = counts(dice[index]);
int best = (int) -1e9;
int bestR = -1;
int bestC = -1;
for (int d = 0; d < 6; d++) {
for (int d2 = 0; d2 < 6; d2++) {
int r = dice[index][d];
int c = dice[index][d2];
// if (r == c) {
// if (counts[r] < 2) {
// continue;
// }
// }
int[][] copyTable = copy(table);
if (copyTable[r][c] >= 0) {
continue;
}
copyTable[r][c] = index;
int score = calculateScore(copyTable);
if (score > best) {
best = score;
bestR = r;
bestC = c;
}
}
}
if (bestR < 0) {
for (int r = 0; r < 6; r++) {
for (int c = 0; c < 6; c++) {
int[][] copyTable = copy(table);
if (copyTable[r][c] >= 0) {
continue;
}
copyTable[r][c] = index;
int score = calculateScore(copyTable);
if (score > best) {
best = score;
bestR = r;
bestC = c;
}
}
}
}
table[bestR][bestC] = index;
Utils.debug(index, "best", best);
System.out.println((bestR + 1) + " " + (bestC + 1));
System.out.flush();
}
} catch (Exception e) {
e.printStackTrace();
}
}
private int[] counts(int[] dice) {
int[] counts = new int[6];
for (int i = 0; i < 6; i++) {
counts[dice[i]]++;
}
return counts;
}
private int[][] copy(int[][] table) {
int[][] copy = new int[6][6];
for (int r = 0; r < 6; r++) {
for (int c = 0; c < 6; c++) {
copy[r][c] = table[r][c];
}
}
return copy;
}
private int[] rank(int[] dice) {
int[] counts = new int[6];
for (int i = 0; i < dice.length; i++) {
counts[dice[i]]++;
}
int[] rank = new int[6];
for (int i = 0; i < counts.length; i++) {
for (int j = 0; j < counts.length; j++) {
if (j == i) {
continue;
}
if (counts[i] < counts[j]) {
rank[i]++;
}
}
}
return rank;
}
private int calculateScore(int[][] table) {
int score = 0;
for (int r = 0; r < 6; r++) {
score += partScoreRow(table, r);
}
for (int c = 0; c < 6; c++) {
score += partScoreColumn(table, c);
}
return score;
}
private int partScoreColumn(int[][] table, int c) {
Arrays.fill(counts, 0);
int mask = (1 << 6) - 1;
int count_r = 0;
for (int r = 0; r < 6; r++) {
int index = table[r][c];
if (index < 0) {
continue;
}
count_r++;
int mask2 = 0;
for (int i = 0; i < 6; i++) {
counts[dice[index][i]]++;
mask2 |= (1 << dice[index][i]);
}
mask &= mask2;
}
int part_score = 0;
for (int i = 0; i < 6; i++) {
if ((mask & (1 << i)) == 0) {
continue;
}
if (counts[i] == 0) {
continue;
}
// part_score += 3;
part_score += counts[i];
}
return part_score;
}
private int partScoreRow(int[][] table, int r) {
Arrays.fill(counts, 0);
int mask = (1 << 6) - 1;
int count_c = 0;
for (int c = 0; c < 6; c++) {
int index = table[r][c];
if (index < 0) {
continue;
}
count_c++;
int mask2 = 0;
for (int i = 0; i < 6; i++) {
counts[dice[index][i]]++;
mask2 |= (1 << dice[index][i]);
}
mask &= mask2;
}
int part_score = 0;
for (int i = 0; i < 6; i++) {
if ((mask & (1 << i)) == 0) {
continue;
}
if (counts[i] == 0) {
continue;
}
// part_score += 3;
part_score += counts[i];
}
return part_score;
}
}
class SAState {
public static final boolean useTime = true;
public double startTime;
public double endTime;
public double time;
public double startTemperature;
public double endTemperature;
public double inverseTemperature;
public double lastAcceptTemperature;
public double startRange;
public double endRange;
public double range;
public int numIterations;
public int validIterations;
public int acceptIterations;
private double[] log = new double[32768];
public SAState() {
for (int i = 0; i < log.length; i++) {
log[i] = Math.log((i + 0.5) / log.length);
}
}
public void init() {
numIterations = 0;
validIterations = 0;
acceptIterations = 0;
startTime = useTime ? Constants.watch.getSecond() : numIterations;
update();
lastAcceptTemperature = inverseTemperature;
}
public void update() {
updateTime();
updateTemperature();
}
public boolean useExp = !true;
public void updateTemperature() {
if (useExp) {
double time0to1 = elapsedPercentage(startTime, endTime, time);
double startY = startTemperature;
double endY = endTemperature;
double startX = Math.log(startY);
double endX = Math.log(endY);
double xStartToEnd = interpolate(startX, endX, time0to1);
double temperature = Math.exp(xStartToEnd);
inverseTemperature = 1.0 / temperature;
} else {
double time0to1 = elapsedPercentage(startTime, endTime, time);
double startY = startTemperature;
double endY = endTemperature;
double temperature = interpolate(startY, endY, time0to1);
inverseTemperature = 1.0 / temperature;
}
}
private double elapsedPercentage(double min, double max, double v) {
return (v - min) / (max - min);
}
private double interpolate(double v0, double v1, double d0to1) {
return v0 + (v1 - v0) * d0to1;
}
public void updateRange() {
range = endRange + (startRange - endRange) * Math.pow((endTime - time) / (endTime - startTime), 1.0);
}
public void updateTime() {
time = useTime ? Constants.watch.getSecond() : numIterations;
}
public boolean isTLE() {
return time >= endTime;
}
public boolean accept(double deltaScore) {
return acceptB(deltaScore);
}
public boolean acceptB(double deltaScore) {
validIterations++;
if (deltaScore > -1e-9) {
acceptIterations++;
return true;
}
double d = deltaScore * inverseTemperature;
if (d < -10) {
return false;
}
if (log[Constants.RNG.nextInt() & 32767] < d) {
acceptIterations++;
lastAcceptTemperature = inverseTemperature;
return true;
}
return false;
}
public boolean acceptS(double deltaScore) {
validIterations++;
if (deltaScore < 1e-9) {
acceptIterations++;
return true;
}
double d = -deltaScore * inverseTemperature;
if (d < -10) {
return false;
}
if (log[Constants.RNG.nextInt() & 32767] < d) {
acceptIterations++;
lastAcceptTemperature = inverseTemperature;
return true;
}
return false;
}
}
final class Utils {
private Utils() {
}
public static final void debug(Object... o) {
System.err.println(toString(o));
System.err.flush();
}
public static final String toString(Object... o) {
return Arrays.deepToString(o);
}
public static boolean isValid(int v, int min, int minUpper) {
return v >= min && v < minUpper;
}
}
class Watch {
private long start;
public Watch() {
init();
}
public double getSecond() {
return (System.nanoTime() - start) * 1e-9;
}
public void init() {
init(System.nanoTime());
}
private void init(long start) {
this.start = start;
}
public String getSecondString() {
return toString(getSecond());
}
public static final String toString(double second) {
if (second < 60) {
return String.format("%5.2fs", second);
} else if (second < 60 * 60) {
int minute = (int) (second / 60);
return String.format("%2dm%2ds", minute, (int) (second % 60));
} else {
int hour = (int) (second / (60 * 60));
int minute = (int) (second / 60);
return String.format("%2dh%2dm%2ds", hour, minute % (60), (int) (second % 60));
}
}
}
interface Constants {
Watch watch = new Watch();
PCG_XSH_RR RNG = new PCG_XSH_RR(System.nanoTime());
}
final class PCG_XSH_RR {
private long state = 5342;
public PCG_XSH_RR(final long state) {
this.state = state;
}
public int nextInt() {
final long oldstate = state;
state = oldstate * 6364136223846793005L + 521L;
final int xorshift = (int) (((oldstate >>> 18) ^ oldstate) >>> 27);
final int rotation = (int) (oldstate >>> 59);
return (xorshift >>> rotation) | (xorshift << (-rotation & 31));
}
public int nextInt(int n) {
return (int) (n * nextDouble());
}
public double nextDouble() {
return (nextInt() >>> 1) * 4.6566128730773926E-10;
}
}