Submission #1174909
Source Code Expand
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Queue;
public class Main {
public static int Q = 1000;
public static int N = 8;
public static int[] c = new int[N];
public static int[] a = new int[N];
public static int d;
public static int t;
public static int step = 0;
public static IO io = new IO();
public static boolean DEBUG = false;
public static int MAX_D = 50;
public static int HIGH = 35; //狙う客
public static int COVER_N = 7; //最大でもこれくらいしか一度に使いたくない
public static int CSUM_THRES = 60; //これくらいの総容量がほしい
public static int PREFILL = 4; //これくらいはあらかじめfillしておきたい
public static void input() {
d = io.nextInt();
t = io.nextInt();
for(int i=0;i<N;i++) {
c[i] = io.nextInt();
}
for(int i=0;i<N;i++) {
a[i] = io.nextInt();
}
}
public static void main(String[] args) throws Exception {
Thread.setDefaultUncaughtExceptionHandler((t,e)->System.err.flush());
for(int i=0;i<Q;i++) {
step++;
input();
String move = move();
io.println(move);
io.flush();
}
}
public static Queue<String> queue = new ArrayDeque<>();
public static String changeMin() {
int min = Integer.MAX_VALUE;
int mini = -1;
for(int i=0;i<N;i++) {
int x = c[i] * 100 + a[i];
if (x < min) {
min = x;
mini = i;
}
}
return "change " + (mini + 1);
}
public static String fillBig() {
int max2 = 0;
int maxi2 = -1;
for(int i=0;i<N;i++) {
if (a[i] != c[i]) {
int x = c[i] * 100 - a[i];
if (x > max2) {
max2 = x;
maxi2 = i;
}
}
}
return "fill " + (maxi2 + 1);
}
public static String move() {
int csum = 0;
int asum = 0;
int fullcount = 0;
for(int i=0;i<N;i++) {
csum += c[i];
asum += a[i];
if (a[i] == c[i]) {
fullcount++;
}
}
if (queue.isEmpty()) {
boolean ok = false;
if (d >= HIGH || step >= 970) {
if (d >= HIGH) {
debug(String.format("%4d:",d * d) + "HIGH! " + "sum=" + csum + " t=" + t);
}else{
debug(String.format("%4d:",d * d) + "LAST! " + "sum=" + csum + " t=" + t);
}
ArrayList<String> sell = sell(99);
if (sell != null) {
ok = true;
queue.addAll(sell);
double ppt = (double) d * d / sell.size();
debug(String.format("%4d:", d * d) + "SELL " + sell.size() + "turn " + String.format("%.1fppt", ppt));
}
}
if (!ok) {
boolean filledBig = true;
for(int i=0;i<N;i++) {
if (c[i] >= 9 && c[i] != a[i]) {
filledBig = false;
break;
}
}
if (csum < CSUM_THRES && filledBig) {
debug(String.format("SMALL csum=%d", csum));
return changeMin();
}
if (fullcount <= PREFILL || !filledBig) {
debug(String.format("PREFILL csum=%d asum=%d full=%d", csum, asum, fullcount));
return fillBig();
}
double cover = cover(c,HIGH,MAX_D,COVER_N);
int maxi = -1;
double max = cover;
{
for(int i=0;i<N;i++) {
int temp = c[i];
double sum = 0;
for(int j=1;j<=10;j++) {
c[i] = j;
sum += cover(c,HIGH,MAX_D,COVER_N);
}
c[i] = temp;
double average = sum / 10;
if (average > max) {
max = average;
maxi = i;
}
}
}
if (maxi == -1) {
debug(String.format("CANNOT IMPROVE %.2f", cover));
return "pass";
}else{
debug(String.format("IMPROVE! %.2f->%.2f", cover, max));
return "change " + (maxi + 1);
}
}
}
if (!queue.isEmpty()) {
return queue.poll();
}
return "pass";
}
public static ArrayList<String> sell(int max) {
int best = Integer.MAX_VALUE;
int bestMask = 0;
LOOP: for(int i=1;i<1<<N;i++) {
int sum = 0;
int need = 0;
for(int j=0;j<N;j++) {
if ((i >> j & 1) == 1) {
if (c[j] > max) {
continue LOOP;
}
sum += c[j];
if (a[j] != c[j]) {
need++;
}
}
}
if (sum == d) {
if (need < best) {
best = need;
bestMask = i;
}
}
}
if (bestMask <= 0) {
return null;
}
if (best + 1 > t) {
return null;
}
ArrayList<String> res = new ArrayList<>();
for(int j=0;j<N;j++) {
if ((bestMask >> j & 1) == 1 && a[j] != c[j]) {
res.add("fill " + (j + 1));
}
}
String sell = "sell " + Integer.bitCount(bestMask);
for(int j=0;j<N;j++) {
if ((bestMask >> j & 1) == 1) {
sell += " " + (j + 1);
}
}
res.add(sell);
return res;
}
public static double cover(int[] c,int min,int max,int t) {
long[] cover = new long[9];
int filledMask = 0;
for(int j=0;j<N;j++) {
if (a[j] == c[j]) {
filledMask |= 1 << j;
}
}
for(int i=0;i<1<<N;i++) {
int sum = 0;
for(int j=0;j<N;j++) {
if ((i >> j & 1) == 1) {
sum += c[j];
}
}
int bc = Integer.bitCount(i & ~filledMask);
for(int j=bc;j<=8;j++) {
cover[j] |= 1L << sum;
}
}
for(int b=0;b<8;b++) {
int count = 0;
for(int i=min;i<=max;i++) {
if ((cover[t-b] >> i & 1) == 1) {
count++;
}
}
if (count != max - min + 1) {
return b + (double) count / (max - min + 1);
}
}
return -1; //?
}
public static int randInt(int min,int max) {
return (int) (Math.random() * (max - min + 1)) + min;
}
public static int lastStep = -1;
public static void debug(Object o) {
if (DEBUG) {
if (lastStep != step) {
System.err.println();
System.err.print(step + ".");
lastStep = step;
}
System.err.print(" " + o);
}
}
}
class IO extends PrintWriter {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { super(System.out); this.in = source;}
public IO(InputStream source, OutputStream out) {
super(out);
this.in = source;
}
public IO(String fileName) throws IOException {
super(new FileOutputStream(fileName + ".out"), false);
this.in = new FileInputStream(new File(fileName + ".txt"));
}
public IO(String in,String out) throws IOException {
super(new FileOutputStream(out + ".out"), false);
this.in = new FileInputStream(new File(in + ".txt"));
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] nextCharArray(int len) {
if (!hasNext()) {
throw new NoSuchElementException();
}
char[] s = new char[len];
int i = 0;
int b = readByte();
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
b = readByte();
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return (char) readByte();
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); 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 double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
Submission Info
Submission Time |
|
Task |
A - 石油王Xの憂鬱 |
User |
piroz95 |
Language |
Java8 (OpenJDK 1.8.0) |
Score |
6171516 |
Code Size |
10033 Byte |
Status |
AC |
Exec Time |
609 ms |
Memory |
39320 KB |
Judge Result
Set Name |
test_01 |
test_02 |
test_03 |
test_04 |
test_05 |
test_06 |
test_07 |
test_08 |
test_09 |
test_10 |
test_11 |
test_12 |
test_13 |
test_14 |
test_15 |
test_16 |
test_17 |
test_18 |
test_19 |
test_20 |
test_21 |
test_22 |
test_23 |
test_24 |
test_25 |
test_26 |
test_27 |
test_28 |
test_29 |
test_30 |
test_31 |
test_32 |
test_33 |
test_34 |
test_35 |
test_36 |
test_37 |
test_38 |
test_39 |
test_40 |
test_41 |
test_42 |
test_43 |
test_44 |
test_45 |
test_46 |
test_47 |
test_48 |
test_49 |
test_50 |
Score / Max Score |
117920 / 417500 |
111659 / 417500 |
126378 / 417500 |
117941 / 417500 |
115084 / 417500 |
122726 / 417500 |
127340 / 417500 |
129486 / 417500 |
127729 / 417500 |
129074 / 417500 |
139400 / 417500 |
122843 / 417500 |
136459 / 417500 |
130436 / 417500 |
116857 / 417500 |
135753 / 417500 |
111181 / 417500 |
126257 / 417500 |
126735 / 417500 |
111359 / 417500 |
127159 / 417500 |
123968 / 417500 |
124807 / 417500 |
122867 / 417500 |
134878 / 417500 |
111739 / 417500 |
116390 / 417500 |
124204 / 417500 |
123942 / 417500 |
129666 / 417500 |
133307 / 417500 |
119234 / 417500 |
115783 / 417500 |
125046 / 417500 |
122573 / 417500 |
121404 / 417500 |
120533 / 417500 |
111073 / 417500 |
120951 / 417500 |
124160 / 417500 |
129735 / 417500 |
123928 / 417500 |
131619 / 417500 |
126845 / 417500 |
122682 / 417500 |
119628 / 417500 |
125543 / 417500 |
115309 / 417500 |
114391 / 417500 |
125535 / 417500 |
Status |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Set Name |
Test Cases |
test_01 |
subtask_01_01.txt |
test_02 |
subtask_01_02.txt |
test_03 |
subtask_01_03.txt |
test_04 |
subtask_01_04.txt |
test_05 |
subtask_01_05.txt |
test_06 |
subtask_01_06.txt |
test_07 |
subtask_01_07.txt |
test_08 |
subtask_01_08.txt |
test_09 |
subtask_01_09.txt |
test_10 |
subtask_01_10.txt |
test_11 |
subtask_01_11.txt |
test_12 |
subtask_01_12.txt |
test_13 |
subtask_01_13.txt |
test_14 |
subtask_01_14.txt |
test_15 |
subtask_01_15.txt |
test_16 |
subtask_01_16.txt |
test_17 |
subtask_01_17.txt |
test_18 |
subtask_01_18.txt |
test_19 |
subtask_01_19.txt |
test_20 |
subtask_01_20.txt |
test_21 |
subtask_01_21.txt |
test_22 |
subtask_01_22.txt |
test_23 |
subtask_01_23.txt |
test_24 |
subtask_01_24.txt |
test_25 |
subtask_01_25.txt |
test_26 |
subtask_01_26.txt |
test_27 |
subtask_01_27.txt |
test_28 |
subtask_01_28.txt |
test_29 |
subtask_01_29.txt |
test_30 |
subtask_01_30.txt |
test_31 |
subtask_01_31.txt |
test_32 |
subtask_01_32.txt |
test_33 |
subtask_01_33.txt |
test_34 |
subtask_01_34.txt |
test_35 |
subtask_01_35.txt |
test_36 |
subtask_01_36.txt |
test_37 |
subtask_01_37.txt |
test_38 |
subtask_01_38.txt |
test_39 |
subtask_01_39.txt |
test_40 |
subtask_01_40.txt |
test_41 |
subtask_01_41.txt |
test_42 |
subtask_01_42.txt |
test_43 |
subtask_01_43.txt |
test_44 |
subtask_01_44.txt |
test_45 |
subtask_01_45.txt |
test_46 |
subtask_01_46.txt |
test_47 |
subtask_01_47.txt |
test_48 |
subtask_01_48.txt |
test_49 |
subtask_01_49.txt |
test_50 |
subtask_01_50.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask_01_01.txt |
AC |
585 ms |
32188 KB |
subtask_01_02.txt |
AC |
609 ms |
34704 KB |
subtask_01_03.txt |
AC |
529 ms |
30376 KB |
subtask_01_04.txt |
AC |
559 ms |
29868 KB |
subtask_01_05.txt |
AC |
547 ms |
31944 KB |
subtask_01_06.txt |
AC |
508 ms |
27132 KB |
subtask_01_07.txt |
AC |
543 ms |
30436 KB |
subtask_01_08.txt |
AC |
501 ms |
27896 KB |
subtask_01_09.txt |
AC |
537 ms |
29420 KB |
subtask_01_10.txt |
AC |
500 ms |
28500 KB |
subtask_01_11.txt |
AC |
606 ms |
37940 KB |
subtask_01_12.txt |
AC |
572 ms |
33892 KB |
subtask_01_13.txt |
AC |
519 ms |
27264 KB |
subtask_01_14.txt |
AC |
509 ms |
27796 KB |
subtask_01_15.txt |
AC |
601 ms |
29616 KB |
subtask_01_16.txt |
AC |
521 ms |
29588 KB |
subtask_01_17.txt |
AC |
563 ms |
32068 KB |
subtask_01_18.txt |
AC |
529 ms |
35764 KB |
subtask_01_19.txt |
AC |
547 ms |
34704 KB |
subtask_01_20.txt |
AC |
513 ms |
34020 KB |
subtask_01_21.txt |
AC |
546 ms |
35628 KB |
subtask_01_22.txt |
AC |
536 ms |
34244 KB |
subtask_01_23.txt |
AC |
534 ms |
27324 KB |
subtask_01_24.txt |
AC |
518 ms |
27832 KB |
subtask_01_25.txt |
AC |
563 ms |
36012 KB |
subtask_01_26.txt |
AC |
534 ms |
34224 KB |
subtask_01_27.txt |
AC |
582 ms |
31520 KB |
subtask_01_28.txt |
AC |
564 ms |
29440 KB |
subtask_01_29.txt |
AC |
534 ms |
29780 KB |
subtask_01_30.txt |
AC |
540 ms |
33440 KB |
subtask_01_31.txt |
AC |
543 ms |
39320 KB |
subtask_01_32.txt |
AC |
512 ms |
28872 KB |
subtask_01_33.txt |
AC |
566 ms |
29140 KB |
subtask_01_34.txt |
AC |
586 ms |
37412 KB |
subtask_01_35.txt |
AC |
560 ms |
28688 KB |
subtask_01_36.txt |
AC |
539 ms |
29716 KB |
subtask_01_37.txt |
AC |
556 ms |
28416 KB |
subtask_01_38.txt |
AC |
575 ms |
30816 KB |
subtask_01_39.txt |
AC |
533 ms |
30364 KB |
subtask_01_40.txt |
AC |
501 ms |
29748 KB |
subtask_01_41.txt |
AC |
561 ms |
29720 KB |
subtask_01_42.txt |
AC |
546 ms |
26420 KB |
subtask_01_43.txt |
AC |
548 ms |
30172 KB |
subtask_01_44.txt |
AC |
497 ms |
30544 KB |
subtask_01_45.txt |
AC |
537 ms |
29716 KB |
subtask_01_46.txt |
AC |
577 ms |
33692 KB |
subtask_01_47.txt |
AC |
550 ms |
29828 KB |
subtask_01_48.txt |
AC |
567 ms |
29944 KB |
subtask_01_49.txt |
AC |
550 ms |
31156 KB |
subtask_01_50.txt |
AC |
556 ms |
29428 KB |