結果
問題 | No.833 かっこいい電車 |
ユーザー |
|
提出日時 | 2019-05-25 08:35:41 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 470 ms / 2,000 ms |
コード長 | 5,132 bytes |
コンパイル時間 | 4,928 ms |
コンパイル使用メモリ | 80,228 KB |
実行使用メモリ | 66,096 KB |
最終ジャッジ日時 | 2024-07-02 03:52:45 |
合計ジャッジ時間 | 15,113 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
import java.io.*;import java.util.*;public class Main_yukicoder833 {private static Scanner sc;private static Printer pr;private static void solve() {int n = sc.nextInt();int q = sc.nextInt();int[] a = new int[n];RSQ rsq = new RSQ(n);NavigableSet<Integer> ts = new TreeSet<>();ts.add(-1);for (int i = 0; i < n; i++) {a[i] = sc.nextInt();rsq.add(i, a[i]);ts.add(i);}for (int i = 0; i < q; i++) {int query = sc.nextInt();int x = sc.nextInt() - 1;switch (query) {case 1:ts.remove(x);break;case 2:ts.add(x);break;case 3:rsq.add(x, 1);break;case 4:int l = ts.lower(x) + 1;int r = ts.ceiling(x);pr.println(rsq.query(l, r + 1));break;}}}// Range Sum Query by Segment Treeprivate static class RSQ {long[] st;int n;RSQ(int n) {this.n = 1;while (this.n < n) {this.n *= 2;}st = new long[2 * this.n - 1];}// i:0-indexedvoid add(int i, int x) {i = n - 1 + i;st[i] += x;while (i > 0) {i = (i - 1) / 2;st[i] += x;}}// a, b:0-indexed// [a, b)long query(int a, int b) {return query(a, b, 0, 0, n);}private long query(int a, int b, int i, int l, int r) {if (a >= r || b <= l) {return 0;}if (a <= l && b >= r) {return st[i];}return query(a, b, i * 2 + 1, l, (l + r) / 2) + query(a, b, i * 2 + 2, (l + r) / 2, r);}}// ---------------------------------------------------public static void main(String[] args) {sc = new Scanner(System.in);pr = new Printer(System.out);solve();pr.close();sc.close();}static class Scanner {BufferedReader br;Scanner (InputStream in) {br = new BufferedReader(new InputStreamReader(in));}private boolean isPrintable(int ch) {return ch >= '!' && ch <= '~';}private boolean isCRLF(int ch) {return ch == '\n' || ch == '\r' || ch == -1;}private int nextPrintable() {try {int ch;while (!isPrintable(ch = br.read())) {if (ch == -1) {throw new NoSuchElementException();}}return ch;} catch (IOException e) {throw new NoSuchElementException();}}String next() {try {int ch = nextPrintable();StringBuilder sb = new StringBuilder();do {sb.appendCodePoint(ch);} while (isPrintable(ch = br.read()));return sb.toString();} catch (IOException e) {throw new NoSuchElementException();}}int nextInt() {try {// parseInt from Integer.parseInt()boolean negative = false;int res = 0;int limit = -Integer.MAX_VALUE;int radix = 10;int fc = nextPrintable();if (fc < '0') {if (fc == '-') {negative = true;limit = Integer.MIN_VALUE;} else if (fc != '+') {throw new NumberFormatException();}fc = br.read();}int multmin = limit / radix;int ch = fc;do {int digit = ch - '0';if (digit < 0 || digit >= radix) {throw new NumberFormatException();}if (res < multmin) {throw new NumberFormatException();}res *= radix;if (res < limit + digit) {throw new NumberFormatException();}res -= digit;} while (isPrintable(ch = br.read()));return negative ? res : -res;} catch (IOException e) {throw new NoSuchElementException();}}long nextLong() {try {// parseLong from Long.parseLong()boolean negative = false;long res = 0;long limit = -Long.MAX_VALUE;int radix = 10;int fc = nextPrintable();if (fc < '0') {if (fc == '-') {negative = true;limit = Long.MIN_VALUE;} else if (fc != '+') {throw new NumberFormatException();}fc = br.read();}long multmin = limit / radix;int ch = fc;do {int digit = ch - '0';if (digit < 0 || digit >= radix) {throw new NumberFormatException();}if (res < multmin) {throw new NumberFormatException();}res *= radix;if (res < limit + digit) {throw new NumberFormatException();}res -= digit;} while (isPrintable(ch = br.read()));return negative ? res : -res;} catch (IOException e) {throw new NoSuchElementException();}}float nextFloat() {return Float.parseFloat(next());}double nextDouble() {return Double.parseDouble(next());}String nextLine() {try {int ch;while (isCRLF(ch = br.read())) {if (ch == -1) {throw new NoSuchElementException();}}StringBuilder sb = new StringBuilder();do {sb.appendCodePoint(ch);} while (!isCRLF(ch = br.read()));return sb.toString();} catch (IOException e) {throw new NoSuchElementException();}}void close() {try {br.close();} catch (IOException e) {// throw new NoSuchElementException();}}}static class Printer extends PrintWriter {Printer(OutputStream out) {super(out);}}}