#945529 (Java21) No.2611 Count 01

提出ソース
結果

問題	No.2611 Count 01
ユーザー	uwi
提出日時	2024-01-20 18:27:36
言語	Java21 (openjdk 21)
結果	AC
実行時間	704 ms / 6,000 ms
コード長	15,873 bytes
コンパイル時間	5,613 ms
コンパイル使用メモリ	93,836 KB
実行使用メモリ	113,852 KB
最終ジャッジ日時	2024-01-20 18:27:58
合計ジャッジ時間	21,869 ms
ジャッジサーバーID （参考情報）	judge14 / judge15
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	90 ms 55,032 KB
testcase_01	AC	92 ms 54,996 KB
testcase_02	AC	106 ms 54,888 KB
testcase_03	AC	673 ms 113,804 KB
testcase_04	AC	698 ms 113,852 KB
testcase_05	AC	650 ms 113,832 KB
testcase_06	AC	692 ms 113,796 KB
testcase_07	AC	662 ms 113,812 KB
testcase_08	AC	677 ms 113,824 KB
testcase_09	AC	704 ms 113,828 KB
testcase_10	AC	663 ms 113,828 KB
testcase_11	AC	684 ms 113,820 KB
testcase_12	AC	657 ms 113,836 KB
testcase_13	AC	684 ms 113,836 KB
testcase_14	AC	662 ms 113,824 KB
testcase_15	AC	666 ms 113,816 KB
testcase_16	AC	695 ms 113,848 KB
testcase_17	AC	666 ms 113,804 KB
testcase_18	AC	679 ms 113,816 KB
testcase_19	AC	669 ms 113,848 KB
testcase_20	AC	688 ms 113,824 KB
testcase_21	AC	664 ms 113,804 KB
testcase_22	AC	671 ms 113,836 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
package no2xxx;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.Consumer;
import java.util.function.IntFunction;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class No2611 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		// (a_i,b_i) ... (c_j,d_j)
		// sum_{i,j} (a_i+c_j)(b_i+d_j)
		// sum_{i,j} (a_i*b_i + a_i*d_j + b_i*c_j + c_j*d_j)
		// sum_{i,j} (a+c_j)(b+d_j)
		// sum_{i,j} (ab+b*c_j+a*d_j+c_j*d_j)

		// prefix, suffix sum a_i*b_i
		// prefix, suffix sum a_i
		// prefix, suffix sum b_i
		int n = ni(), Q = ni();
		final char[] s = ns(n);
		char[] ss = Arrays.copyOf(s, n);
		SegmentTreeNode st = new SegmentTreeNode(
			n, i -> {
				Node node = new Node();
				node.len = 1;
				if(s[i] == '0'){
					node.pa = node.sa = node.a = 1;
				}else{
					node.pb = node.sb = node.b = 1;
				}
				return node;
			},
			(L, R, C) -> {
				C.len = L.len + R.len;
				C.a = L.a + R.a;
				C.b = L.b + R.b;
				C.pa = (L.pa + R.pa + R.len * L.a) % mod;
				C.pb = (L.pb + R.pb + R.len * L.b) % mod;
				C.sa = (L.sa + R.sa + L.len * R.a) % mod;
				C.sb = (L.sb + R.sb + L.len * R.b) % mod;

				C.pab = (L.pab + R.pab + L.a * R.pb + L.b * R.pa + L.a * L.b % mod * R.len) % mod;
				C.sab = (L.sab + R.sab + R.a * L.sb + R.b * L.sa + R.a * R.b % mod * L.len) % mod;
				C.sum = (L.sum + R.sum + L.sab * R.len + R.pab * L.len + L.sa * R.pb + L.sb * R.pa) % mod;
			}
		);

		for(int i = 0;i < Q;i++){
			int t = ni();
			if(t == 1){
				int x = ni()-1;
				ss[x] = ss[x] == '0' ? '1' : '0';
				st.update1(x, node -> {
					if(ss[x] == '1') {
						node.pb = node.sb = node.b = 1;
						node.pa = node.sa = node.a = 0;
					}else {
						node.pa = node.sa = node.a = 1;
						node.pb = node.sb = node.b = 0;
					}
				});
			}else {
				int l = ni() - 1, r = ni();
				Node res = st.sum(l, r);
				out.println(res.sum);
			}
		}
	}

	static final int mod = 998244353;

	private static class Node
	{
		public long len;
		public long pab, sab;
		public long pa, sa;
		public long pb, sb;
		public long a, b;
		public long sum;

		public Node()
		{
		}
		// 110 + 1

		public String toString()
		{
			return String.format("(%d,%d,%d,%d,%d,%d,%d,%d,%d,%d)", pab, sab, pa, sa, pb, sb, a, b, sum, len);
		}
	}

	public static class SegmentTreeNode {
		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 SegmentTreeNode(int n, IntFunction<Node> nodeSupplier, Propagator<Node> prop2)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			this.prop2 = prop2;

			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)
		{
			if(2*cur >= M)return;
			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{
				return L != null ? L : R;
			}
		}

		public void update1(int x, Consumer<Node> operate) {
			operate.accept(nodes[H+x]);
			for(int i = H+x>>>1;i >= 1;i>>>=1)propagate(i);
		}

		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]);
				propagate(cur);
			}else{
				int mid = cl+cr>>>1;
				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;
				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 No2611().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)); }
}
yukicoder

結果

テストケース

ソースコード
