結果

問題 No.631 Noelちゃんと電車旅行
ユーザー uwiuwi
提出日時 2018-01-05 21:37:16
言語 Java
(openjdk 23)
結果
AC  
実行時間 380 ms / 2,000 ms
コード長 7,328 bytes
コンパイル時間 3,777 ms
コンパイル使用メモリ 87,584 KB
実行使用メモリ 51,284 KB
最終ジャッジ日時 2024-10-02 09:26:18
合計ジャッジ時間 10,641 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 301 ms
47,504 KB
testcase_01 AC 380 ms
50,660 KB
testcase_02 AC 376 ms
51,284 KB
testcase_03 AC 363 ms
51,016 KB
testcase_04 AC 373 ms
51,180 KB
testcase_05 AC 367 ms
50,764 KB
testcase_06 AC 218 ms
45,300 KB
testcase_07 AC 167 ms
42,756 KB
testcase_08 AC 295 ms
49,892 KB
testcase_09 AC 329 ms
45,980 KB
testcase_10 AC 279 ms
50,372 KB
testcase_11 AC 256 ms
46,484 KB
testcase_12 AC 287 ms
49,800 KB
testcase_13 AC 280 ms
47,540 KB
testcase_14 AC 192 ms
42,000 KB
testcase_15 AC 261 ms
45,564 KB
testcase_16 AC 47 ms
36,960 KB
testcase_17 AC 48 ms
37,096 KB
testcase_18 AC 51 ms
36,664 KB
testcase_19 AC 50 ms
37,128 KB
testcase_20 AC 48 ms
36,664 KB
権限があれば一括ダウンロードができます

ソースコード

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

package contest180105;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class E {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int[] a = na(n-1);
long[] b = new long[n-1];
for(int i = 0;i < n-1;i++){
b[i] = -((n-1-i)*3 + a[i]);
}
StarrySkyTreeL sst = new StarrySkyTreeL(b);
for(int Q = ni();Q > 0;Q--){
int l = ni()-1, r = ni()-1, d = ni();
sst.add(l, r+1, -d);
out.println(-sst.minx(0, n-1));
}
}
public static class StarrySkyTreeL {
public int M, H, N;
public long[] st;
public long[] plus;
public long I = Long.MAX_VALUE/4; // I+plus<long
public StarrySkyTreeL(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(n-1, 1))<<2;
H = M>>>1;
st = new long[M];
plus = new long[H];
}
public StarrySkyTreeL(long[] a)
{
N = a.length;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new long[M];
for(int i = 0;i < N;i++){
st[H+i] = a[i];
}
plus = new long[H];
Arrays.fill(st, H+N, M, I);
for(int i = H-1;i >= 1;i--)propagate(i);
}
private void propagate(int i)
{
st[i] = Math.min(st[2*i], st[2*i+1]) + plus[i];
}
public void add(int l, int r, long v){ if(l < r)add(l, r, v, 0, H, 1); }
private void add(int l, int r, long v, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
if(cur >= H){
st[cur] += v;
}else{
plus[cur] += v;
propagate(cur);
}
}else{
int mid = cl+cr>>>1;
if(cl < r && l < mid){
add(l, r, v, cl, mid, 2*cur);
}
if(mid < r && l < cr){
add(l, r, v, mid, cr, 2*cur+1);
}
propagate(cur);
}
}
public long min(int l, int r){ return l >= r ? I : min(l, r, 0, H, 1);}
private long min(int l, int r, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
return st[cur];
}else{
int mid = cl+cr>>>1;
long ret = I;
if(cl < r && l < mid){
ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
}
if(mid < r && l < cr){
ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
}
return ret + plus[cur];
}
}
public void fall(int i)
{
if(i < H){
if(2*i < H){
plus[2*i] += plus[i];
plus[2*i+1] += plus[i];
}
st[2*i] += plus[i];
st[2*i+1] += plus[i];
plus[i] = 0;
}
}
public int firstle(int l, long v) {
int cur = H+l;
for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){
fall(i);
i = i*2|cur>>>j&1;
}
while(true){
fall(cur);
if(st[cur] <= v){
if(cur < H){
cur = 2*cur;
}else{
return cur-H;
}
}else{
cur++;
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
}
}
}
public int lastle(int l, long v) {
int cur = H+l;
for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){
fall(i);
i = i*2|cur>>>j&1;
}
while(true){
fall(cur);
if(st[cur] <= v){
if(cur < H){
cur = 2*cur+1;
}else{
return cur-H;
}
}else{
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
cur--;
}
}
}
public void addx(int l, int r, long v){
if(l >= r)return;
while(l != 0){
int f = l&-l;
if(l+f > r)break;
if(f == 1){
st[(H+l)/f] += v;
}else{
plus[(H+l)/f] += v;
}
l += f;
}
while(l < r){
int f = r&-r;
if(f == 1){
st[(H+r)/f-1] += v;
}else{
plus[(H+r)/f-1] += v;
}
r -= f;
}
}
public long minx(int l, int r){
long lmin = I;
if(l >= r)return lmin;
if(l != 0){
for(int d = 0;H>>>d > 0;d++){
if(d > 0){
int id = (H+l-1>>>d);
lmin += plus[id];
}
if(l<<~d<0 && l+(1<<d) <= r){
long v = st[H+l>>>d];
if(v < lmin)lmin = v;
l += 1<<d;
}
}
}
long rmin = I;
for(int d = 0;H>>>d > 0;d++){
if(d > 0 && r < H)rmin += plus[H+r>>>d];
if(r<<~d<0 && l < r){
long v = st[(H+r>>>d)-1];
if(v < rmin)rmin = v;
r -= 1<<d;
}
}
long min = Math.min(lmin, rmin);
return min;
}
public long[] toArray() { return toArray(1, 0, H, new long[H]); }
private long[] toArray(int cur, int l, int r, long[] ret)
{
if(r-l == 1){
ret[cur-H] = st[cur];
}else{
toArray(2*cur, l, l+r>>>1, ret);
toArray(2*cur+1, l+r>>>1, r, ret);
for(int i = l;i < r;i++)ret[i] += plus[cur];
}
return ret;
}
}
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 E().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