結果

問題 No.59 鉄道の旅
ユーザー t8m8⛄️
提出日時 2015-08-20 06:48:07
言語 Java
(openjdk 23)
結果
RE  
実行時間 -
コード長 4,195 bytes
コンパイル時間 4,063 ms
コンパイル使用メモリ 80,296 KB
実行使用メモリ 50,432 KB
最終ジャッジ日時 2024-12-24 21:50:34
合計ジャッジ時間 5,202 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 2 RE * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
public class No0059 {
    static final Reader in = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);
    static void solve(){
        final int SIZE = 100001;
        int n = in.nextInt();
        int k = in.nextInt();
        FenwickTree ft = new FenwickTree(SIZE);
        while (n-- > 0) {
            int w = in.nextInt();
            if (w > 0) {
                if (ft.get(SIZE-1) - ft.get(w-1) < k) ft.add(w,SIZE,1);
            } else {
                if (ft.get(-w) - ft.get(-w-1) > 0) ft.add(-w,SIZE,-1);
            }
        }
        out.println(ft.get(SIZE-1));
    }
    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();
        solve();
        out.flush();
        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
        out.close();
    }
    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}
class FenwickTree {
    public static final long MOD = 1_000_000_007;
    public final int length;
    private long[] data;
    public FenwickTree(int length) {
        this.length = length;
        this.data = new long[length+2];
    }
    public void add(int begin, int end, long n) {
        add(begin, n);
        add(end, (MOD - n)%MOD);
    }
    private void add(int idx, long n) {
        idx++;
        while (idx <= length) {
            data[idx] = (data[idx] + n)%MOD;
            idx += idx&-idx;
        }
    }
    public long get(int idx) {
        idx++;
        long ret = 0;
        while (idx > 0) {
            ret = (ret + data[idx])%MOD;
            idx -= idx&-idx;
        }
        return ret;
    }
    public String toString() {
        long[] val = new long[length];
        for (int i=0; i<length; i++) val[i] = get(i);
        return Arrays.toString(val);
    }
}
class Reader {
    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}
    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }
    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}
    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}
    public boolean hasNext() {skip(); 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 long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();
        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }
    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }
    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }
    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }
    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0