結果
問題 | No.5002 stick xor |
ユーザー | uwi |
提出日時 | 2018-05-25 23:04:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 870 ms / 1,000 ms |
コード長 | 4,380 bytes |
コンパイル時間 | 34,905 ms |
実行使用メモリ | 27,380 KB |
スコア | 33,793 |
最終ジャッジ日時 | 2018-05-25 23:05:09 |
ジャッジサーバーID (参考情報) |
judge6 / |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 870 ms
26,860 KB |
testcase_01 | AC | 865 ms
26,580 KB |
testcase_02 | AC | 868 ms
26,584 KB |
testcase_03 | AC | 863 ms
26,588 KB |
testcase_04 | AC | 864 ms
26,588 KB |
testcase_05 | AC | 856 ms
26,604 KB |
testcase_06 | AC | 867 ms
26,876 KB |
testcase_07 | AC | 864 ms
26,944 KB |
testcase_08 | AC | 857 ms
25,116 KB |
testcase_09 | AC | 853 ms
27,376 KB |
testcase_10 | AC | 855 ms
27,304 KB |
testcase_11 | AC | 859 ms
26,588 KB |
testcase_12 | AC | 865 ms
26,588 KB |
testcase_13 | AC | 863 ms
27,376 KB |
testcase_14 | AC | 850 ms
26,588 KB |
testcase_15 | AC | 863 ms
27,376 KB |
testcase_16 | AC | 853 ms
27,380 KB |
testcase_17 | AC | 860 ms
27,376 KB |
testcase_18 | AC | 862 ms
26,584 KB |
testcase_19 | AC | 866 ms
26,588 KB |
testcase_20 | AC | 861 ms
27,060 KB |
testcase_21 | AC | 860 ms
27,128 KB |
testcase_22 | AC | 866 ms
26,588 KB |
testcase_23 | AC | 858 ms
26,588 KB |
testcase_24 | AC | 861 ms
26,584 KB |
testcase_25 | AC | 865 ms
27,176 KB |
testcase_26 | AC | 856 ms
26,824 KB |
testcase_27 | AC | 867 ms
27,348 KB |
testcase_28 | AC | 856 ms
27,380 KB |
testcase_29 | AC | 859 ms
25,116 KB |
testcase_30 | AC | 859 ms
26,588 KB |
testcase_31 | AC | 857 ms
26,840 KB |
ソースコード
package contest180525; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class AGreedy { InputStream is; PrintWriter out; String INPUT = ""; int[] L; long[] b, tb; int n, K; void solve() { n = ni(); K = ni(); L = na(K); char[][] map = nm(n, n); b = new long[n]; tb = new long[n]; for(int i = 0;i < n;i++){ for(int j = 0;j < n;j++){ if(map[i][j] == '1'){ b[i] |= 1L<<j; tb[j] |= 1L<<i; } } } anss = new int[K][]; greedy(); for(int[] ans : anss){ out.printf("%d %d %d %d\n", ans[0]+1, ans[1]+1, ans[2]+1, ans[3]+1); } } int[][] anss; void greedy() { int[][] li = new int[K][]; for(int i = 0;i < K;i++){ li[i] = new int[]{L[i], i}; } Arrays.sort(li, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return -(a[0] - b[0]); } }); for(int[] l : li){ int v = l[0], ind = l[1]; int minscore = 999999; int argi = -1, argj = -1; for(int i = 0;i < n;i++){ for(int j = 0;j+v <= n;j++){ for(int k = 0;k < v;k++){ b[i] ^= 1L<<j+k; } int score = score(b); for(int k = 0;k < v;k++){ b[i] ^= 1L<<j+k; } if(score < minscore){ minscore = score; argi = i; argj = j; } } } anss[ind] = new int[]{argi, argj, argi, argj+v-1}; for(int k = 0;k < v;k++){ b[argi] ^= 1L<<argj+k; } } } int score(long[] b) { int ret = 0; for(long h : b){ ret += Long.bitCount(h); } return ret; } 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"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new AGreedy().run(); } private byte[] inbuf = new byte[1024]; public 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))){ // when nextLine, (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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }