#260503 (Java21) No.5002 stick xor

提出ソース

結果

問題	No.5002 stick xor
ユーザー	ziita
提出日時	2018-05-26 10:43:34
言語	Java21 (openjdk 21)
結果	AC
実行時間	375 ms / 1,000 ms
コード長	6,608 bytes
コンパイル時間	14,028 ms
実行使用メモリ	19,220 KB
スコア	40,775
最終ジャッジ日時	2018-05-26 10:43:51
ジャッジサーバーID （参考情報）	judge7 /
	純コード判定しない問題か言語

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	316 ms 19,208 KB
testcase_01	AC	321 ms 19,212 KB
testcase_02	AC	375 ms 19,212 KB
testcase_03	AC	318 ms 19,212 KB
testcase_04	AC	318 ms 19,212 KB
testcase_05	AC	312 ms 19,212 KB
testcase_06	AC	335 ms 19,216 KB
testcase_07	AC	313 ms 19,212 KB
testcase_08	AC	313 ms 19,216 KB
testcase_09	AC	317 ms 19,208 KB
testcase_10	AC	336 ms 19,212 KB
testcase_11	AC	337 ms 19,212 KB
testcase_12	AC	324 ms 19,212 KB
testcase_13	AC	311 ms 19,220 KB
testcase_14	AC	318 ms 19,208 KB
testcase_15	AC	341 ms 19,216 KB
testcase_16	AC	303 ms 19,200 KB
testcase_17	AC	312 ms 19,212 KB
testcase_18	AC	310 ms 19,208 KB
testcase_19	AC	334 ms 19,212 KB
testcase_20	AC	326 ms 19,216 KB
testcase_21	AC	318 ms 19,216 KB
testcase_22	AC	310 ms 19,212 KB
testcase_23	AC	314 ms 19,212 KB
testcase_24	AC	339 ms 19,208 KB
testcase_25	AC	308 ms 19,212 KB
testcase_26	AC	320 ms 19,212 KB
testcase_27	AC	310 ms 19,208 KB
testcase_28	AC	333 ms 19,216 KB
testcase_29	AC	332 ms 19,220 KB
testcase_30	AC	313 ms 19,208 KB
testcase_31	AC	316 ms 19,212 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;

    int n,k;
    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);
            }
        }
        print_ans(ans);
    }

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

    void reload_map(int[][] map, int[][] ans, int[] res, int line){
        ans[line][0] = res[0]+1;
        ans[line][1] = res[1]+1;
        ans[line][2] = res[2]+1;
        ans[line][3] = res[3]+1;
        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

結果

テストケース

ソースコード