[IndexedTree] baekjoon-12837

Author: Seogeurim

README.md

@@ -95,6 +95,7 @@
 | 04  |     | [Baekjoon-5676 음주 코딩](./src/IndexedTree/P5676)               |      |
 | 05  |     | [Baekjoon-1275 커피숍2](./src/IndexedTree/P1275)               |      |
 | 06  |     | [Baekjoon-2268 수들의 합](./src/IndexedTree/P2268)               |      |
+| 07  |     | [Baekjoon-12837 가계부 (Hard)](./src/IndexedTree/P12837)         |      |
 
 ### Trie
 

src/IndexedTree/P12837/Main.java

@@ -0,0 +1,49 @@
+package IndexedTree.P12837;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N, Q;
+    static long[] segTree;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/IndexedTree/P12837/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        Q = Integer.parseInt(st.nextToken());
+
+        segTree = new long[(int) Math.pow(2, Math.ceil(Math.log(N) / Math.log(2)) + 1)];
+        StringBuilder sb = new StringBuilder();
+        while (Q-- > 0) {
+            st = new StringTokenizer(br.readLine());
+            int cmd = Integer.parseInt(st.nextToken());
+            int p1 = Integer.parseInt(st.nextToken()), p2 = Integer.parseInt(st.nextToken());
+
+            if (cmd == 1) query1(1, 1, N, p1, p2);
+            else sb.append(query2(1, 1, N, p1, p2)).append("\n");
+        }
+        System.out.println(sb.toString());
+    }
+
+    static void query1(int node, int start, int end, int p, int x) {
+        if (start <= p && p <= end) {
+            if (start == end) segTree[node] += x;
+            else {
+                query1(node*2, start, (start+end)/2, p, x);
+                query1(node*2+1, (start+end)/2+1, end, p, x);
+                segTree[node] = segTree[node*2] + segTree[node*2+1];
+            }
+        }
+    }
+
+    static long query2(int node, int start, int end, int p, int q) {
+        if (q < start || end < p) return 0;
+        if (p <= start && end <= q) return segTree[node];
+        return query2(node*2, start, (start+end)/2, p, q)
+                + query2(node*2+1, (start+end)/2+1, end, p, q);
+    }
+}

src/IndexedTree/P12837/README.md

@@ -0,0 +1,11 @@
+## [baekjoon-12837] 가계부 (Hard)
+
+![image](https://user-images.githubusercontent.com/22045163/104865813-5adc3900-5980-11eb-8391-dbde17af9525.png)
+
+### 문제 이해
+
+처음에 문제를 잘못 이해해서 문제를 틀리게 되었다. 
+해당 문제의 1번 쿼리는 **값을 변경하는 것이 아니라, 추가하는 것**이라고 나와있다. 
+문제를 잘 읽어야 한다.
+
+![image](https://user-images.githubusercontent.com/22045163/104865962-b3133b00-5980-11eb-8aa2-88f70d0bcfb3.png)

src/IndexedTree/P12837/input.txt

@@ -0,0 +1,32 @@
+10 7
+1 3 10000
+1 4 -5000
+1 7 -3000
+2 4 7
+1 6 35000
+2 4 10
+2 3 4
+
+99 3
+1 1 1
+1 1 1
+2 1 1
+
+
+
+//output
+2000
+27000
+
+10 10
+1 1 1
+1 2 2
+1 3 3
+1 4 4
+1 5 5
+1 6 6
+1 7 7
+1 8 8
+1 9 9
+1 10 10
+