結果

問題 No.1441 MErGe
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-07-28 22:02:15
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,586 bytes
コンパイル時間 3,848 ms
コンパイル使用メモリ 80,244 KB
実行使用メモリ 69,104 KB
最終ジャッジ日時 2024-09-13 18:48:07
合計ジャッジ時間 23,611 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
38,680 KB
testcase_01 AC 48 ms
38,792 KB
testcase_02 AC 51 ms
38,692 KB
testcase_03 AC 115 ms
42,196 KB
testcase_04 AC 117 ms
41,564 KB
testcase_05 AC 152 ms
42,376 KB
testcase_06 AC 163 ms
42,256 KB
testcase_07 AC 163 ms
42,632 KB
testcase_08 AC 351 ms
48,276 KB
testcase_09 AC 362 ms
48,148 KB
testcase_10 AC 455 ms
51,084 KB
testcase_11 AC 437 ms
50,724 KB
testcase_12 AC 468 ms
52,244 KB
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 AC 962 ms
65,676 KB
testcase_18 AC 727 ms
61,140 KB
testcase_19 AC 812 ms
66,380 KB
testcase_20 AC 690 ms
58,700 KB
testcase_21 AC 621 ms
56,536 KB
testcase_22 AC 761 ms
59,016 KB
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 AC 673 ms
67,348 KB
testcase_29 AC 620 ms
64,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;


public class Main {
	static final long MOD=1000000007;
	static final long MOD1=998244353;
	static int ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		long[] A = new long[N+1];
		for (int i = 1; i < A.length; i++) {
			A[i] = A[i-1] + sc.nextLong();
 		}
		BIT bit = new BIT(N+1);
		TreeSet<Integer> treeSet = new TreeSet<>();
		for (int i = 1; i < A.length; i++) {
			bit.add(i, 1);
			treeSet.add(i);
		}
		for (int i = 0; i < Q; i++) {
			int T = sc.nextInt();
			int l = sc.nextInt();
			int r = sc.nextInt();
			if (T==1) {
				int l1 = get(l, bit, N);
				int r1 = get(r, bit, N);
				for (int j = l; j < r; j++) {
					int x = treeSet.ceiling(l1);
					if(x>=r1)throw new ArrayIndexOutOfBoundsException();
					treeSet.remove(x);
					bit.add(x, -1);
				}
			}else {
				int l1 = 0;
				if (l>1) {
					l1 = get(l-1, bit, N);
				}
				int r1 = get(r, bit, N);
				out.println(A[r1]-A[l1]);
			}
		}
		out.flush();
  	}
	static int get(int l,BIT bit,int N){
		int from=0;
		int to=N;
		while ((to-from)>=1) {
			int mid=(to-from)/2+from;
			if (bit.sum(mid)>=l){
				to=mid;
			}
			else {
				from=mid+1;
			}
		}
		return to;
	}
	static class BIT{
		int size;
		int[] bit;
		public BIT(int n) {
			size=n;
			bit=new int[size];
		}
		public int sum(int i){
			int s=0;
			while (i>0) {
				s+=bit[i];
				i-=(i&(-i));//iの二進表現での一番右の１を消す
			}
			return s;
		}
		public void add(int i,int x) {
			while (i<size) {
				bit[i]+=x;
				i+= (i&(-i));//iの二進表現での一番右の１（区間の大きさ）を足すと次に足す区間へ
			}
		}
	}
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
		public double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			return a;
		}
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0