結果
問題 | No.151 セグメントフィッシング |
ユーザー | ぴろず |
提出日時 | 2015-02-13 00:18:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,467 ms / 5,000 ms |
コード長 | 4,723 bytes |
コンパイル時間 | 2,363 ms |
コンパイル使用メモリ | 78,964 KB |
実行使用メモリ | 61,908 KB |
最終ジャッジ日時 | 2024-06-23 19:33:45 |
合計ジャッジ時間 | 19,094 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,316 KB |
testcase_01 | AC | 53 ms
50,300 KB |
testcase_02 | AC | 53 ms
50,000 KB |
testcase_03 | AC | 54 ms
50,368 KB |
testcase_04 | AC | 54 ms
50,316 KB |
testcase_05 | AC | 56 ms
50,212 KB |
testcase_06 | AC | 55 ms
50,372 KB |
testcase_07 | AC | 55 ms
50,172 KB |
testcase_08 | AC | 243 ms
56,428 KB |
testcase_09 | AC | 205 ms
53,820 KB |
testcase_10 | AC | 206 ms
53,872 KB |
testcase_11 | AC | 208 ms
53,760 KB |
testcase_12 | AC | 1,304 ms
57,288 KB |
testcase_13 | AC | 1,320 ms
55,192 KB |
testcase_14 | AC | 1,339 ms
57,332 KB |
testcase_15 | AC | 1,467 ms
57,516 KB |
testcase_16 | AC | 1,282 ms
58,292 KB |
testcase_17 | AC | 1,018 ms
52,544 KB |
testcase_18 | AC | 1,056 ms
52,420 KB |
testcase_19 | AC | 826 ms
61,908 KB |
testcase_20 | AC | 644 ms
57,700 KB |
testcase_21 | AC | 1,259 ms
52,808 KB |
testcase_22 | AC | 1,204 ms
56,948 KB |
testcase_23 | AC | 1,216 ms
57,420 KB |
ソースコード
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{ long 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) {} } }