#26099 (Java) No.59 鉄道の旅

• 問題: No.59 鉄道の旅
• ユーザー: fujisu
• 提出日時: 2015-05-11 02:53:05
• 言語: Java (openjdk 23)
• 結果: RE
• 実行時間: -
• コード長: 5,409 bytes
• コンパイル時間: 3,133 ms
• コンパイル使用メモリ: 78,900 KB
• 実行使用メモリ: 46,416 KB
• 最終ジャッジ日時: 2024-12-24 20:37:33
• 合計ジャッジ時間: 6,381 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 3 WA * 1 RE * 8

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
import java.io.IOException;
import java.util.InputMismatchException;
public class Main {
    class SegmentTree {
        int n;
        int[] tree;
        // ////////////////////////////////////////////////
        //　要素数k(0~k-1)
        // ////////////////////////////////////////////////
        SegmentTree(int k) {
            this.n = Integer.highestOneBit(k) << 1;
            while (k <= (this.n >> 1))
                this.n = this.n >> 1;
            tree = new int[2 * this.n];
        }
        // ////////////////////////////////////////////////
        // 区間和
        // addは更新でなく加算なので注意、半開区間[left, right)
        // ////////////////////////////////////////////////
        void add(int key, int value) {
            add(1, 0, this.n, key, value);
        }
        void add(int k, int low, int high, int key, int value) {
            if (key < low || high <= key) {
                return;
            }
            if (low + 1 == high) {
                this.tree[k] += value;
                return;
            }
            int mid = (low + high) / 2;
            add(2 * k, low, mid, key, value);
            add(2 * k + 1, mid, high, key, value);
            this.tree[k] = this.tree[2 * k] + this.tree[2 * k + 1];
        }
        int sum(int left, int right) {
            return sum(1, 0, this.n, left, right);
        }
        int sum(int k, int low, int high, int left, int right) {
            if (right <= low || high <= left) {
                return 0;
            }
            if (high <= low) {
                return 0;
            }
            if (left == low && high == right) {
                return this.tree[k];
            }
            int mid = (low + high) / 2;
            int sum = 0;
            sum += sum(2 * k, low, Math.min(high, mid), left, Math.min(right, mid));
            sum += sum(2 * k + 1, Math.max(low, mid), high, Math.max(left, mid), right);
            return sum;
        }
        // ////////////////////////////////////////////////
        // 区間最大値
        // updateは加算でなく更新なので注意、半開区間[left, right)
        // ////////////////////////////////////////////////
        void update(int key, int value) {
            update(1, 0, this.n, key, value);
        }
        void update(int k, int low, int high, int key, int value) {
            if (key < low || high <= key) {
                return;
            }
            if (low + 1 == high) {
                this.tree[k] = value;
                return;
            }
            int mid = (low + high) / 2;
            update(2 * k, low, mid, key, value);
            update(2 * k + 1, mid, high, key, value);
            this.tree[k] = Math.max(this.tree[2 * k], this.tree[2 * k + 1]);
        }
        int max(int left, int right) {
            return max(1, 0, this.n, left, right);
        }
        int max(int k, int low, int high, int left, int right) {
            if (right <= low || high <= left) {
                return 0;
            }
            if (high <= low) {
                return 0;
            }
            if (left == low && high == right) {
                return this.tree[k];
            }
            int mid = (low + high) / 2;
            int max = 0;
            max = Math.max(max, max(2 * k, low, Math.min(high, mid), left, Math.min(right, mid)));
            max = Math.max(max, max(2 * k + 1, Math.max(low, mid), high, Math.max(left, mid), right));
            return max;
        }
        // ////////////////////////////////////////////////
        // 共通
        // ////////////////////////////////////////////////
        int get(int key) {
            return this.tree[this.tree.length - n + key];
        }
    }
    void run() {
        MyScanner sc = new MyScanner();
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] w = sc.nextIntArray(n);
        SegmentTree seg = new SegmentTree(100000 + 2);
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            if (0 < w[i]) {
                if (seg.sum(w[i], 100000 + 1) < k) {
                    seg.add(w[i], 1);
                    cnt++;
                }
            } else {
                if (0 < seg.get(-w[i])) {
                    seg.add(-w[i], -1);
                    cnt--;
                }
            }
        }
        System.out.println(cnt);
    }
    public static void main(String[] args) {
        new Main().run();
    }
    public void mapDebug(int[][] a) {
        System.out.println("--------map display---------");
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                System.out.printf("%3d ", a[i][j]);
            }
            System.out.println();
        }
        System.out.println("----------------------------" + '\n');
    }
    class MyScanner {
        int read() {
            try {
                return System.in.read();
            } catch (IOException e) {
                throw new InputMismatchException();
            }
        }
        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
        boolean isEndline(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] nextIntArray(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; i++)
                array[i] = nextInt();
            return array;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        long[] nextLongArray(int n) {
            long[] array = new long[n];
            for (int i = 0; i < n; i++)
                array[i] = nextLong();
            return array;
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        double[] nextDoubleArray(int n) {
            double[] array = new double[n];
            for (int i = 0; i < n; i++)
                array[i] = nextDouble();
            return array;
        }
        String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }
        String[] nextStringArray(int n) {
            String[] array = new String[n];
            for (int i = 0; i < n; i++)
                array[i] = next();
            return array;
        }
        String nextLine() {
            int c = read();
            while (isEndline(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndline(c));
            return res.toString();
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX