結果

問題 No.1000 Point Add and Array Add
ユーザー uwiuwi
提出日時 2020-02-28 21:28:08
言語 Java21
(openjdk 21)
結果
AC  
実行時間 473 ms / 2,000 ms
コード長 4,013 bytes
コンパイル時間 4,720 ms
コンパイル使用メモリ 81,088 KB
実行使用メモリ 50,772 KB
最終ジャッジ日時 2024-04-21 17:50:32
合計ジャッジ時間 13,326 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
37,700 KB
testcase_01 AC 71 ms
37,860 KB
testcase_02 AC 72 ms
37,768 KB
testcase_03 AC 72 ms
38,028 KB
testcase_04 AC 71 ms
38,320 KB
testcase_05 AC 72 ms
38,024 KB
testcase_06 AC 72 ms
38,044 KB
testcase_07 AC 71 ms
38,048 KB
testcase_08 AC 73 ms
38,084 KB
testcase_09 AC 74 ms
37,452 KB
testcase_10 AC 71 ms
37,656 KB
testcase_11 AC 73 ms
37,740 KB
testcase_12 AC 102 ms
37,968 KB
testcase_13 AC 78 ms
37,880 KB
testcase_14 AC 110 ms
38,124 KB
testcase_15 AC 115 ms
39,356 KB
testcase_16 AC 446 ms
50,300 KB
testcase_17 AC 372 ms
49,372 KB
testcase_18 AC 447 ms
50,720 KB
testcase_19 AC 458 ms
50,772 KB
testcase_20 AC 329 ms
47,396 KB
testcase_21 AC 427 ms
48,820 KB
testcase_22 AC 473 ms
50,516 KB
testcase_23 AC 466 ms
50,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200228;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q = ni();
		int[] a = na(n);
		int[] ft = new int[n+5];
		long[] b = new long[n];
		for(int z = 0;z < Q;z++) {
			char t = nc();
			if(t == 'A') {
				int x = ni()-1;
				int y = ni();
				int u = sumFenwick(ft, x);
				b[x] += (long)u * a[x];
				a[x] += y;
				addFenwick(ft, x, -u);
				addFenwick(ft, x+1, u);
			}else {
				int x = ni()-1, y = ni()-1;
				addFenwick(ft, x, 1);
				addFenwick(ft, y+1, -1);
			}
		}
		for(int x = 0;x < n;x++) {
			int u = sumFenwick(ft, x);
			b[x] += (long)u * a[x];
		}
		for(int i = 0;i < n;i++) {
			out.print(b[i] + " ");
		}
		out.println();
	}
	
	public static int sumFenwick(int[] ft, int i)
	{
		int sum = 0;
		for(i++;i > 0;i -= i&-i)sum += ft[i];
		return sum;
	}
	
	public static void addFenwick(int[] ft, int l, int r, int v)
	{
		addFenwick(ft, l, v);
		addFenwick(ft, r, -v);
	}
	
	public static void addFenwick(int[] ft, int i, int v)
	{
		if(v == 0 || i < 0)return;
		int n = ft.length;
		for(i++;i < n;i += i&-i)ft[i] += v;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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 ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0