結果

問題 No.871 かえるのうた
ユーザー uwiuwi
提出日時 2019-08-30 21:23:35
言語 Java
(openjdk 23)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 6,447 bytes
コンパイル時間 5,039 ms
コンパイル使用メモリ 87,064 KB
実行使用メモリ 43,204 KB
最終ジャッジ日時 2024-11-30 10:43:46
合計ジャッジ時間 10,196 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,760 KB
testcase_01 AC 54 ms
36,948 KB
testcase_02 AC 52 ms
36,596 KB
testcase_03 AC 52 ms
37,024 KB
testcase_04 AC 52 ms
36,852 KB
testcase_05 AC 53 ms
36,844 KB
testcase_06 AC 52 ms
37,004 KB
testcase_07 AC 53 ms
36,880 KB
testcase_08 AC 55 ms
37,068 KB
testcase_09 AC 58 ms
36,840 KB
testcase_10 AC 56 ms
37,148 KB
testcase_11 AC 55 ms
36,864 KB
testcase_12 AC 84 ms
38,500 KB
testcase_13 AC 61 ms
37,048 KB
testcase_14 AC 128 ms
40,476 KB
testcase_15 AC 127 ms
40,172 KB
testcase_16 AC 199 ms
43,204 KB
testcase_17 AC 135 ms
40,160 KB
testcase_18 AC 77 ms
38,516 KB
testcase_19 AC 145 ms
40,304 KB
testcase_20 AC 91 ms
38,424 KB
testcase_21 AC 121 ms
39,656 KB
testcase_22 AC 52 ms
37,152 KB
testcase_23 AC 53 ms
37,064 KB
testcase_24 AC 53 ms
36,896 KB
testcase_25 AC 61 ms
36,888 KB
testcase_26 AC 84 ms
38,716 KB
testcase_27 AC 77 ms
37,724 KB
testcase_28 AC 55 ms
36,916 KB
testcase_29 AC 99 ms
39,436 KB
testcase_30 AC 163 ms
41,408 KB
testcase_31 AC 58 ms
36,912 KB
testcase_32 AC 147 ms
42,568 KB
testcase_33 AC 138 ms
40,772 KB
testcase_34 AC 88 ms
38,380 KB
testcase_35 AC 114 ms
39,624 KB
testcase_36 AC 122 ms
40,148 KB
testcase_37 AC 120 ms
40,184 KB
testcase_38 AC 182 ms
41,800 KB
testcase_39 AC 175 ms
41,324 KB
testcase_40 AC 135 ms
42,580 KB
testcase_41 AC 52 ms
36,940 KB
testcase_42 AC 147 ms
42,020 KB
testcase_43 AC 52 ms
37,064 KB
testcase_44 AC 52 ms
36,980 KB
testcase_45 AC 56 ms
37,068 KB
testcase_46 AC 52 ms
37,152 KB
testcase_47 AC 54 ms
37,064 KB
testcase_48 AC 53 ms
36,820 KB
権限があれば一括ダウンロードができます

ソースコード

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

package contest190830;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
import java.util.Queue;
public class B {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int K = ni()-1;
long[] x = new long[n];
for(int i= 0;i < n;i++) {
x[i] = nl();
}
long[] a = new long[n];
for(int i= 0;i < n;i++) {
a[i] = nl();
}
LST lst = new LST(n);
lst.setRange(n);
Queue<Integer> q = new ArrayDeque<>();
q.add(K);
lst.unset(K);
int g = 1;
while(!q.isEmpty()) {
int cur = q.poll();
while(true) {
int prev = lst.prev(cur);
if(prev == -1)break;
if(x[cur] - x[prev] <= a[cur]) {
lst.unset(prev);
q.add(prev);
g++;
}else {
break;
}
}
while(true) {
int next = lst.next(cur);
if(next == -1)break;
if(x[next] - x[cur] <= a[cur]) {
lst.unset(next);
q.add(next);
g++;
}else {
break;
}
}
}
out.println(g);
}
public static class LST {
public long[][] set;
public int n;
// public int size;
public LST(int n) {
this.n = n;
int d = 1;
for(int m = n;m > 1;m>>>=6, d++);
set = new long[d][];
for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
set[i] = new long[m+1];
}
// size = 0;
}
// [0,r)
public LST setRange(int r)
{
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r>>>6;j++){
set[i][j] = -1L;
}
if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
}
return this;
}
// [0,r)
public LST unsetRange(int r)
{
if(r >= 0){
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r+63>>>6;j++){
set[i][j] = 0;
}
if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
}
}
return this;
}
public LST set(int pos)
{
if(pos >= 0 && pos < n){
// if(!get(pos))size++;
for(int i = 0;i < set.length;i++, pos>>>=6){
set[i][pos>>>6] |= 1L<<pos;
}
}
return this;
}
public LST unset(int pos)
{
if(pos >= 0 && pos < n){
// if(get(pos))size--;
for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
set[i][pos>>>6] &= ~(1L<<pos);
}
}
return this;
}
public boolean get(int pos)
{
return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
}
public LST toggle(int pos)
{
return get(pos) ? unset(pos) : set(pos);
}
public int prev(int pos)
{
for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
int pre = prev(set[i][pos>>>6], pos&63);
if(pre != -1){
pos = pos>>>6<<6|pre;
while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
public int next(int pos)
{
for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
int nex = next(set[i][pos>>>6], pos&63);
if(nex != -1){
pos = pos>>>6<<6|nex;
while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
private static int prev(long set, int n)
{
long h = set<<~n;
if(h == 0L)return -1;
return -Long.numberOfLeadingZeros(h)+n;
}
private static int next(long set, int n)
{
long h = set>>>n;
if(h == 0L)return -1;
return Long.numberOfTrailingZeros(h)+n;
}
@Override
public String toString()
{
List<Integer> list = new ArrayList<Integer>();
for(int pos = next(0);pos != -1;pos = next(pos+1)){
list.add(pos);
}
return list.toString();
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new B().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0