結果

問題 No.217 魔方陣を作ろう
ユーザー threepipes_s
提出日時 2015-05-26 23:31:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 81 ms / 5,000 ms
コード長 4,975 bytes
コンパイル時間 3,133 ms
コンパイル使用メモリ 87,516 KB
実行使用メモリ 43,592 KB
最終ジャッジ日時 2024-07-06 10:29:41
合計ジャッジ時間 4,734 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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.TreeSet;
public class Main {
    public static void main(String[] args) throws NumberFormatException,
    IOException {
        ContestScanner in = new ContestScanner();
        int n = in.nextInt();
        int[][] res = new int[n][n];
        if(n%2 == 1){
            odd(res, n);
        }else if(n%4 == 0){
            even4(res, n);
        }else{
            lux(res, n);
        }
        
        System.out.println(out(res, n));
    }
    
//  public static int[][] lux ={
//      {1, 1, 1, 1, 1},
//      {1, 1, 1, 1, 1},
//      {1, 1, 2, 1, 1},
//      {2, 2, 1, 2, 2},
//      {3, 3, 3, 3, 3},
//  };
    public static int[][] l = {
        {4, 1},
        {2, 3}
    };
    public static int[][] u = {
        {1, 4},
        {2, 3}
    };
    public static int[][] x = {
        {1, 4},
        {3, 2}
    };
    public static void lux(int[][] board, int n){
        int half = n/2;
        int[][] b = new int[half][half];
        odd(b, half);
        for(int i=0; i<half; i++){
            for(int j=0; j<half; j++){
                b[i][j] = (b[i][j]-1)*4;
            }
        }
        
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                board[i][j] = b[i/2][j/2]; 
            }
        }
        int[][] lux = new int[half][half];
        createLux(lux, half);
//      System.out.println(out(lux, half));
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                int val = lux[i/2][j/2];
                int add = 0;
                if(val == 0){
                    add = l[i%2][j%2];
                }else if(val == 1){
                    add = u[i%2][j%2];
                    
                }else{
                    add = x[i%2][j%2];
                    
                }
                board[i][j] += add;
            }
        }
    }
    
    public static void createLux(int[][] board, int n){
        // 0:L, 1:U, 2:X
        for(int i=n/2+2; i<n; i++){
            for(int j=0; j<n; j++){
                board[i][j] = 2;
            }
        }
        for(int i=0; i<n; i++){
//          board[n-1][i] = 2;
            board[n/2+1][i] = 1;
        }
        board[n/2][n/2] = 1;
        board[n/2+1][n/2] = 0;
    }
    
    public static int[][] map4 = {
        {1, 0, 0, 1},
        {0, 1, 1, 0},
        {0, 1, 1, 0},
        {1, 0, 0, 1},       
    };
    public static void even4(int[][] board, int n){
        int idx = 0;
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                idx++;
                if(map4[i%4][j%4] == 1){
                    board[i][j] = idx;
                }
            }
        }
        idx = 0;
        for(int i=n-1; i>=0; i--){
            for(int j=n-1; j>=0; j--){
                idx++;
                if(map4[i%4][j%4] == 0){
                    board[i][j] = idx;
                }
            }
        }
    }
    
    public static String out(int[][] res, int n){
        StringBuilder sb = new StringBuilder();
        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                sb.append(res[i][j]+" ");
            }
            sb.append("\n");
        }
        return sb.toString();
    }
    
    public static void odd(int[][] board, int n){
        board[0][n/2] = 1;
        int y = n-1;
        int x = n/2+1;
        int val = 2;
        while(board[y][x] == 0){
            board[y][x] = val;
            val++;
            y--;
            x++;
            if(y < 0) y += n;
            if(x >=n) x -= n;
            if(board[y][x] != 0){
                y++; y++;
                x--;
                if(y >= n) y -= n;
                if(x < 0) x += n;
            }
        }
    }
}
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());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0