結果

問題 No.5002 stick xor
ユーザー uwiuwi
提出日時 2018-05-25 23:04:32
言語 Java
(openjdk 23)
結果
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 /
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

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

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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0