結果

問題 No.151 セグメントフィッシング
ユーザー ぴろずぴろず
提出日時 2015-02-13 00:17:50
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,722 bytes
コンパイル時間 2,316 ms
コンパイル使用メモリ 79,072 KB
実行使用メモリ 60,020 KB
最終ジャッジ日時 2024-06-23 19:31:14
合計ジャッジ時間 18,776 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
49,884 KB
testcase_01 AC 52 ms
50,372 KB
testcase_02 AC 52 ms
50,004 KB
testcase_03 AC 52 ms
50,220 KB
testcase_04 AC 52 ms
49,900 KB
testcase_05 AC 54 ms
50,016 KB
testcase_06 AC 54 ms
50,032 KB
testcase_07 AC 54 ms
50,180 KB
testcase_08 AC 205 ms
53,684 KB
testcase_09 AC 270 ms
57,980 KB
testcase_10 AC 243 ms
56,524 KB
testcase_11 AC 315 ms
57,896 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no151;

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

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		int q = io.nextInt();
		ArrayList<Fish> fish = new ArrayList<>();
		for(int qq=0;qq<q;qq++) {
//			System.out.println(qq);
//			System.out.println(Arrays.toString(sum));
			char x = io.nextChar();
			int y = io.nextInt();
			int z = io.nextInt();
			if (x == 'L') {
				fish.add(new Fish(z,y,-1));
			}else if(x == 'R') {
				fish.add(new Fish(z,y,1));
			}else{
				int sum = 0;
				for(Fish f:fish) {
					if (y <= f.x && f.x < z) {
						sum += f.num;
					}
				}
				io.println(sum);
			}

			for(Fish f:fish) {
				if (f.x == 0 && f.dx == -1) {
					f.dx = 1;
				}else if(f.x == n-1 && f.dx == 1) {
					f.dx = -1;
				}else{
					f.x += f.dx;
				}
			}
		}
		io.flush();
	}

	static class Fish {
		int num;
		int x;
		int dx;
		public Fish(int num,int x,int dx) {
			this.num = num;
			this.x = x;
			this.dx = dx;
		}
	}

}

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';}
	private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
	public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	public boolean hasNextLine() { skipNewLine(); 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) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		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[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void arrayInt(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[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
	public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; 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