結果
| 問題 | No.2809 Sort Query |
| ユーザー |
 ゆうき
|
| 提出日時 | 2024-07-13 00:28:56 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,993 ms / 2,000 ms |
| コード長 | 24,935 bytes |
| コンパイル時間 | 4,325 ms |
| コンパイル使用メモリ | 101,300 KB |
| 実行使用メモリ | 173,172 KB |
| 最終ジャッジ日時 | 2024-07-13 00:30:54 |
| 合計ジャッジ時間 | 90,955 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 53 ms
37,352 KB |
| testcase_01 | AC | 1,343 ms
143,520 KB |
| testcase_02 | AC | 1,448 ms
145,812 KB |
| testcase_03 | AC | 1,479 ms
147,452 KB |
| testcase_04 | AC | 1,427 ms
145,144 KB |
| testcase_05 | AC | 1,254 ms
143,184 KB |
| testcase_06 | AC | 1,143 ms
108,036 KB |
| testcase_07 | AC | 813 ms
107,448 KB |
| testcase_08 | AC | 794 ms
107,620 KB |
| testcase_09 | AC | 913 ms
108,464 KB |
| testcase_10 | AC | 836 ms
108,460 KB |
| testcase_11 | AC | 820 ms
103,396 KB |
| testcase_12 | AC | 862 ms
103,404 KB |
| testcase_13 | AC | 828 ms
103,328 KB |
| testcase_14 | AC | 821 ms
103,372 KB |
| testcase_15 | AC | 827 ms
103,400 KB |
| testcase_16 | AC | 870 ms
104,232 KB |
| testcase_17 | AC | 804 ms
103,300 KB |
| testcase_18 | AC | 869 ms
104,916 KB |
| testcase_19 | AC | 848 ms
103,160 KB |
| testcase_20 | AC | 968 ms
105,248 KB |
| testcase_21 | AC | 1,677 ms
172,448 KB |
| testcase_22 | AC | 1,680 ms
172,516 KB |
| testcase_23 | AC | 1,746 ms
172,996 KB |
| testcase_24 | AC | 1,688 ms
172,740 KB |
| testcase_25 | AC | 1,820 ms
173,172 KB |
| testcase_26 | AC | 1,993 ms
144,592 KB |
| testcase_27 | AC | 1,540 ms
142,436 KB |
| testcase_28 | AC | 1,808 ms
143,364 KB |
| testcase_29 | AC | 1,742 ms
145,540 KB |
| testcase_30 | AC | 1,722 ms
143,928 KB |
| testcase_31 | AC | 717 ms
105,408 KB |
| testcase_32 | AC | 859 ms
105,716 KB |
| testcase_33 | AC | 731 ms
105,400 KB |
| testcase_34 | AC | 880 ms
105,880 KB |
| testcase_35 | AC | 766 ms
105,780 KB |
| testcase_36 | AC | 688 ms
104,312 KB |
| testcase_37 | AC | 714 ms
103,992 KB |
| testcase_38 | AC | 766 ms
104,932 KB |
| testcase_39 | AC | 776 ms
103,808 KB |
| testcase_40 | AC | 726 ms
103,992 KB |
| testcase_41 | AC | 1,212 ms
123,372 KB |
| testcase_42 | AC | 1,248 ms
123,060 KB |
| testcase_43 | AC | 1,221 ms
124,012 KB |
| testcase_44 | AC | 1,251 ms
123,384 KB |
| testcase_45 | AC | 1,262 ms
123,456 KB |
| testcase_46 | AC | 1,067 ms
124,052 KB |
| testcase_47 | AC | 1,178 ms
124,876 KB |
| testcase_48 | AC | 1,105 ms
124,332 KB |
| testcase_49 | AC | 1,132 ms
124,372 KB |
| testcase_50 | AC | 1,063 ms
124,916 KB |
| testcase_51 | AC | 628 ms
91,164 KB |
| testcase_52 | AC | 565 ms
91,264 KB |
| testcase_53 | AC | 585 ms
93,244 KB |
| testcase_54 | AC | 626 ms
93,376 KB |
| testcase_55 | AC | 533 ms
93,116 KB |
| testcase_56 | AC | 1,172 ms
104,360 KB |
| testcase_57 | AC | 1,113 ms
96,992 KB |
| testcase_58 | AC | 1,078 ms
97,896 KB |
| testcase_59 | AC | 1,028 ms
78,220 KB |
| testcase_60 | AC | 1,180 ms
118,792 KB |
| testcase_61 | AC | 1,327 ms
122,020 KB |
| testcase_62 | AC | 906 ms
95,904 KB |
| testcase_63 | AC | 1,488 ms
108,800 KB |
| testcase_64 | AC | 1,684 ms
126,372 KB |
| testcase_65 | AC | 1,150 ms
106,724 KB |
| testcase_66 | AC | 77 ms
37,436 KB |
| testcase_67 | AC | 56 ms
37,152 KB |
| testcase_68 | AC | 53 ms
37,404 KB |
| testcase_69 | AC | 54 ms
37,712 KB |
| testcase_70 | AC | 56 ms
37,320 KB |
ソースコード
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
public final class Main{
public static void main(String[] args) throws Exception{
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out,false),log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log).solve()).ifPresent(out::println);
out.flush();
}
}
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int Q = in.it();
long[] A = in.lg(N);
AVLTree avl = new AVLTree();
Map<Integer, Data> list = new HashMap<>();
for (int i = 0;i < N;i++) {
avl.add(-1);
list.put(i,new Data(A[i],-1));
}
while (Q-- > 0) {
int t = in.it();
if (t == 1) {
int k = in.idx();
long x = in.lg();
var pre = avl.get(k);
list.put(k,new Data(x,pre));
}
if (t == 2) {
for (var v:list.values()) {
avl.del(v.p);
avl.add(v.v);
}
list = new HashMap<>();
}
if (t == 3) {
int k = in.idx();
out.println(list.containsKey(k) ? list.get(k).v : avl.get(k));
}
}
return null;
}
private long floorSum(long n,long m,long a,long b){
if (a < 0) {
b += (n -1) *a;
a *= -1;
}
long ret = 0;
if (a >= m) {
ret += a /m *n *(n -1) >>1;
a %= m;
}
if (b >= m) {
ret += b /m *n;
b %= m;
}
long last = a *n +b;
if (last >= m)
ret += floorSum(last /m,a,m,last %m);
return ret;
}
}
class Data extends BaseV{
long v,p;
public Data(long v,long p){
this.v = v;
this.p = p;
}
}
class AVLTree{
private Node root;
public AVLTree(){}
public void add(long v){ add(v,1); }
public void add(long v,int k){ root = root == null ? new Node(v,k) : add(root,v,k); }
private Node add(Node nd,long v,int k){
if (nd.lft == null) {
int c = Long.compare(nd.val,v);
if (c == 0) {
nd.sz += k;
return nd;
} else {
var ret = new Node(0,0);
ret.cld(-c,new Node(v,k));
ret.cld(c,nd);
nd = ret;
}
} else {
int c = Long.compare(v,nd.rht.l);
nd.lft = c < 0 ? add(nd.lft,v,k) : nd.lft;
nd.rht = c < 0 ? nd.rht : add(nd.rht,v,k);
}
return balance(nd);
}
public void del(long v){ del(v,1); }
public void del(long v,int k){ root = del(root,v,k); }
private Node del(Node nd,long v,int k){
if (nd.lft == null) {
int c = Long.compare(nd.val,v);
if (c == 0)
nd.sz -= k;
return c != 0 || 0 < nd.sz ? nd : null;
}
int c = Long.compare(v,nd.rht.l) *2 +1;
Node del = del(c < 0 ? nd.lft : nd.rht,v,k);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public long get(int i){ return get(root,i); }
private long get(Node nd,int i){
return nd.lft == null ? nd.val : i < nd.lft.sz ? get(nd.lft,i) : get(nd.rht,i -nd.lft.sz);
}
public int size(){ return root == null ? 0 : root.sz; }
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).update(); }
private Node rotate(Node u){
var v = u.cld(u.bis);
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.update();
return v;
}
private class Node{
private int sz,bis,rnk;
private long val,l;
private Node lft,rht;
private Node(long val,int sz){
this.sz = sz;
this.val = l = val;
}
private Node update(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
l = lft.l;
sz = lft.sz +rht.sz;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
}
}
abstract class DigitDp<T> {
private int B;
private int[] N;
private T[] dp;
public DigitDp(char[] N){ this(N,10); }
public DigitDp(char[] N,int B){
this.N = new int[N.length];
for (int i = 0;i < N.length;i++)
this.N[i] = N[i] -'0';
dp = Util.cast(Array.newInstance(init().getClass(),N.length +1 <<1));
this.B = B;
setAll(dp,i -> init());
}
protected abstract T init();
protected abstract void f(T pd,T dp,int n,int k);
protected void mod(T dp){}
public T get(int i,int same){ return dp[i *2 +same]; }
public void calc(){
for (int i = 0;i < N.length;i++) {
int t = N[i];
for (int n = 0;n < B;n++) {
if (n == t)
f(get(i +1,1),get(i,1),n,N.length -1 -i);
if (n < t)
f(get(i +1,0),get(i,1),n,N.length -1 -i);
if (0 < i)
f(get(i +1,0),get(i,0),n,N.length -1 -i);
}
mod(get(i +1,0));
mod(get(i +1,1));
}
}
}
abstract class Dijkstra<E, L> extends Graph<E>{
private Comparator<L> cmp;
private L[] len;
private int[] hep,idx;
private Edge<E>[] pre;
private int sz;
public Dijkstra(int n,boolean dir){
super(n,dir);
hep = new int[n];
idx = new int[n];
cmp = cmp();
}
protected abstract L zero();
protected abstract L inf();
protected abstract L f(L l,Edge<E> e);
protected Comparator<L> cmp(){ return Util.cast(Comparator.naturalOrder()); }
public L[] calc(int s){ return calc(s,-1); }
public L[] calc(int s,int g){
len = Util.cast(Array.newInstance(zero().getClass(),sz = n));
pre = Util.cast(new Edge[n]);
fill(len,inf());
setAll(hep,i -> i);
setAll(idx,i -> i);
set(s,zero());
for (int cur;0 < sz && (cur = poll()) != g;)
for (var e:go(cur))
set((pre[e.v] = e).v,f(len[cur],e));
return len;
}
public L get(int t){ return len[t]; }
public Deque<Edge<E>> path(int t){
Deque<Edge<E>> ret = new ArrayDeque<>();
while (pre[t] != null) {
ret.addFirst(pre[t]);
t = pre[t].u;
}
return ret;
}
private void set(int i,L l){
if (idx[i] < sz && cmp.compare(l,len[i]) < 0) {
len[i] = l;
heapfy(idx[i]);
}
}
private int poll(){
int ret = hep[0];
heapfy(swap(0,--sz));
return ret;
}
private void heapfy(int k){
int p = k -1 >>1;
if (0 <= p && cmp.compare(len[hep[p]],len[hep[k]]) > 0) {
heapfy(swap(p,k));
return;
}
int c = k <<1 |1;
if (sz <= c)
return;
if (c +1 < sz && cmp.compare(len[hep[c]],len[hep[c +1]]) > 0)
c++;
if (cmp.compare(len[hep[c]],len[hep[k]]) < 0)
heapfy(swap(c,k));
}
private int swap(int i,int j){
hep[i] ^= hep[j];
hep[j] ^= hep[i];
hep[i] ^= hep[j];
idx[hep[i]] = i;
idx[hep[j]] = j;
return i;
}
}
abstract class SegmentTree<V extends BaseV, F> extends Seg<V, F>{
public SegmentTree(int n){ super(n); }
@Override
protected F comp(F f,F g){ return null; }
@Override
public void upd(int i,F f){
super.upd(i,f);
up(i,i +1);
}
}
class DualBIT{
private int n;
private long[] val;
public DualBIT(int n){
this.n = n +1;
val = new long[n +2];
}
public long agg(long a,long b){ return a +b; }
public long inv(long v){ return -v; }
public long get(int i){ return sum(i +1); }
public void upd(int l,int r,long v){
upd(l,v);
upd(r,inv(v));
}
private void upd(int x,long v){
for (x++;x <= n;x += x &-x)
val[x] = agg(val[x],v);
}
private long sum(int x){
long ret = 0;
for (;x > 0;x -= x &-x)
ret = agg(ret,val[x]);
return ret;
}
}
abstract class Seg<V extends BaseV, F> {
private int n,log;
private V[] val;
private F[] lazy;
protected Seg(int n){
this.n = n;
while (1 <<log <= n)
log++;
val = Util.cast(new BaseV[n <<1]);
lazy = Util.cast(new Object[n]);
for (int i = -1;++i < n;)
(val[i +n] = init(i)).sz = 1;
for (int i = n;--i > 0;merge(i))
(val[i] = e()).sz = val[i <<1].sz +val[i <<1 |1].sz;
}
public void upd(int i,F f){ prop(i +n,f); }
public void upd(int l,int r,F f){
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
prop(l++,f);
if ((r &1) == 1)
prop(--r,f);
}
}
public V get(int i){ return val[i +n]; }
public V get(int l,int r){
V[] ret = Util.cast(new BaseV[]{e(), e()});
int i = 0;
for (var v:getList(l,r)) {
agg(ret[i],ret[i ^1],v);
ret[i].sz = ret[i ^= 1].sz +v.sz;
}
return ret[i ^1];
}
public V[] getList(int l,int r){
int sz = 0;
for (int li = l += n,ri = r += n;li < ri;li = li +1 >>1,ri >>= 1)
sz += (li &1) +(ri &1);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (int i = 0;l < r;l >>= 1,r >>= 1) {
if ((l &1) > 0)
arr[i++] = val[l++];
if ((r &1) > 0)
arr[--sz] = val[--r];
}
return arr;
}
public V[] getPath(int i){
int sz = 32 -Integer.numberOfLeadingZeros(i +n);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (i += n;0 < i;i >>= 1)
arr[--sz] = val[i];
return arr;
}
protected V init(int i){ return e(); }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
protected void up(int l,int r){
for (l = oddPart(l +n),r = oddPart(r +n);l != r;)
merge(l > r ? (l >>= 1) : (r >>= 1));
while (1 < l)
merge(l >>= 1);
}
protected void down(int l,int r){
int i = log;
for (l = oddPart(l +n),r = oddPart(r +n);i > 0;i--) {
push(l >>i);
push(r >>i);
}
}
private void merge(int i){ agg(val[i],val[i <<1],val[i <<1 |1]); }
private void push(int i){
if (lazy[i] != null) {
prop(i <<1,lazy[i]);
prop(i <<1 |1,lazy[i]);
lazy[i] = null;
}
}
private void prop(int i,F f){
map(val[i],f);
if (i < n) {
lazy[i] = lazy[i] == null ? f : comp(lazy[i],f);
if (val[i].fail) {
push(i);
merge(i);
}
}
}
private int oddPart(int i){ return i /(i &-i); }
}
abstract class DualSegmentTree<V extends BaseV, F> extends Seg<V, F>{
public DualSegmentTree(int n){ super(n); }
@Override
protected void agg(V v,V a,V b){}
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
}
@Override
public V get(int i){
down(i,i +1);
return super.get(i);
}
}
abstract class LazySegmentTree<V extends BaseV, F> extends Seg<V, F>{
public LazySegmentTree(int n){ super(n); }
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
up(l,r);
}
@Override
public V get(int i){
down(i,i +1);
return super.get(i);
}
@Override
public V get(int l,int r){
down(l,r);
return super.get(l,r);
}
}
abstract class ReRootingDp<L, D, A> extends Graph<L>{
private D[] dp;
private A[] ans;
public ReRootingDp(int N){
super(N,false);
dp = Util.cast(new Object[2 *N]);
ans = Util.cast(Array.newInstance(ans(0,e()).getClass(),n));
}
protected abstract D e();
protected abstract D agg(D a,D b);
protected abstract D adj(D v,Edge<L> e);
protected abstract A ans(int u,D sum);
protected MyList<D> sur(int u){ return go(u).map(e -> dp[e.id]); }
public A[] calc(){
for (var e:es)
e.re.id += n;
var stk = new MyStack<Edge<L>>();
var se = new Edge<L>(n -1,-1,0,null);
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
if (dp[e.id] == null) {
dp[e.id] = e();
for (var ee:go(e.v))
if (ee != e.re) {
stk.add(ee);
stk.add(ee);
}
} else {
for (var ee:go(e.v))
if (ee != e.re)
dp[e.id] = agg(dp[e.id],dp[ee.id]);
if (e.u > -1)
dp[e.id] = adj(dp[e.id],e);
}
}
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
var es = go(e.v);
int n = es.size();
D[] pre = Util.cast(new Object[n +1]),suf = Util.cast(new Object[n +1]);
pre[0] = e();
suf[n] = e();
for (int i = 0;i < n;i++) {
pre[i +1] = agg(pre[i],dp[es.get(i).id]);
suf[n -1 -i] = agg(dp[es.get(n -1 -i).id],suf[n -i]);
}
ans[e.v] = ans(e.v,suf[0]);
for (int i = 0;i < n;i++) {
Edge<L> ee = es.get(i);
if (ee != e.re) {
dp[ee.re.id] = adj(agg(pre[i],suf[i +1]),ee.re);
stk.add(ee);
}
}
}
return ans;
}
public void clear(){
dp[n -1] = null;
for (var e:es) {
dp[e.id] = dp[e.re.id] = null;
go(e.u).clear();
go(e.v).clear();
}
es.clear();
}
}
class HLD extends Graph<Object>{
private int[] p,hp,l,r;
public int[] dpt;
public HLD(int n){
super(n,false);
p = new int[n];
hp = new int[n];
l = new int[n];
r = new int[n];
}
public MyList<int[]> auxiliary(MyList<Integer> lis){
lis = new MyList<>(lis);
lis.add(0);
MyList<int[]> ret = new MyList<>();
lis.sort(Comparator.comparing(i -> l[i]));
for (int i = lis.size() -1;i > 0;i--)
lis.add(lca(lis.get(i -1),lis.get(i)));
lis.sort(Comparator.comparing(i -> l[i]));
MyStack<Integer> stk = new MyStack<>();
stk.add(lis.get(0));
for (var y:lis) {
while (r[stk.peek()] <= l[y])
stk.pop();
if (!stk.peek().equals(y))
ret.add(new int[]{stk.peek(), y});
stk.add(y);
}
return ret;
}
public MyList<int[]> getPath(int u,int v,int incLca){
MyList<int[]> ret = new MyList<>();
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u]) {
ret.add(new int[]{l[u] +1 -incLca, l[v] +1});
return ret;
}
ret.add(new int[]{l[h], l[v] +1});
v = p[h];
}
}
public int lca(int u,int v){
while (true) {
if (l[u] > l[v]) {
var t = u;
u = v;
v = t;
}
var h = hp[v];
if (l[h] <= l[u])
return u;
v = p[h];
}
}
public void makeTree(int s){
MyStack<Integer> stk = new MyStack<>();
fill(hp,-1);
p[s] = s;
stk.add(s);
stk.add(s);
while (!stk.isEmpty()) {
var u = stk.pop();
if (r[u] < 1) {
r[u] = 1;
for (var e:go(u)) {
if (e.v == p[u])
continue;
es.set(e.id,e);
p[e.v] = u;
stk.add(e.v);
stk.add(e.v);
}
} else if (u != s)
r[p[u]] += r[u];
}
for (int u = 0;u < n;u++) {
var go = go(u);
for (int i = 1;i < go.size();i++)
if (r[u] < r[go.get(0).v] || r[go.get(0).v] < r[go.get(i).v] && r[go.get(i).v] < r[u])
go.swap(0,i);
}
stk.add(s);
for (int hid = 0;!stk.isEmpty();) {
var u = stk.pop();
r[u] += l[u] = hid++;
if (hp[u] < 0)
hp[u] = u;
var go = go(u);
for (int i = go.size();i-- > 0;) {
var v = go.get(i).v;
if (v == p[u])
continue;
if (i == 0)
hp[v] = hp[u];
stk.add(v);
}
}
}
}
class Edge<L> {
public int id,u,v;
public L val;
public Edge<L> re;
public Edge(int id,int u,int v,L val){
this.id = id;
this.u = u;
this.v = v;
this.val = val;
}
}
class Graph<L> {
public int n;
public MyList<Edge<L>> es;
private MyList<Edge<L>>[] go,bk;
public Graph(int n,boolean dir){
this.n = n;
go = Util.cast(new MyList[n]);
bk = dir ? Util.cast(new MyList[n]) : go;
for (int i = 0;i < n;i++) {
go[i] = new MyList<>();
bk[i] = new MyList<>();
}
es = new MyList<>();
}
protected L inv(L l){ return l; }
public void addEdge(int u,int v){ addEdge(u,v,null); }
public void addEdge(int u,int v,L l){
var e = new Edge<>(es.size(),u,v,l);
var re = new Edge<>(e.id,e.v,e.u,inv(e.val));
es.add(e);
go[u].add(re.re = e);
bk[v].add(e.re = re);
}
public MyList<Edge<L>> go(int u){ return go[u]; }
public MyList<Edge<L>> bk(int u){ return bk[u]; }
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[max(16,n)]); }
public MyList(MyList<T> org){
this(org.sz);
System.arraycopy(org.arr,0,arr,0,sz = org.sz);
}
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){
if (sz == 0)
return Util.cast(new Object[0]);
T[] ret = Util.cast(Array.newInstance(arr[0].getClass(),sz));
for (int i = 0;i < sz;i++)
ret[i] = arr[i];
return ret;
}
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
public void clear(){ sz = 0; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
protected long inv(long x){ return pow(x,mod -2); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
public long lcm(long a,long b){ return b /gcd(a,b) *a; }
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<61 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
public String[][] str(int H,int W){ return Util.arr(new String[H][],i -> str(W)); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}