Submission #1175024

---

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 int MAX_D = 50; 
	
	public static int HIGH = 35; //狙う客
	public static int LAST = 1000; //このターン以降Dにかかわらず売る
	
	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 {
		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() {
		if (!queue.isEmpty()) {
			return queue.poll();
		}
		
		if (d >= HIGH || step >= LAST) {
			ArrayList<String> sell = sell(99);
			if (sell != null) {
				queue.addAll(sell);
				return queue.poll();
			}
		}

		double currentScore = score(c, a, HIGH, MAX_D);
		Result res = nextBestMove(c, a, HIGH, MAX_D);
		
		if (res.score < 10.0) {
			return changeMin();
		}
		if (res.score > currentScore + 1e-9) {
			return res.move;	
		}

		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 || step + best > 1000) {
			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 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 double score(int[] c,int[] a,int min,int max) {
		//ok[i]のjビット目が1⇔次のターンに新しい客D=j,T=iが来たとき売るのが間に合う
		long[] ok = new long[11]; 
		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 time = Integer.bitCount(i & ~filledMask) + 1;
			ok[time] |= 1L << sum;
		}
		for(int i=1;i<=10;i++) {
			ok[i] |= ok[i-1];
		}
		double score = 0;
		for(int t=1;t<=10;t++) {
			for(int d=min;d<=max;d++) {
				if ((ok[t] >> d & 1) == 1) {
					score += d * d;
				}
			}
		}
		return score / (max - min + 1) / 10;
	}
	public static Result nextBestMove(int[] c,int[] a,int min,int max) {
		String bestMove = null;
		double bestScore = Double.NEGATIVE_INFINITY;
		//change
		for(int i=0;i<N;i++) {
			int tempc = c[i];
			int tempa = a[i];
			a[i] = 0;
			double sum = 0;
			for(int j=1;j<=10;j++) {
				c[i] = j;
				sum += score(c,a,min,max);
			}
			c[i] = tempc;
			a[i] = tempa;
			double score = sum / 10;
			if (score > bestScore) {
				bestScore = score;
				bestMove = "change " + (i + 1);
			}
		}
		//fill
		for(int i=0;i<N;i++) {
			int tempa = a[i];
			a[i] = c[i];
			double score = score(c,a,min,max);
			if (score > bestScore) {
				bestScore = score;
				bestMove = "fill " + (i + 1);
			}
			a[i] = tempa;
		}
		return new Result(bestMove, bestScore);
	}
}
class Result {
	String move;
	double score;
	public Result(String move, double score) {
		super();
		this.move = move;
		this.score = score;
	}
}
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

Judge Result