結果
| 問題 | No.2762 Counting and Deleting |
| ユーザー |
 uwi
|
| 提出日時 | 2024-05-18 05:32:10 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,947 ms / 4,000 ms |
| コード長 | 20,749 bytes |
| コンパイル時間 | 7,750 ms |
| コンパイル使用メモリ | 94,816 KB |
| 実行使用メモリ | 87,280 KB |
| 最終ジャッジ日時 | 2024-05-18 05:32:34 |
| 合計ジャッジ時間 | 23,468 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 109 ms
51,308 KB |
| testcase_01 | AC | 97 ms
51,252 KB |
| testcase_02 | AC | 99 ms
51,536 KB |
| testcase_03 | AC | 108 ms
51,512 KB |
| testcase_04 | AC | 102 ms
51,760 KB |
| testcase_05 | AC | 98 ms
51,448 KB |
| testcase_06 | AC | 100 ms
51,620 KB |
| testcase_07 | AC | 915 ms
76,112 KB |
| testcase_08 | AC | 979 ms
76,292 KB |
| testcase_09 | AC | 956 ms
74,832 KB |
| testcase_10 | AC | 943 ms
75,168 KB |
| testcase_11 | AC | 1,691 ms
86,644 KB |
| testcase_12 | AC | 1,723 ms
87,280 KB |
| testcase_13 | AC | 1,947 ms
86,704 KB |
| testcase_14 | AC | 1,771 ms
86,712 KB |
| testcase_15 | AC | 1,445 ms
76,040 KB |
| testcase_16 | AC | 1,499 ms
75,956 KB |
ソースコード
package contest240517;
import java.io.*;
import java.util.*;
import java.util.function.*;
public class F3 {
InputStream is;
FastWriter out;
String INPUT = "";
//
public void solve()
{
int n = ni(), Q = ni();
char[] s = ns(n);
LST lst = new LST(n);
for(int i = 0;i < n;i++){
if(s[i] == '0')lst.set(i);
}
LazySegmentTreeNode st = new LazySegmentTreeNode(n, i -> {
Node ret = new Node();
ret.m = ms[s[i]-'0'];
return ret;
},
(l, r, p) -> {
if(p.del){
p.m = ms[2];
}else {
p.m = mul(l.m, r.m);
}
},
(l, p) -> {
p.m = l.m;
},
(p, c) -> {
c.del |= p.del;
if(c.del){
c.m = ms[2];
}
},
(p) -> {
}
);
for(int z = 0;z < Q;z++){
int t = ni();
int l = ni()-1, r = ni();
if(t == 1){
s[l] = '_';
st.update(l, r, i -> {
i.m = ms[2];
i.del = true;
});
while(true){
int ne = lst.next(l);
if(ne == -1 || ne >= r)break;
lst.unset(ne);
}
}else{
int[] v = new int[]{mod-1, mod-1, 0};
Node res = st.sum(l, r);
v = mul(res.m, v);
int first = lst.next(l);
long u = 0;
if(first != -1 && first < r){
Node res2 = st.sum(first+1, r);
if(res2 != null) {
int[] w = new int[]{mod - 1, mod - 1, 0};
w = mul(res2.m, w);
u = (w[2] + 1) % mod;
}else{
u = 1;
}
}
out.println((v[2]+ mod - u) % mod);
}
}
}
public static class LST {
public long[][] set;
public int n;
// public int size;
public LST(int n) {
this.n = n;
int d = 1;
for(int m = n;m > 1;m>>>=6, d++);
set = new long[d][];
for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
set[i] = new long[m+1];
}
// size = 0;
}
// [0,r)
public LST setRange(int r)
{
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r>>>6;j++){
set[i][j] = -1L;
}
if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
}
return this;
}
// [0,r)
public LST unsetRange(int r)
{
if(r >= 0){
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r+63>>>6;j++){
set[i][j] = 0;
}
if((r&63) != 0)set[i][r>>>6] &= -(1L << r);
}
}
return this;
}
public LST set(int pos)
{
if(pos >= 0 && pos < n){
// if(!get(pos))size++;
for(int i = 0;i < set.length;i++, pos>>>=6){
set[i][pos>>>6] |= 1L<<pos;
}
}
return this;
}
public LST unset(int pos)
{
if(pos >= 0 && pos < n){
// if(get(pos))size--;
for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
set[i][pos>>>6] &= ~(1L<<pos);
}
}
return this;
}
public boolean get(int pos)
{
return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
}
public LST toggle(int pos)
{
return get(pos) ? unset(pos) : set(pos);
}
public int prev(int pos)
{
for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
int pre = prev(set[i][pos>>>6], pos&63);
if(pre != -1){
pos = pos>>>6<<6|pre;
while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
public int next(int pos)
{
for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
int nex = next(set[i][pos>>>6], pos&63);
if(nex != -1){
pos = pos>>>6<<6|nex;
while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
private static int prev(long set, int n)
{
long h = set<<~n;
if(h == 0L)return -1;
return -Long.numberOfLeadingZeros(h)+n;
}
private static int next(long set, int n)
{
long h = set>>>n;
if(h == 0L)return -1;
return Long.numberOfTrailingZeros(h)+n;
}
@Override
public String toString()
{
List<Integer> list = new ArrayList<>();
for(int pos = next(0);pos != -1;pos = next(pos+1)){
list.add(pos);
}
return list.toString();
}
}
static final int mod = 998244353;
public static final long m2 = (long)mod*mod;
public static final long BIG = 8L*m2;
// A^e*v
public static int[] pow(int[][] A, int[] v, long e)
{
for(int i = 0;i < v.length;i++){
if(v[i] >= mod)v[i] %= mod;
}
int[][] MUL = A;
for(;e > 0;e>>>=1) {
if((e&1)==1)v = mul(MUL, v);
MUL = p2(MUL);
}
return v;
}
// int matrix*int vector
public static int[] mul(int[][] A, int[] v)
{
int m = A.length;
int n = v.length;
int[] w = new int[m];
for(int i = 0;i < m;i++){
long sum = 0;
for(int k = 0;k < n;k++){
sum += (long)A[i][k] * v[k];
if(sum >= BIG)sum -= BIG;
}
w[i] = (int)(sum % mod);
}
return w;
}
// int matrix^2 (be careful about negative value)
public static int[][] p2(int[][] A)
{
int n = A.length;
int[][] C = new int[n][n];
for(int i = 0;i < n;i++){
long[] sum = new long[n];
for(int k = 0;k < n;k++){
for(int j = 0;j < n;j++){
sum[j] += (long)A[i][k] * A[k][j];
if(sum[j] >= BIG)sum[j] -= BIG;
}
}
for(int j = 0;j < n;j++){
C[i][j] = (int)(sum[j] % mod);
}
}
return C;
}
//////////// end
// ret[n]=A^(2^n)
public static int[][][] generateP2(int[][] A, int n)
{
int[][][] ret = new int[n+1][][];
ret[0] = A;
for(int i = 1;i <= n;i++)ret[i] = p2(ret[i-1]);
return ret;
}
// A[0]^e*v
// A[n]=A[0]^(2^n)
public static int[] pow(int[][][] A, int[] v, long e)
{
for(int i = 0;e > 0;e>>>=1,i++) {
if((e&1)==1)v = mul(A[i], v);
}
return v;
}
public static int[][] mul(int[][]... a)
{
int[][] base = a[0];
for(int i = 1;i < a.length;i++){
base = mul(base, a[i]);
}
return base;
}
// メモ累乗計算セット ここまで
// A^e
// O(N^3log N)
public static int[][] pow(int[][] A, long e)
{
int[][] MUL = A;
int n = A.length;
int[][] C = new int[n][n];
for(int i = 0;i < n;i++)C[i][i] = 1;
for(;e > 0;e>>>=1) {
if((e&1)==1)C = mul(C, MUL);
MUL = p2(MUL);
}
return C;
}
public static int[][] mul(int[][] A, int[][] B)
{
assert A[0].length == B.length;
int m = A.length;
int n = A[0].length;
int o = B[0].length;
int[][] C = new int[m][o];
for(int i = 0;i < m;i++){
long[] sum = new long[o];
for(int k = 0;k < n;k++){
for(int j = 0;j < o;j++){
sum[j] += (long)A[i][k] * B[k][j];
if(sum[j] >= BIG)sum[j] -= BIG;
}
}
for(int j = 0;j < o;j++){
C[i][j] = (int)(sum[j] % mod);
}
}
return C;
}
// -1 -1 0
//
public static int[][][] ms = {
{
{0, 0, 1},
{0, 1, 0},
{mod-1, 0, 2}
},
{
{1, 0, 0},
{0, 0, 1},
{0, mod-1, 2}
},
{
{1, 0, 0},
{0, 1, 0},
{0, 0, 1}
},
};
public static class Node
{
int[][] m;
boolean del;
public Node() {
}
}
public static class LazySegmentTreeNode {
public int M, H, N;
public Node[] nodes;
@FunctionalInterface
public interface Propagator<T> {
void accept(T c0, T c1, T p);
}
public Propagator<Node> prop2;
public BiConsumer<Node, Node> prop1;
public BiConsumer<Node, Node> push;
public Consumer<Node> pushReset;
public LazySegmentTreeNode(int n, IntFunction<Node> nodeSupplier, Propagator<Node> prop2, BiConsumer<Node, Node> prop1, BiConsumer<Node, Node> push, Consumer<Node> pushReset)
{
N = n;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
this.prop2 = prop2;
this.prop1 = prop1;
this.push = push;
this.pushReset = pushReset;
nodes = new Node[M];
for(int i = 0;i < N;i++){
nodes[H+i] = nodeSupplier.apply(i);
}
for(int i = H-1;i >= 1;i--)propagate(i);
}
private void propagate(int cur)
{
nodes[cur] = prop2(nodes[2*cur], nodes[2*cur+1], nodes[cur]);
}
private Node prop2(Node L, Node R, Node C)
{
if(L != null && R != null){
if(C == null)C = new Node();
prop2.accept(L, R, C);
return C;
}else if(L != null) {
if(C == null)C = new Node();
prop1.accept(L, C);
return C;
}else if(R != null){
if (C == null) C = new Node();
prop1.accept(R, C);
return C;
}else{
return null;
}
}
void push(int cur)
{
if(2*cur < M && nodes[2*cur] != null)push.accept(nodes[cur], nodes[2*cur]);
if(2*cur+1 < M && nodes[2*cur+1] != null)push.accept(nodes[cur], nodes[2*cur+1]);
pushReset.accept(nodes[cur]);
}
public void update(int l, int r, Consumer<Node> operate) { if(l < r)update(l, r, 0, H, 1, operate); }
protected void update(int l, int r, int cl, int cr, int cur, Consumer<Node> operate)
{
if(l <= cl && cr <= r){
operate.accept(nodes[cur]);
}else{
int mid = cl+cr>>>1;
push(cur);
if(cl < r && l < mid){
update(l, r, cl, mid, 2*cur, operate);
}
if(mid < r && l < cr){
update(l, r, mid, cr, 2*cur+1, operate);
}
propagate(cur);
}
}
public Node sum(int l, int r) {
return sum(l, r, 0, H, 1);
}
protected Node sum(int l, int r, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
return nodes[cur];
}else{
Node L = null, R = null;
push(cur);
int mid = cl+cr>>>1;
if(cl < r && l < mid){
L = sum(l, r, cl, mid, 2*cur);
}
if(mid < r && l < cr){
R = sum(l, r, mid, cr, 2*cur+1);
}
return prop2(L, R, null);
}
}
@Override
public String toString()
{
return dfsToString(1, "");
}
private String dfsToString(int cur, String indent)
{
if(cur >= M || nodes[cur] == null)return "";
return dfsToString(2*cur, indent + " ")
+ indent + nodes[cur].toString() + "\n"
+ dfsToString(2*cur+1, indent + " ");
}
}
public static void main(String[] args) {
new F3().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)); }
}