#260517 (Java21) No.5002 stick xor

提出ソース

結果

問題	No.5002 stick xor
ユーザー	ziita
提出日時	2018-05-26 11:38:43
言語	Java21 (openjdk 21)
結果	AC
実行時間	965 ms / 1,000 ms
コード長	9,983 bytes
コンパイル時間	37,898 ms
実行使用メモリ	19,848 KB
スコア	41,355
最終ジャッジ日時	2018-05-26 11:39:23
ジャッジサーバーID （参考情報）	judge10 /
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	965 ms 19,820 KB
testcase_01	AC	936 ms 19,820 KB
testcase_02	AC	951 ms 19,840 KB
testcase_03	AC	935 ms 19,816 KB
testcase_04	AC	935 ms 19,820 KB
testcase_05	AC	934 ms 19,820 KB
testcase_06	AC	935 ms 19,840 KB
testcase_07	AC	933 ms 19,840 KB
testcase_08	AC	936 ms 19,844 KB
testcase_09	AC	934 ms 19,820 KB
testcase_10	AC	935 ms 19,820 KB
testcase_11	AC	943 ms 19,820 KB
testcase_12	AC	933 ms 19,808 KB
testcase_13	AC	934 ms 19,820 KB
testcase_14	AC	937 ms 19,820 KB
testcase_15	AC	935 ms 19,820 KB
testcase_16	AC	935 ms 19,808 KB
testcase_17	AC	939 ms 19,816 KB
testcase_18	AC	934 ms 19,844 KB
testcase_19	AC	941 ms 19,824 KB
testcase_20	AC	938 ms 19,816 KB
testcase_21	AC	939 ms 19,776 KB
testcase_22	AC	937 ms 19,848 KB
testcase_23	AC	935 ms 19,808 KB
testcase_24	AC	934 ms 19,840 KB
testcase_25	AC	937 ms 19,816 KB
testcase_26	AC	948 ms 19,820 KB
testcase_27	AC	941 ms 19,820 KB
testcase_28	AC	947 ms 19,820 KB
testcase_29	AC	943 ms 19,808 KB
testcase_30	AC	952 ms 19,820 KB
testcase_31	AC	942 ms 19,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long mod = 1_000_000_007;
    long inf = Long.MAX_VALUE;
    long start = System.currentTimeMillis();
    int n,k;
    int count = 0;
    int change = 0;
    void solve(){
        n = ni();
        k = ni();
        int[] L = new int[k];
        for(int i = 0; i < k; i++){
            L[i] = ni();
        }
        int[][] map = new int[n][n];
        for(int i = 0; i < n; i++){
            char[] c = ns().toCharArray();
            for(int j = 0; j < n; j++){
                map[i][j] = c[j]-'0';
            }
        }
        int[][] ans = new int[k][4];
        for(int line = 0; line < k; line++){
            int[] res = find_greedy(map, L[line]);
            if(res[0]>=0){
                reload_map(map, ans, res, line);
            }
        }
        anealing(map, ans);
        System.err.println(count+" "+change);
        print_ans(ans);

    }

    void anealing(int[][] map, int[][] ans){
        Random rnd = new Random();
        double startTemp   =   0.05;
        double endTemp     =   0.0001;
        double anealing_start = System.currentTimeMillis();
        double end_time = 850-(anealing_start-start);
        while(System.currentTimeMillis()-start<=850){
            count++;
            int id = rnd.nextInt(k);
            int dir = rnd.nextInt(2);
            int line_length = ans[id][2]-ans[id][0]+ans[id][3]-ans[id][1]+1;
            int beforescore = 0;
            if(ans[id][0]==ans[id][2]){
                for(int j = ans[id][1]; j <= ans[id][3]; j++){
                    if(map[ans[id][0]][j]==0) beforescore++;
                    else beforescore--;
                    map[ans[id][0]][j] = 1-map[ans[id][0]][j];
                }
            }
            else{
               for(int j = ans[id][0]; j <= ans[id][2]; j++){
                    if(map[j][ans[id][1]]==0) beforescore++;
                    else beforescore--;
                    map[j][ans[id][1]] = 1-map[j][ans[id][1]];
                } 
            }
            if(dir==0){
                int x = rnd.nextInt(n);
                int ys = rnd.nextInt(n-line_length);
                int score = 0;
                for(int j = ys; j < ys+line_length; j++){
                    if(map[x][j]==1) score++;
                    else score--;
                }
                double dif = score-beforescore;
                double temp        = startTemp + (endTemp - startTemp) * (System.currentTimeMillis()-anealing_start)/end_time;
                double probability = Math.exp((dif)/temp);
                boolean FORCE_NEXT  = probability > rnd.nextDouble();
                if(FORCE_NEXT){
                    change++;
                    ans[id][0] = x;
                    ans[id][1] = ys;
                    ans[id][2] = x;
                    ans[id][3] = ys+line_length-1;
                }
            }
            if(dir==1){
                int xs = rnd.nextInt(n-line_length);
                int y = rnd.nextInt(n);
                int score = 0;
                for(int j = xs; j < xs+line_length; j++){
                    if(map[j][y]==1) score++;
                    else score--;
                }
                double dif = score-beforescore;
                double temp        = startTemp + (endTemp - startTemp) * (System.currentTimeMillis()-anealing_start)/end_time;
                double probability = Math.exp((dif)/temp);
                boolean FORCE_NEXT  = probability > rnd.nextDouble();
                if(FORCE_NEXT){
                    change++;
                    ans[id][0] = xs;
                    ans[id][1] = y;
                    ans[id][2] = xs+line_length-1;
                    ans[id][3] = y;
                }
            }
            if(ans[id][0]==ans[id][2]){
                for(int j = ans[id][1]; j <= ans[id][3]; j++){
                    map[ans[id][0]][j] = 1-map[ans[id][0]][j];
                }
            }
            else{
               for(int j = ans[id][0]; j <= ans[id][2]; j++){
                    map[j][ans[id][1]] = 1-map[j][ans[id][1]];
                } 
            }
        }
    }

    void print_ans(int[][] ans){
        for(int i = 0; i < k; i++){
            for(int j = 0; j < 4; j++){
                out.print((ans[i][j]+1)+" ");
            }
            out.println();
        }
        out.println();
    }

    void reload_map(int[][] map, int[][] ans, int[] res, int line){
        ans[line][0] = res[0];
        ans[line][1] = res[1];
        ans[line][2] = res[2];
        ans[line][3] = res[3];
        if(res[0]==res[2]){
            for(int j = res[1]; j <= res[3]; j++){
                map[res[0]][j] = 1 - map[res[0]][j];
            }
        }
        else{
            for(int j = res[0]; j <= res[2]; j++){
                map[j][res[1]] = 1 - map[j][res[1]];
            }
        }
    }

    int[] find_lublack(int[][] map, int line_length){
        int[] res = new int[4];
        Arrays.fill(res, -1);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                if(map[i][j]==1 && n-j>=line_length){
                    res[0] = i;
                    res[1] = j;
                    res[2] = i;
                    res[3] = j+line_length-1;
                    return res;
                }
            }
        }
        return res;
    }

    int[] find_greedy(int[][] map, int line_length){
        int score = -100;
        int[] res = new int[4];
        Arrays.fill(res, -1);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                int tmpscore = 0;
                boolean flag = true;
                for(int k = 0; k < line_length; k++){
                    if(j+k>=n){
                        flag = false;
                        break;
                    }
                    if(map[i][j+k]==1) tmpscore++;
                    else tmpscore--;
                }
                if(flag && tmpscore>score){
                    score = tmpscore;
                    res[0] = i;
                    res[1] = j;
                    res[2] = i;
                    res[3] = j+line_length-1;
                }
                tmpscore = 0;
                flag = true;
                for(int k = 0; k < line_length; k++){
                    if(i+k>=n){
                        flag = false;
                        break;
                    }
                    if(map[i+k][j]==1) tmpscore++;
                    else tmpscore--;
                }
                if(flag && tmpscore>score){
                    score = tmpscore;
                    res[0] = i;
                    res[1] = j;
                    res[2] = i+line_length-1;
                    res[3] = j;
                }
            }
        }
        return res;
    }



    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}

yukicoder

結果

テストケース

ソースコード