Submission #433420

---

Source Code Expand

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;

class Solve{
	ContestScanner in;
	Solve() throws FileNotFoundException{
		in = new ContestScanner();
	}
	
	int[][] b;
	int[][] c;
	void solve() throws IOException{
		b = new int[2][3];
		c = new int[3][2];
		for(int i=0; i<2; i++){
			for(int j=0; j<3; j++){
				b[i][j] = in.nextInt();
			}
		}
		for(int i=0; i<3; i++){
			for(int j=0; j<2; j++){
				c[i][j] = in.nextInt();
			}
		}
		Point p = chokudai(new int[3][3], 0);
		System.out.println(p.ch);
		System.out.println(p.no);
	}
	
	Point chokudai(int[][] board, int used){
		int max = -1;
		Point mp = null;
		for(int i=0; i<3; i++){
			for(int j=0; j<3; j++){
				if(board[i][j] != 0) continue;
				board[i][j] = 1;
				Point p = naoko(board, used+1);
				if(max < p.ch){
					max = p.ch;
					mp = p;
				}
				board[i][j] = 0;
			}
		}
		return mp;
	}
	
	Point naoko(int[][] board, int used){
		if(used==9){
			Point c = culc(board);
			return c;
		}
		int max = -1;
		Point mp = null;
		for(int i=0; i<3; i++){
			for(int j=0; j<3; j++){
				if(board[i][j] != 0) continue;
				board[i][j] = -1;
				Point p = chokudai(board, used+1);
				if(max < p.no){
					max = p.no;
					mp = p;
				}
				board[i][j] = 0;
			}
		}
		return mp;
	}
	
	Point culc(int[][] board){
		int ch = 0;
		int no = 0;
		for(int i=0; i<2; i++){
			for(int j=0; j<3; j++){
				if(board[i][j] == board[i+1][j]) ch+=b[i][j];
				else no+=b[i][j];
			}
		}
		for(int i=0; i<3; i++){
			for(int j=0; j<2; j++){
				if(board[i][j] == board[i][j+1]) ch+=c[i][j];
				else no+=c[i][j];
			}
		}
		return new Point(ch, no);
	}
	
	
}

class Point{
	int ch, no;
	Point(int ch, int no){
		this.ch = ch;
		this.no = no;
	}
	
	public String toString(){
		return ch+" "+no;
	}
}

public class Main {
	static HashSet<String> set = new HashSet<String>();
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		Solve solve = new Solve();
		solve.solve();
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}

Submission Info

Judge Result