結果

問題 No.59 鉄道の旅
ユーザー t8m8⛄️t8m8⛄️
提出日時 2015-08-20 06:50:33
言語 Java21
(openjdk 21)
結果
AC  
実行時間 116 ms / 5,000 ms
コード長 4,130 bytes
コンパイル時間 3,572 ms
コンパイル使用メモリ 75,160 KB
実行使用メモリ 59,304 KB
最終ジャッジ日時 2023-08-26 06:39:09
合計ジャッジ時間 5,063 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
55,556 KB
testcase_01 AC 44 ms
55,536 KB
testcase_02 AC 43 ms
55,568 KB
testcase_03 AC 42 ms
55,740 KB
testcase_04 AC 114 ms
59,108 KB
testcase_05 AC 41 ms
55,616 KB
testcase_06 AC 42 ms
55,900 KB
testcase_07 AC 41 ms
55,592 KB
testcase_08 AC 66 ms
57,620 KB
testcase_09 AC 71 ms
57,328 KB
testcase_10 AC 69 ms
57,988 KB
testcase_11 AC 55 ms
57,720 KB
testcase_12 AC 83 ms
58,356 KB
testcase_13 AC 116 ms
59,032 KB
testcase_14 AC 113 ms
59,304 KB
testcase_15 AC 42 ms
55,440 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class No0059 {

	static final Reader in = new Reader();
	static final PrintWriter out = new PrintWriter(System.out,false);

	static void solve(){
		final int SIZE = 1000001;

		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();}};
}
0