結果
| 問題 | No.1000 Point Add and Array Add |
| ユーザー |
 Oland
|
| 提出日時 | 2020-02-29 09:39:43 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,792 bytes |
| コンパイル時間 | 2,163 ms |
| コンパイル使用メモリ | 79,328 KB |
| 実行使用メモリ | 57,856 KB |
| 最終ジャッジ日時 | 2024-10-13 19:51:35 |
| 合計ジャッジ時間 | 8,617 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | AC | 48 ms
36,872 KB |
| 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 | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
ソースコード
import java.io.*;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long MAX = Long.MAX_VALUE / 2;
void solve(){
int N = in.nextInt(), Q = in.nextInt();
long[] A = in.nextLongArray(N);
char[] c = new char[Q];
int[] x = new int[Q], y = new int[Q];
for(int i = 0; i < Q; i++){
c[i] = in.nextChar();
x[i] = in.nextInt();
y[i] = in.nextInt();
}
DualSegmentTree seg = new DualSegmentTree(N, 0);
long[] B = new long[N];
for(int i = Q - 1; i >= 0; i--){
if(c[i] == 'A'){
B[x[i] - 1] += y[i] * seg.getPoint(x[i] - 1);
}else{
seg.setSegment(x[i] - 1, y[i], 1);
}
}
for(int i = 0; i < N; i++) B[i] += A[i] * seg.getPoint(i);
for(long e : B) out.println(e);
}
class DualSegmentTree{
int d;
long[] node;
/*作用素で使える単位元*/
private long e = 0;
/*結合律が成り立ち、更新が可換であるような、各要素への作用素*/
private long f(long nodeVal, long val){
return nodeVal + val;
}
/* 初期化 */
public DualSegmentTree(int sz, long val){
long[] v = new long[sz];
Arrays.fill(v, val);
init(v, val);
}
/* 配列vで初期化 */
public DualSegmentTree(long[] v, long e){
init(v, e);
}
private void init(long[] v, long e){
this.e = e;
d = 1;
while(d < v.length) d *= 2;
node = new long[2*d];
Arrays.fill(node, e);
for(int i = 0; i < v.length; i++)
node[i+d] = v[i];
}
/* 0-indexed:xの要素を取得する */
public long getPoint(int x){
x += d;
long res = node[x];
while(x > 1){
x = x / 2;
res = f(res, node[x]);
}
return res;
}
/* 指定した区間[L,R)に含まれるすべての要素に作用素を適用するクエリ */
public void setSegment(int L, int R, long val){
L += d;
R += d;
while (L < R) {
if ((L & 1) != 0){
node[L] = f(node[L], val);
L++;
}
if ((R & 1) != 0){
--R;
node[R] = f(node[R], val);
}
L >>= 1;
R >>= 1;
}
}
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "input.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}