結果

問題 No.259 セグメントフィッシング＋
ユーザー ぴろずぴろず
提出日時 2016-01-07 13:52:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 203 ms / 2,000 ms
コード長 5,706 bytes
コンパイル時間 2,319 ms
コンパイル使用メモリ 78,304 KB
実行使用メモリ 46,640 KB
最終ジャッジ日時 2024-09-19 12:59:50
合計ジャッジ時間 7,483 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,792 KB
testcase_01 AC 48 ms
36,956 KB
testcase_02 AC 46 ms
37,012 KB
testcase_03 AC 45 ms
36,632 KB
testcase_04 AC 46 ms
36,980 KB
testcase_05 AC 47 ms
36,888 KB
testcase_06 AC 49 ms
36,880 KB
testcase_07 AC 45 ms
36,840 KB
testcase_08 AC 193 ms
46,640 KB
testcase_09 AC 182 ms
46,484 KB
testcase_10 AC 181 ms
46,632 KB
testcase_11 AC 188 ms
46,608 KB
testcase_12 AC 180 ms
46,396 KB
testcase_13 AC 195 ms
46,392 KB
testcase_14 AC 189 ms
46,380 KB
testcase_15 AC 188 ms
46,520 KB
testcase_16 AC 183 ms
46,516 KB
testcase_17 AC 201 ms
46,380 KB
testcase_18 AC 181 ms
46,488 KB
testcase_19 AC 196 ms
46,628 KB
testcase_20 AC 203 ms
46,512 KB
testcase_21 AC 203 ms
46,532 KB
testcase_22 AC 203 ms
46,376 KB
testcase_23 AC 111 ms
39,004 KB
testcase_24 AC 137 ms
42,540 KB
testcase_25 AC 148 ms
42,408 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no259;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

//0 | 0 1 2 2 1 0
//1 | 1 2 2 1 0 0
//2 | 2 2 1 0 0 1
public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int q = io.nextInt();
		int n2 = n * 2;
		BIT bit = new BIT(n2);
		for(int qq=0;qq<q;qq++) {
//			System.out.println("----");
			char x = io.nextChar();
			int t = io.nextInt();
			int y = io.nextInt();
			int z = io.nextInt();
			if (x == 'L') {
				bit.accumulate(mod(-1 - y - t, n2), z);
			}else if(x == 'R') {
				bit.accumulate(mod(y - t, n2), z);
			}else{
				long sum = 0;
				sum += bit.circularSum(mod(y-t,n2), mod(z-t,n2));
				sum += bit.circularSum(mod(-z-t,n2), mod(-y-t,n2));
				io.println(sum);
			}
//			long[] data = new long[n];
//			for(int i=0;i<n;i++) {
//				data[i] += bit.get(mod(-1 - i - t,n2));
//				data[i] += bit.get(mod(i-t,n2));
//			}
//			System.out.println("t = " + t);
//			System.out.println(Arrays.toString(data));
//			System.out.println(bit);
		}
		io.flush();
	}
	
	public static int mod(int x,int mod) {
		int r = x % mod;
		if (r < 0) {
			r += mod;
		}
		return r;
	}

}
/* 0-indexed */
class BIT {
	private int n;
	private long[] bit;
	public BIT(int n) {
		this.n = n;
		bit = new long[n+1];
	}

	public void accumulate(int index,long num) {
		index++;
		while(index<=n) {
			bit[index] += num;
			index+=index&-index;
		}
	}

	/* [begin , end) */
	public long sum(int begin,int end) {
		return sum(end) - sum(begin);
	}
	
	public long circularSum(int begin,int end) {
//		System.out.println(begin + "," + end);
		if (begin < end) {
			return sum(begin,end);
		}else{
			return sum(begin,n) + sum(0,end);
		}
	}

	private long sum(int i) {
		long s = 0;
		while(i>0) {
			s+=bit[i];
			i-=i&-i;
		}
		return s;
	}

	public long get(int index) {
		return sum(index,index+1);
	}

	public void set(int index,long num) {
		accumulate(index,num-get(index));
	}

	public String toString() {
		long[] value = new long[n];
		for(int i=0;i<n;i++) {
			value[i] = get(i);
		}
		return Arrays.toString(value);
	}
}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	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 long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); 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 void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0