結果

問題 No.2861 Slime Party
ユーザー uwi
提出日時 2024-08-29 11:12:07
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 22,994 bytes
コンパイル時間 14,126 ms
コンパイル使用メモリ 97,068 KB
実行使用メモリ 142,980 KB
最終ジャッジ日時 2024-08-29 11:13:05
合計ジャッジ時間 44,418 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 21 TLE * 1 -- * 54
権限があれば一括ダウンロードができます

ソースコード

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

package contest240825;
import java.io.*;
import java.lang.annotation.Annotation;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.BiConsumer;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class H2 {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve() {
//
// k
// min(a_l,a_r) > sum(x((l,r)))+L sum(x((l,r)))+L
// ACartesian Tree
// [a,b][a,c], [c,b][a,b][a,c],[c,b]
//
// apredefinedsum(x((l,r)))+L-min(a_l,a_r)
// x[i]i
//
// -
// - 0
int n = ni(), Q = ni();
long L = nl();
long[] a = nal(n);
int[] x = na(n);
long[] ai = new long[2*n-1];
for(int i = 0;i < n;i++){
ai[2*i] = a[i];
}
int[] par = buildCartesianTree(ai);
int root = -1;
for(int i = 0;i < 2*n-1;i++){
if(par[i] == -1)root = i;
}
int[][] g = parentToG(par);
int[][] pars = parents(g, root);
int[] ord = pars[1], dep = pars[2];
int[] ls = new int[2*n-1];
int[] rs = new int[2*n-1];
for(int i = 2*n-2;i >= 0;i--){
int cur = ord[i];
ls[cur] = cur;
rs[cur] = cur;
for(int e : g[cur]){
if(par[cur] == e)continue;
ls[cur] = Math.min(ls[cur], ls[e]);
rs[cur] = Math.max(rs[cur], rs[e]);
}
}
// 3,3
// 3,5
// 0,5
// 0,8
long[] xcum = buildcum(x);
long[] vals = new long[2*n-1];
for(int i = 0;i < 2*n-1;i++){
vals[i] = xcum[rs[i]/2+1] - xcum[(ls[i]+1)/2] + L;
long lmin = Math.min(
ls[i] == 0 ? Long.MAX_VALUE / 10 : a[(ls[i]-1)/2],
rs[i] == 2*n-2 ? Long.MAX_VALUE / 10 : a[(rs[i]+1)/2]
);
vals[i] -= lmin;
}
// tr(vals);
HeavyLightDecomposition hld = new HeavyLightDecomposition(g, par, ord, dep);
StarrySkyTreeL[] sts = new StarrySkyTreeL[hld.m];
for(int i = 0;i < hld.m;i++){
long[] la = new long[hld.cluspath[i].length];
for(int j = 0;j < hld.cluspath[i].length;j++){
la[j] = vals[hld.cluspath[i][j]];
}
sts[i] = new StarrySkyTreeL(la);
}
// [[5, 20, 5, 30, 0, 30, -922337203685477480, 10, -5]]
long[] ft = new long[2*n+5];
for(int i = 0;i < n;i++){
addFenwick(ft, 2*i, x[i]);
}
for(;Q > 0;Q--){
int t = ni();
if(t == 1){
int qa = ni()-1;
int b = ni();
int cha = b - x[qa]; x[qa] = b;
addFenwick(ft, 2*qa, cha);
hld.query(2*qa, root, (cx, l, r) -> {
sts[cx].add(l, r+1, cha);
});
}else{
int c = ni()-1;
int[] res = {-1};
hld.query(2*c+1, root, (cx, l, r) -> {
if(res[0] != -1)return;
int ind = sts[cx].lastle(r, 0);
if(ind != -1 && ind >= l){
res[0] = hld.cluspath[cx][ind];
}
});
if(res[0] == -1)res[0] = root;
out.println(sumFenwick(ft, rs[res[0]]) - sumFenwick(ft, ls[res[0]]-1) + L);
}
}
}
public static long sumFenwick(long[] ft, int i)
{
long sum = 0;
for(i++;i > 0;i -= i&-i)sum += ft[i];
return sum;
}
public static void addFenwick(long[] ft, int i, long v)
{
if(v == 0)return;
int n = ft.length;
for(i++;i < n;i += i&-i)ft[i] += v;
}
public static class StarrySkyTreeL {
public final int M, H, N, LH;
public long[] mins;
public long[] plus;
public static final long I = Long.MAX_VALUE/4; // I+plus<long
public StarrySkyTreeL(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(n-1, 1))<<2;
H = M>>>1;
LH = Integer.numberOfTrailingZeros(H);
mins = new long[M];
plus = new long[H];
}
public StarrySkyTreeL(long[] a)
{
this(a.length);
for(int i = 0;i < N;i++){
mins[H+i] = a[i];
}
Arrays.fill(mins, H+N, M, I);
for(int i = H-1;i >= 1;i--)propagate(i);
}
private void push1(int cur)
{
if(plus[cur] == 0)return;
int L = cur*2, R = L + 1;
mins[L] += plus[cur];
mins[R] += plus[cur];
if(L < H){
plus[L] += plus[cur];
plus[R] += plus[cur];
}
plus[cur] = 0;
}
private void propagate(int i)
{
mins[i] = Math.min(mins[2*i], mins[2*i+1]) + plus[i];
}
private void add1(int cur, long v)
{
mins[cur] += v;
if(cur < H){
plus[cur] += v;
}
}
private void push(int l, int r)
{
for(int i = LH;i >= 1;i--) {
if (l >>> i << i != l) push1(l >>> i);
if (r >>> i << i != r) push1(r >>> i);
}
}
public void add(int l, int r, long v)
{
if(l >= r)return;
l += H; r += H;
push(l, r);
for(int ll = l, rr = r;ll < rr;ll>>>=1,rr>>>=1){
if((ll&1) == 1) add1(ll++, v);
if((rr&1) == 1) add1(--rr, v);
}
for(int i = 1;i <= LH;i++){
if(l>>>i<<i != l)propagate(l>>>i);
if(r>>>i<<i != r)propagate(r>>>i);
}
}
public long min(int l, int r){
long min = I;
if(l >= r)return min;
l += H; r += H;
push(l, r);
for(;l < r;l>>>=1,r>>>=1){
if((l&1) == 1)min = Math.min(min, mins[l++]);
if((r&1) == 1)min = Math.min(min, mins[--r]);
}
return min;
}
public int firstle(int l, long v) {
if(l >= H)return -1;
int cur = H+l;
for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){
push1(i);
i = i*2|cur>>>j&1;
}
while(true){
push1(cur);
if(mins[cur] <= v){
if(cur >= H)return cur-H;
cur = 2*cur;
}else{
cur++;
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
}
}
}
private void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
public int lastle(int l, long v) {
if(l < 0)return -1;
int cur = H+l;
for(int i = LH;i >= 1;i--)push1(cur>>>i);
while(true){
if(cur < H)push1(cur);
if(mins[cur] <= v){
if(cur >= H)return cur-H;
cur = 2*cur+1;
}else{
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
cur--;
}
}
}
public long[] toArray() { return toArray(1, 0, H, new long[H]); }
private long[] toArray(int cur, int l, int r, long[] ret)
{
if(r-l == 1){
ret[cur-H] = mins[cur];
}else{
toArray(2*cur, l, l+r>>>1, ret);
toArray(2*cur+1, l+r>>>1, r, ret);
for(int i = l;i < r;i++)ret[i] += plus[cur];
}
return ret;
}
}
public static class HeavyLightDecomposition {
public int[][] g;
public int[] clus;
public int[][] cluspath;
public int[] clusiind;
public int[] par, dep;
public int m;
public HeavyLightDecomposition(int[][] g, int[] par, int[] ord, int[] dep)
{
init(g, par, ord, dep);
}
public void init(int[][] g, int[] par, int[] ord, int[] dep)
{
clus = decomposeToHeavyLight(g, par, ord);
cluspath = clusPaths(clus, ord);
clusiind = clusIInd(cluspath, g.length);
this.m = cluspath.length;
this.par = par;
this.dep = dep;
this.g = g;
}
public static int[] decomposeToHeavyLight(int[][] g, int[] par, int[] ord)
{
int n = g.length;
int[] size = new int[n];
Arrays.fill(size, 1);
for(int i = n-1;i > 0;i--)size[par[ord[i]]] += size[ord[i]];
int[] clus = new int[n];
Arrays.fill(clus, -1);
int p = 0;
for(int i = 0;i < n;i++){
int u = ord[i];
if(clus[u] == -1)clus[u] = p++;
// centroid path (not heavy path)
int argmax = -1;
for(int v : g[u]){
if(par[u] != v && (argmax == -1 || size[v] > size[argmax]))argmax = v;
}
if(argmax != -1)clus[argmax] = clus[u];
}
return clus;
}
public static int[][] clusPaths(int[] clus, int[] ord)
{
int n = clus.length;
int[] rp = new int[n];
int sup = 0;
for(int c : clus){
rp[c]++;
sup = Math.max(sup, c);
}
sup++;
int[][] row = new int[sup][];
for(int i = 0;i < sup;i++)row[i] = new int[rp[i]];
for(int i = n-1;i >= 0;i--){
row[clus[ord[i]]][--rp[clus[ord[i]]]] = ord[i];
}
return row;
}
public static int[] clusIInd(int[][] clusPath, int n)
{
int[] iind = new int[n];
for(int[] path : clusPath){
for(int i = 0;i < path.length;i++){
iind[path[i]] = i;
}
}
return iind;
}
public int lca(int x, int y)
{
int rx = cluspath[clus[x]][0];
int ry = cluspath[clus[y]][0];
while(clus[x] != clus[y]){
if(dep[rx] > dep[ry]){
x = par[rx];
rx = cluspath[clus[x]][0];
}else{
y = par[ry];
ry = cluspath[clus[y]][0];
}
}
return clusiind[x] > clusiind[y] ? y : x;
}
public int ancestor(int x, int v)
{
while(x != -1){
if(v <= clusiind[x])return cluspath[clus[x]][clusiind[x]-v];
v -= clusiind[x]+1;
x = par[cluspath[clus[x]][0]];
}
return x;
}
// [iord[x], right[x])
public int[][] makeRights()
{
int root = -1;
int n = g.length;
for(int i = 0;i < n;i++)if(par[i] == -1)root = i;
int[] ord = new int[n];
int[] right = new int[n];
int[] curs = new int[n];
int[] inds = new int[n];
int sp = 0, p = 0;
curs[sp++] = root;
while(sp > 0){
int cur = curs[sp-1];
int ind = inds[sp-1];
inds[sp-1]++;
if(ind == 0){
ord[p++] = cur;
for(int e : g[cur]){
if(par[cur] == e)continue;
if(clus[cur] == clus[e]){
curs[sp] = e;
inds[sp] = 0;
sp++;
break;
}
}
}else if(ind-1 < g[cur].length){
int e = g[cur][ind-1];
if(e == par[cur])continue;
if(clus[cur] == clus[e])continue;
curs[sp] = e;
inds[sp] = 0;
sp++;
}else{
right[cur] = p;
sp--;
}
}
int[] iord = new int[n];
for(int i = 0;i < n;i++)iord[ord[i]] = i;
return new int[][]{ord, iord, right};
}
///// templates
@FunctionalInterface
public interface IntTriConsumer {
void accept(int cx, int l, int r);
}
public void query(int u, int anc, IntTriConsumer f)
{
for(int x = u;;){
int cx = clus[x];
int l = cx == clus[anc] ? clusiind[anc] : 0;
int r = clusiind[x];
f.accept(cx, l, r);
if(cx == clus[anc])break;
x = par[cluspath[cx][0]];
}
}
}
public static long[] buildcum(int[] a) {
long[] b = new long[a.length+1];
for(int i = 0;i < a.length;i++)b[i+1] = b[i] + a[i];
return b;
}
public static int[][] parents(int[][] g, int root) {
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
int[] depth = new int[n];
depth[0] = 0;
int[] q = new int[n];
q[0] = root;
for (int p = 0, r = 1; p < r; p++) {
int cur = q[p];
for (int nex : g[cur]) {
if (par[cur] != nex) {
q[r++] = nex;
par[nex] = cur;
depth[nex] = depth[cur] + 1;
}
}
}
return new int[][]{par, q, depth};
}
public static int[][] parentToG(int[] par)
{
int n = par.length;
int[] ct = new int[n];
for(int i = 0;i < n;i++){
if(par[i] >= 0){
ct[i]++;
ct[par[i]]++;
}
}
int[][] g = new int[n][];
for(int i = 0;i < n;i++){
g[i] = new int[ct[i]];
}
for(int i = 0;i < n;i++){
if(par[i] >= 0){
g[par[i]][--ct[par[i]]] = i;
g[i][--ct[i]] = par[i];
}
}
return g;
}
public static int[] buildCartesianTree(long[] a)
{
int n = a.length;
int[] par = new int[n];
for(int i = 0;i < n;i++){
int cur = i-1;
int pre = -1;
while(cur != -1 && !(a[cur] >= a[i])){
pre = cur;
cur = par[cur];
}
if(pre != -1)par[pre] = i;
par[i] = cur;
}
return par;
}
public static void main(String[] args) {
new H2().run();
}
public void run()
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new FastWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-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();
}
private boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
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[][] 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[] 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 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();
}
}
public static class FastWriter
{
private static final int BUF_SIZE = 1<<13;
private final byte[] buf = new byte[BUF_SIZE];
private final OutputStream out;
private int ptr = 0;
private FastWriter(){out = null;}
public FastWriter(OutputStream os)
{
this.out = os;
}
public FastWriter(String path)
{
try {
this.out = new FileOutputStream(path);
} catch (FileNotFoundException e) {
throw new RuntimeException("FastWriter");
}
}
public FastWriter write(byte b)
{
buf[ptr++] = b;
if(ptr == BUF_SIZE)innerflush();
return this;
}
public FastWriter write(char c)
{
return write((byte)c);
}
public FastWriter write(char[] s)
{
for(char c : s){
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
}
return this;
}
public FastWriter write(String s)
{
s.chars().forEach(c -> {
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
});
return this;
}
private static int countDigits(int l) {
if (l >= 1000000000) return 10;
if (l >= 100000000) return 9;
if (l >= 10000000) return 8;
if (l >= 1000000) return 7;
if (l >= 100000) return 6;
if (l >= 10000) return 5;
if (l >= 1000) return 4;
if (l >= 100) return 3;
if (l >= 10) return 2;
return 1;
}
public FastWriter write(int x)
{
if(x == Integer.MIN_VALUE){
return write((long)x);
}
if(ptr + 12 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
private static int countDigits(long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
public FastWriter write(long x)
{
if(x == Long.MIN_VALUE){
return write("" + x);
}
if(ptr + 21 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
public FastWriter write(double x, int precision)
{
if(x < 0){
write('-');
x = -x;
}
x += Math.pow(10, -precision)/2;
// if(x < 0){ x = 0; }
write((long)x).write(".");
x -= (long)x;
for(int i = 0;i < precision;i++){
x *= 10;
write((char)('0'+(int)x));
x -= (int)x;
}
return this;
}
public FastWriter writeln(char c){ return write(c).writeln(); }
public FastWriter writeln(int x){ return write(x).writeln(); }
public FastWriter writeln(long x){ return write(x).writeln(); }
public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }
public FastWriter write(int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(IntUnaryOperator f, int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(f.applyAsInt(x));
}
return this;
}
public FastWriter write(LongUnaryOperator f, long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(f.applyAsLong(x));
}
return this;
}
public FastWriter writeln()
{
return write((byte)'\n');
}
public FastWriter writeln(int... xs) { return write(xs).writeln(); }
public FastWriter writeln(long... xs) { return write(xs).writeln(); }
public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
public FastWriter writeln(char[] line) { return write(line).writeln(); }
public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
public FastWriter writeln(String s) { return write(s).writeln(); }
private void innerflush()
{
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (IOException e) {
throw new RuntimeException("innerflush");
}
}
public void flush()
{
innerflush();
try {
out.flush();
} catch (IOException e) {
throw new RuntimeException("flush");
}
}
public FastWriter print(byte b) { return write(b); }
public FastWriter print(char c) { return write(c); }
public FastWriter print(char[] s) { return write(s); }
public FastWriter print(String s) { return write(s); }
public FastWriter print(int x) { return write(x); }
public FastWriter print(long x) { return write(x); }
public FastWriter print(double x, int precision) { return write(x, precision); }
public FastWriter println(char c){ return writeln(c); }
public FastWriter println(int x){ return writeln(x); }
public FastWriter println(long x){ return writeln(x); }
public FastWriter println(double x, int precision){ return writeln(x, precision); }
public FastWriter print(int... xs) { return write(xs); }
public FastWriter print(long... xs) { return write(xs); }
public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
public FastWriter println(int... xs) { return writeln(xs); }
public FastWriter println(long... xs) { return writeln(xs); }
public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
public FastWriter println(char[] line) { return writeln(line); }
public FastWriter println(char[]... map) { return writeln(map); }
public FastWriter println(String s) { return writeln(s); }
public FastWriter println() { return writeln(); }
}
public static void trnz(int... o)
{
for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
System.out.println();
}
// print ids which are 1
public static void trt(long... o)
{
Queue<Integer> stands = new ArrayDeque<>();
for(int i = 0;i < o.length;i++){
for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
}
System.out.println(stands);
}
public static void tf(boolean... r)
{
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
public static void tf(boolean[]... b)
{
for(boolean[] r : b) {
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
System.out.println();
}
public void tf(long[]... b)
{
if(INPUT.length() != 0) {
for (long[] r : b) {
for (long x : r) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
System.out.println();
}
}
public void tf(long... b)
{
if(INPUT.length() != 0) {
for (long x : b) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
}
private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0