結果
| 問題 | No.1919 Many Monster Battles |
| ユーザー |
 uwi
|
| 提出日時 | 2022-04-29 22:46:34 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 23,223 bytes |
| コンパイル時間 | 4,562 ms |
| コンパイル使用メモリ | 94,144 KB |
| 実行使用メモリ | 170,072 KB |
| 最終ジャッジ日時 | 2024-06-29 04:23:19 |
| 合計ジャッジ時間 | 11,159 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 96 ms
60,148 KB |
| testcase_01 | AC | 86 ms
51,488 KB |
| testcase_02 | AC | 87 ms
51,692 KB |
| testcase_03 | AC | 162 ms
57,884 KB |
| testcase_04 | AC | 160 ms
57,664 KB |
| testcase_05 | AC | 164 ms
58,024 KB |
| testcase_06 | AC | 167 ms
57,676 KB |
| testcase_07 | AC | 162 ms
57,864 KB |
| testcase_08 | AC | 176 ms
58,052 KB |
| testcase_09 | AC | 174 ms
57,612 KB |
| testcase_10 | AC | 164 ms
57,404 KB |
| testcase_11 | AC | 162 ms
57,644 KB |
| testcase_12 | AC | 169 ms
57,716 KB |
| testcase_13 | TLE | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
ソースコード
package contest220429;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class E {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve()
{
int n = ni();
int[] a = na(n);
int[] b = na(n);
out.println(solve(a, b) + " " + solve(b, a));
}
long solve(int[] a, int[] b)
{
int n = a.length;
final int mod = 1000000007;
int[][] as = new int[n][];
for(int i = 0;i < n;i++){
as[i] = new int[]{a[i], b[i]};
}
Arrays.sort(as, (x, y) -> x[0] - y[0]);
int[][] co = new int[n][];
for(int i = 0;i < n;i++){
co[i] = new int[]{as[i][0]-as[i][1], as[i][0]+as[i][1], i, as[i][0]};
}
Arrays.sort(co, (x, y) -> {
if (x[0] != y[0]) return x[0] - y[0];
return (x[1] - y[1]);
});
int[] xs = getind(co, 0);
int[] ys = shrink(getind(co, 1));
int[] iord = new int[n];
for(int i = 0;i < n;i++)iord[co[i][2]] = i;
// tr(co);
DynamicWeightedWaveletMatrix wm = new DynamicWeightedWaveletMatrix(ys, new long[n], 20);
DynamicWeightedWaveletMatrix wm1 = new DynamicWeightedWaveletMatrix(ys, new long[n], 20);
long ans = 0;
for(int i = n-1;i >= 0;i--){
int id = iord[i];
int l = lowerBound(xs, xs[id]+1);
// tr(id, l, ys[id]+1);
long s = wm.sum(l, n, ys[id]+1, 1<<21);
long f = wm1.sum(l, n, ys[id]+1, 1<<21);
ans += s - co[id][3] * f;
wm.add(id, co[id][3]);
wm1.add(id, 1L);
ans %= mod;
}
if(ans < 0)ans += mod;
ans = ans * 2 % mod;
return ans;
}
public static int[] shrink(int[] a) {
int n = a.length;
long[] b = new long[n];
for (int i = 0; i < n; i++) b[i] = (long) a[i] << 32 | i;
Arrays.sort(b);
int[] ret = new int[n];
int p = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && (b[i] ^ b[i - 1]) >> 32 != 0) p++;
ret[(int) b[i]] = p;
}
return ret;
}
public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
public static int lowerBound(int[] a, int l, int r, int v)
{
if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
int low = l-1, high = r;
while(high-low > 1){
int h = high+low>>>1;
if(a[h] >= v){
high = h;
}else{
low = h;
}
}
return high;
}
public static int[] getind(int[][] a, int ind) { int[] b = new int[a.length]; for(int i = 0;i < a.length;i++)b[i] = a[i][ind]; return b;}
public static class SBVWithoutSelect {
public int[] bc;
public long[] a;
public int n;
public SBVWithoutSelect(boolean[] a)
{
n = a.length;
int m = (n>>>6)+1;
this.a = new long[m];
for(int i = 0;i < n;i++){
if(a[i])this.a[i>>>6] |= 1L<<i;
}
bc = new int[m+1];
for(int i = 0;i < m;i++){
bc[i+1] = bc[i] + Long.bitCount(this.a[i]);
}
}
public boolean get(int i)
{
assert i >= 0;
assert i < n;
return a[i>>>6]<<~i<0;
}
public int rank(int i, boolean b)
{
assert i >= 0;
assert i <= n;
int ret = bc[i >>> 6] + ((i & 63) == 0 ? 0 : Long.bitCount(a[i >>> 6]<<-i));
return b ? ret : i - ret;
}
@Override
public String toString() {
return "SBVWithoutSelect{" +
", bc=" + Arrays.toString(bc) +
", a=" + Arrays.toString(a) +
", n=" + n +
'}';
}
}
public static class DynamicWeightedWaveletMatrix {
public SBVWithoutSelect[] sbvs;
public int K;
public int[] borders;
public long[][] cums;
public DynamicWeightedWaveletMatrix(int[] a, long[] ws, int K)
{
this.K = K;
int n = a.length;
int[] sa = Arrays.copyOf(a, n);
sbvs = new SBVWithoutSelect[K];
borders = new int[K];
for(int d = K-1;d >= 0;d--){
boolean[] b = new boolean[n];
int[] t = new int[n];
int offset = 0;
for(int i = 0;i < n;i++){
b[i] = sa[i]<<~d<0;
if(sa[i]<<~d>=0) offset++;
}
borders[d] = offset;
int p = 0, q = offset;
for(int v : sa){
if(v<<~d<0){
t[q++] = v;
}else{
t[p++] = v;
}
}
sa = t;
sbvs[d] = new SBVWithoutSelect(b);
}
cums = new long[K][n+3];
for(int j = 0;j < n;j++)add(j, ws[j]);
}
public void add(int i, long v)
{
if(v == 0)return;
for(int d = K-1;d >= 0;d--){
boolean res = sbvs[d].get(i);
if(res){
i = borders[d] + sbvs[d].rank(i, true);
}else{
i = sbvs[d].rank(i, false);
}
addFenwick(cums[d], i, v);
}
}
/**
* T[i]を復元する
* @param i
* @return
*/
public int get(int i)
{
int ret = 0;
for(int d = K-1;d >= 0;d--){
ret *= 2;
boolean res = sbvs[d].get(i);
if(res){
ret++;
i = borders[d] + sbvs[d].rank(i, true);
}else{
i = sbvs[d].rank(i, false);
}
}
return ret;
}
/**
* T[0,i)中のcの出現回数を返す
* @param i
* @param c
* @return
*/
public int rank(int i, int c)
{
int j = 0;
for(int d = K-1;d >= 0;d--){
i = sbvs[d].rank(i, c<<~d<0) + (c<<~d<0 ? borders[d] : 0);
j = sbvs[d].rank(j, c<<~d<0) + (c<<~d<0 ? borders[d] : 0);
}
return i - j;
}
/**
* T[l,r)のk番目の小さい値を返す
* @param l
* @param r
* @param k
* @return
*/
public int kthLowest(int l, int r, int k)
{
int v = 0;
for(int d = K-1;d >= 0;d--) {
int rz = sbvs[d].rank(r, false);
int lz = sbvs[d].rank(l, false);
if (k < rz - lz) {
l = lz;
r = rz;
} else {
v |= 1<<d;
l = borders[d] + l - lz;
r = borders[d] + r - rz;
k -= rz - lz;
}
}
return v;
}
/**
* T[l,r)にある、c in [d,u)の出現個数を返す
*
* count(c<u, T[l,r)) - count(c<d, T[l,r))
* @param l
* @param r
* @param d
* @param u
* @return
*/
public int freq(int l, int r, int d, int u)
{
return freq(l, r, u) - freq(l, r, d);
}
public int freq(int l, int r, int u)
{
if(u >= 1<<K)return r - l;
int ret = 0;
for(int d = K-1;d >= 0;d--){
int zr = sbvs[d].rank(r, false);
int zl = sbvs[d].rank(l, false);
if(u<<~d<0){
ret += zr - zl;
r = borders[d] + r - zr;
l = borders[d] + l - zl;
}else{
r = zr;
l = zl;
}
}
return ret;
}
public long sum(int l, int r, int d, int u)
{
return sum(l, r, u) - sum(l, r, d);
}
public long sum(int l, int r, int u)
{
if(u >= 1<<K)return sumFenwick(cums[K-1], r-1) - sumFenwick(cums[K-1], l-1);
long ret = 0;
for(int d = K-1;d >= 0;d--){
int zr = sbvs[d].rank(r, false);
int zl = sbvs[d].rank(l, false);
// tr(d, restoreFenwick(cums[d]));
if(u<<~d<0){
ret += sumFenwick(cums[d], zr-1) - sumFenwick(cums[d], zl-1);
// ret += cums[d][zr] - cums[d][zl];
r = borders[d] + r - zr;
l = borders[d] + l - zl;
}else{
r = zr;
l = zl;
// 0 2 0 2
// 0 1 0 1
// 0 0 2 2
}
}
return ret;
}
public static long[] restoreFenwick(long[] ft)
{
int n = ft.length-1;
long[] ret = new long[n];
for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i);
for(int i = n-1;i >= 1;i--)ret[i] -= ret[i-1];
return ret;
}
/**
* T[l,r)にある値を降順に頻度とともにk個返す
* @param l
* @param r
* @param k
* @return
*/
public int[][] maxk(int l, int r, int k)
{
int[][] ret = new int[k][];
int[] f = new int[K];
int rem = r-l;
for(int i = 0;i < k;i++) {
int ll = l, rr = r;
int v = 0;
for (int d = K - 1; d >= 0; d--) {
int cha = sbvs[d].rank(rr, true) - sbvs[d].rank(ll, true);
if(i == 0 || ret[i-1][0]>>>d+1 == v>>>d+1){
cha -= f[d];
}else{
f[d] = 0;
}
if (cha > 0) {
v |= 1<<d;
ll = borders[d] + sbvs[d].rank(ll, true);
rr = borders[d] + sbvs[d].rank(rr, true);
} else {
ll = sbvs[d].rank(ll, false);
rr = sbvs[d].rank(rr, false);
}
}
ret[i] = new int[]{v, rr-ll};
for(int j = 0;j < K;j++){
if(v<<~j<0)f[j] += ret[i][1];
}
rem -= ret[i][1];
if(rem == 0)return Arrays.copyOf(ret, i+1);
}
return ret;
}
/**
* T[l,r)にある値を昇順に頻度とともにk個返す
* @param l
* @param r
* @param k
* @return
*/
public int[][] mink(int l, int r, int k)
{
int[][] ret = new int[k][];
int[] f = new int[K];
int rem = r-l;
for(int i = 0;i < k;i++) {
int ll = l, rr = r;
int v = 0;
for (int d = K - 1; d >= 0; d--) {
int cha = sbvs[d].rank(rr, false) - sbvs[d].rank(ll, false);
if(i == 0 || ret[i-1][0]>>>d+1 == v>>>d+1){
cha -= f[d];
}else{
f[d] = 0;
}
if (cha > 0) {
ll = sbvs[d].rank(ll, false);
rr = sbvs[d].rank(rr, false);
} else {
v |= 1<<d;
ll = borders[d] + sbvs[d].rank(ll, true);
rr = borders[d] + sbvs[d].rank(rr, true);
}
}
ret[i] = new int[]{v, rr-ll};
for(int j = 0;j < K;j++){
if(v<<~j>=0)f[j] += ret[i][1];
}
rem -= ret[i][1];
if(rem == 0)return Arrays.copyOf(ret, i+1);
}
return ret;
}
/**
* T[l,R)で、u以下である最大のuを返す
*
* validは、その桁を0にできてかつ以後の整数が存在する最小のd
* @param l
* @param r
* @param u
* @return
*/
public int maxv(int l, int r, int u)
{
if(l == r)return -1;
int ll = l, rr = r;
int valid = -1;
for (int d = K - 1; d >= 0; d--) {
int nl, nr;
if(u<<~d<0){
nl = borders[d] + sbvs[d].rank(ll, true);
nr = borders[d] + sbvs[d].rank(rr, true);
if(sbvs[d].rank(rr, false) - sbvs[d].rank(ll, false) > 0)valid = d;
}else{
nl = sbvs[d].rank(ll, false);
nr = sbvs[d].rank(rr, false);
}
ll = nl; rr = nr;
if(nr - nl == 0)break;
}
if(rr-ll > 0)return u;
if(valid == -1)return -1;
ll = l; rr = r;
int v = u>>>valid+1<<valid+1;
for(int d = K-1;d > valid;d--){
if(u<<~d<0){
ll = borders[d] + sbvs[d].rank(ll, true);
rr = borders[d] + sbvs[d].rank(rr, true);
}else{
ll = sbvs[d].rank(ll, false);
rr = sbvs[d].rank(rr, false);
}
}
{
ll = sbvs[valid].rank(ll, false);
rr = sbvs[valid].rank(rr, false);
}
for(int d = valid-1;d >= 0;d--){
int lo = sbvs[d].rank(ll, true);
int ro = sbvs[d].rank(rr, true);
if(ro - lo > 0){
v |= 1<<d;
ll = borders[d] + lo;
rr = borders[d] + ro;
}else{
ll = ll - lo;
rr = rr - ro;
}
}
assert rr-ll > 0;
return v;
}
/**
* T[l,R)で、u以上の最小のcを返す
* @param l
* @param r
* @param u
* @return
*/
public int minv(int l, int r, int u)
{
if(l == r)return -1;
int ll = l, rr = r;
int valid = -1;
for (int d = K - 1; d >= 0; d--) {
int nl, nr;
if(u<<~d<0){
nl = borders[d] + sbvs[d].rank(ll, true);
nr = borders[d] + sbvs[d].rank(rr, true);
}else{
nl = sbvs[d].rank(ll, false);
nr = sbvs[d].rank(rr, false);
if(sbvs[d].rank(rr, true) - sbvs[d].rank(ll, true) > 0)valid = d;
}
ll = nl; rr = nr;
if(nr - nl == 0)break;
}
if(rr-ll > 0)return u;
if(valid == -1)return -1;
ll = l; rr = r;
int v = u>>>valid+1<<valid+1;
for(int d = K-1;d > valid;d--){
if(u<<~d<0){
ll = borders[d] + sbvs[d].rank(ll, true);
rr = borders[d] + sbvs[d].rank(rr, true);
}else{
ll = sbvs[d].rank(ll, false);
rr = sbvs[d].rank(rr, false);
}
}
{
v |= 1<<valid;
ll = borders[valid] + sbvs[valid].rank(ll, true);
rr = borders[valid] + sbvs[valid].rank(rr, true);
}
for(int d = valid-1;d >= 0;d--){
int lz = sbvs[d].rank(ll, false);
int rz = sbvs[d].rank(rr, false);
if(rz - lz > 0) {
ll = lz;
rr = rz;
}else{
v |= 1<<d;
ll = borders[d] + ll - lz;
rr = borders[d] + rr - rz;
}
}
assert rr-ll > 0;
return v;
}
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 void main(String[] args) {
new E().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[] 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)); }
}