Submission #1174895
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 HIGH = 35;
public static int MAX_D = 50;
public static int COVER_N = 7;
public static int PREFILL = 4;
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 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) {
if (csum < 55) {
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;
}
}
//debug(String.format("SMALL csum=%d", csum));
return "change " + (mini + 1);
}
if (fullcount <= PREFILL) {
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;
}
}
}
debug(String.format("PREFILL csum=%d asum=%d full=%d", csum, asum, fullcount));
return "fill " + (maxi2 + 1);
}
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 (csum < 55 || max < 0.8) {
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;
}
}
//debug(String.format("SMALL avg=%.2f csum=%d", cover, csum));
return "change " + (mini + 1);
}else 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];
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);
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 |
6198124 |
Code Size |
9787 Byte |
Status |
AC |
Exec Time |
519 ms |
Memory |
36124 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 |
118218 / 417500 |
116862 / 417500 |
136363 / 417500 |
131058 / 417500 |
114777 / 417500 |
115416 / 417500 |
129850 / 417500 |
121670 / 417500 |
127913 / 417500 |
123979 / 417500 |
127940 / 417500 |
125572 / 417500 |
130984 / 417500 |
131527 / 417500 |
114605 / 417500 |
130212 / 417500 |
125043 / 417500 |
126140 / 417500 |
128503 / 417500 |
113639 / 417500 |
120991 / 417500 |
124441 / 417500 |
115875 / 417500 |
127022 / 417500 |
126412 / 417500 |
115932 / 417500 |
132258 / 417500 |
123716 / 417500 |
131149 / 417500 |
125644 / 417500 |
126017 / 417500 |
120324 / 417500 |
119413 / 417500 |
120802 / 417500 |
125824 / 417500 |
122280 / 417500 |
122804 / 417500 |
128364 / 417500 |
121621 / 417500 |
125775 / 417500 |
130175 / 417500 |
121324 / 417500 |
132679 / 417500 |
120400 / 417500 |
114900 / 417500 |
122047 / 417500 |
126279 / 417500 |
120654 / 417500 |
114906 / 417500 |
127825 / 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 |
519 ms |
33140 KB |
subtask_01_02.txt |
AC |
473 ms |
31844 KB |
subtask_01_03.txt |
AC |
442 ms |
29196 KB |
subtask_01_04.txt |
AC |
471 ms |
27708 KB |
subtask_01_05.txt |
AC |
474 ms |
28852 KB |
subtask_01_06.txt |
AC |
498 ms |
31600 KB |
subtask_01_07.txt |
AC |
461 ms |
27516 KB |
subtask_01_08.txt |
AC |
469 ms |
30256 KB |
subtask_01_09.txt |
AC |
459 ms |
31032 KB |
subtask_01_10.txt |
AC |
484 ms |
31556 KB |
subtask_01_11.txt |
AC |
469 ms |
27840 KB |
subtask_01_12.txt |
AC |
432 ms |
26668 KB |
subtask_01_13.txt |
AC |
489 ms |
30516 KB |
subtask_01_14.txt |
AC |
509 ms |
30308 KB |
subtask_01_15.txt |
AC |
507 ms |
31568 KB |
subtask_01_16.txt |
AC |
482 ms |
29388 KB |
subtask_01_17.txt |
AC |
463 ms |
29196 KB |
subtask_01_18.txt |
AC |
454 ms |
30020 KB |
subtask_01_19.txt |
AC |
450 ms |
28736 KB |
subtask_01_20.txt |
AC |
449 ms |
30568 KB |
subtask_01_21.txt |
AC |
489 ms |
31356 KB |
subtask_01_22.txt |
AC |
476 ms |
30572 KB |
subtask_01_23.txt |
AC |
472 ms |
36124 KB |
subtask_01_24.txt |
AC |
455 ms |
30508 KB |
subtask_01_25.txt |
AC |
474 ms |
27252 KB |
subtask_01_26.txt |
AC |
459 ms |
29812 KB |
subtask_01_27.txt |
AC |
464 ms |
29120 KB |
subtask_01_28.txt |
AC |
483 ms |
34128 KB |
subtask_01_29.txt |
AC |
479 ms |
28616 KB |
subtask_01_30.txt |
AC |
453 ms |
27192 KB |
subtask_01_31.txt |
AC |
489 ms |
31688 KB |
subtask_01_32.txt |
AC |
430 ms |
30048 KB |
subtask_01_33.txt |
AC |
477 ms |
27024 KB |
subtask_01_34.txt |
AC |
462 ms |
27624 KB |
subtask_01_35.txt |
AC |
469 ms |
29516 KB |
subtask_01_36.txt |
AC |
502 ms |
32628 KB |
subtask_01_37.txt |
AC |
497 ms |
32588 KB |
subtask_01_38.txt |
AC |
460 ms |
27968 KB |
subtask_01_39.txt |
AC |
478 ms |
29876 KB |
subtask_01_40.txt |
AC |
473 ms |
29364 KB |
subtask_01_41.txt |
AC |
468 ms |
31368 KB |
subtask_01_42.txt |
AC |
464 ms |
30084 KB |
subtask_01_43.txt |
AC |
456 ms |
29056 KB |
subtask_01_44.txt |
AC |
497 ms |
32172 KB |
subtask_01_45.txt |
AC |
508 ms |
32008 KB |
subtask_01_46.txt |
AC |
474 ms |
28100 KB |
subtask_01_47.txt |
AC |
485 ms |
28136 KB |
subtask_01_48.txt |
AC |
490 ms |
31796 KB |
subtask_01_49.txt |
AC |
472 ms |
31680 KB |
subtask_01_50.txt |
AC |
449 ms |
28252 KB |