Submission

PPTTTTTTTTTTTTTTTTTT

Score: 10

User: mydKN

Problemset: ผลบวก (ยาก)

Language: c

Time: 0.185 second

Submitted On: 2024-10-15 10:54:54

#include <stdio.h>

#define MAXN 1000010

int n;
int arr[MAXN];
int q, t;

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &arr[i]);
    }

    scanf("%d", &q);
    for (int i = 0; i < q; ++i) {
        scanf("%d", &t);
        for (int j = 0; j < t; ++j) {
            int idx, val;
            scanf("%d %d", &idx, &val);
            arr[idx] = val;  // Update the value directly
        }

        int x, y;
        scanf("%d %d", &x, &y);
        
        long long sum = 0;  // Use long long to prevent overflow
        for (int j = x; j <= y; ++j) {
            sum += arr[j];
        }
        
        printf("%lld\n", sum);
    }

    return 0;
}