結果

問題 No.259 セグメントフィッシング＋
ユーザー uwiuwi
提出日時 2015-08-01 15:26:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 202 ms / 2,000 ms
コード長 4,197 bytes
コンパイル時間 4,918 ms
コンパイル使用メモリ 77,356 KB
実行使用メモリ 58,548 KB
最終ジャッジ日時 2023-09-25 00:14:24
合計ジャッジ時間 8,957 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,148 KB
testcase_01 AC 43 ms
49,140 KB
testcase_02 AC 44 ms
49,156 KB
testcase_03 AC 43 ms
49,152 KB
testcase_04 AC 44 ms
48,944 KB
testcase_05 AC 44 ms
48,944 KB
testcase_06 AC 45 ms
49,012 KB
testcase_07 AC 43 ms
48,920 KB
testcase_08 AC 190 ms
58,548 KB
testcase_09 AC 191 ms
57,584 KB
testcase_10 AC 193 ms
57,472 KB
testcase_11 AC 190 ms
57,912 KB
testcase_12 AC 190 ms
58,020 KB
testcase_13 AC 199 ms
57,104 KB
testcase_14 AC 188 ms
56,744 KB
testcase_15 AC 201 ms
57,840 KB
testcase_16 AC 200 ms
56,760 KB
testcase_17 AC 199 ms
56,940 KB
testcase_18 AC 197 ms
56,936 KB
testcase_19 AC 197 ms
56,728 KB
testcase_20 AC 202 ms
56,776 KB
testcase_21 AC 200 ms
57,060 KB
testcase_22 AC 188 ms
56,852 KB
testcase_23 AC 87 ms
52,144 KB
testcase_24 AC 123 ms
53,996 KB
testcase_25 AC 123 ms
54,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q3xx;

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 Q396 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q = ni();
		long[] ft = new long[2*n+1];
		long all = 0;
		for(int i = 0;i < Q;i++){
			char type = nc();
			int t = ni(), y = ni(), z = ni();
			if(type == 'R'){
				int x = (y-t)%(2*n);
				if(x < 0)x += 2*n;
				addFenwick(ft, x, z);
				all += z;
			}else if(type == 'L'){
				int x = (2*n-1-y-t)%(2*n);
				if(x < 0)x += 2*n;
				addFenwick(ft, x, z);
				all += z;
			}else{
				long ret = 0;
				{
					int L = (y-t)%(2*n);
					int R = (z-t)%(2*n);
					if(L < 0)L += 2*n;
					if(R < 0)R += 2*n;
					ret += sumFenwick(ft, R-1);
					ret -= sumFenwick(ft, L-1);
					if(L < R){
					}else{
						ret += all;
					}
				}
				{
					int L = (2*n-1-z-t+1)%(2*n);
					int R = (2*n-1-y-t+1)%(2*n);
					if(L < 0)L += 2*n;
					if(R < 0)R += 2*n;
					ret += sumFenwick(ft, R-1);
					ret -= sumFenwick(ft, L-1);
					if(L < R){
					}else{
						ret += all;
					}
				}
				out.println(ret);
			}
		}
	}
	
	public static long sumFenwick(long[] ft, int i)
	{
		long sum = 0;
		for(i++;i > 0;i -= i&-i)sum += ft[i];
		return sum;
	}
	
	public static void addFenwick(long[] ft, int i, long v)
	{
		if(v == 0)return;
		int n = ft.length;
		for(i++;i < n;i += i&-i)ft[i] += v;
	}
	
	public static long[] restoreFenwick(long[] ft)
	{
		int n = ft.length-1;
		long[] ret = new long[n];
		for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i);
		for(int i = n-1;i >= 1;i--)ret[i] -= ret[i-1];
		return ret;
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q396().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0