結果
| 問題 | No.631 Noelちゃんと電車旅行 |
| ユーザー |
 yuya178
|
| 提出日時 | 2018-01-06 20:27:05 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,825 bytes |
| コンパイル時間 | 2,530 ms |
| コンパイル使用メモリ | 83,940 KB |
| 実行使用メモリ | 128,480 KB |
| 最終ジャッジ日時 | 2024-06-02 11:36:38 |
| 合計ジャッジ時間 | 16,531 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
ソースコード
import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
long MOD = 1_000_000_007;
int inf = Integer.MAX_VALUE;
int n;
int[] t;
void solve(){
n = ni();
t = new int[n-1];
for(int i = 0; i < n-1; i++){
t[i] = ni();
}
LazySegmentTree seg = new LazySegmentTree();
for(int i = 0; i < n-1; i++){
int tmp = 3*(n-1-i) + t[i];
seg.update(i,i+1,tmp);
}
int m = ni();
for(int i = 0; i < m; i++){
int l = ni()-1;
int r = ni()-1;
int d = ni();
// out.println(l+" "+r);
seg.update(l,r+1,d);
long res = seg.query(0,n)[0];
// for(int j = 0; j < n; j++){
// long r1 = seg.query(j,j+1)[0];
// out.println(r1);
// }
out.println(res);
}
}
class LazySegmentTree {
int SIZE = 1 << 19;
long[][] seg;
long[] lazy;
LazySegmentTree() {
this.seg = new long[2 * SIZE][2];
this.lazy = new long[2 * SIZE];
for(int i=0;i<2*SIZE;++i){
seg[i][0] = 0;
seg[i][1] = 0;
lazy[i] = 0;
}
}
long[] comb(long[] a, long[] b){
return new long[]{Math.max(a[0],b[0]),a[1]+b[1]};
}
long[] query(int a,int b,int l,int r,int k){
eval(l,r,k);
if(a<=l&&r<=b) return seg[k];
if(b<=l||r<=a) return new long[]{0,0};
long[] ans1=query(a,b,l,(l+r)/2,2*k+1);
long[] ans2=query(a,b,(l+r)/2,r,2*k+2);
return comb(ans1,ans2);
}
long[] query(int l, int r) {
return query(l,r,0,SIZE,0);
}
void eval(int l, int r, int k){
if(this.lazy[k]!= 0){
this.seg[k][0] += this.lazy[k];
if(r-l>1){
this.lazy[2*k+1] = this.lazy[k];
this.lazy[2*k+2] = this.lazy[k];
}
this.lazy[k] = 0;
}
}
void update(int a, int b, long x, int l, int r, int k){
eval(l,r,k);
if(b<=l||r<=a) return;
if(a<=l&&r<=b){
this.lazy[k] = x;
eval(l,r,k);
}
else{
update(a,b,x,l,(l+r)/2,2*k+1);
update(a,b,x,(l+r)/2,r,2*k+2);
this.seg[k] = comb(this.seg[2*k+1],this.seg[2*k+2]);
}
}
void update(int a, int b, long x){
update(a, b, x, 0, SIZE, 0);
}
}
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");
}
public static void main(String[] args) throws Exception { new Main().run(); }
private byte[] inbuf = new byte[1024];
private 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) && 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 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[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, 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 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)); }
}