比赛 2026.8.28 评测结果 AAAAATTTTT
题目名称 无法拒绝孤独的她 最终得分 50
用户昵称 LikableP 运行时间 11.141 s
代码语言 C++ 内存使用 21.67 MiB
提交时间 2026-08-28 12:19:22
显示代码纯文本
#include <cstdio>
#include <cctype>
#include <vector>

typedef __int128 i128;

struct IO {
    static const int BUFSIZE = 1 << 20;
    char buf[BUFSIZE], *p1, *p2;
    char pbuf[BUFSIZE], *pp;
    
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() { fwrite(pbuf, 1, pp - pbuf, stdout); }
    
    char getchar() {
        if (p1 == p2) {
            p2 = (p1 = buf) + fread(buf, 1, BUFSIZE, stdin);
            if (p1 == p2) return EOF;
        }
        return *p1++;
    }
    
    void putchar(char ch) {
        if (pp - pbuf == BUFSIZE) fwrite(pbuf, 1, BUFSIZE, stdout), pp = pbuf;
        *pp++ = ch;
    }
    
    template <typename T> T read() {
        T res = 0, f = 1;
        char ch = getchar();
        for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
        for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
        return res * f;
    }
    
    template <typename T> void write(T x, char ed = '\n') {
        if (x < 0) x = -x, putchar('-');
        static int sta[sizeof(T) << 2], top = 0;
        do {
            sta[++top] = x % 10;
            x /= 10;
        } while (x);
        while (top) {
            putchar(sta[top--] ^ 48);
        }
        putchar(ed);
    }
} io;

int n, q;
std::vector<i128> a, b, c;

long long Work(std::vector<i128> a, std::vector<i128> b, std::vector<i128> c) {
    long long res = 0;
    for (int i = 1; i <= n; ++i) {
        res += std::min(a[i], b[i]);
        a[i] -= std::min(a[i], b[i]);
        if (i != n) a[i + 1] += std::min(a[i], c[i]);
    }
    return res;
}

bool specialA = true, specialB = true, specialC = true;
long long specialans;

int main() {
    freopen("cantrefuse.in", "r", stdin);
    freopen("cantrefuse.out", "w", stdout);
    n = io.read<int>(), q = io.read<int>();
    a.resize(n + 1), b.resize(n + 1), c.resize(n + 1);
    for (int i = 1; i <= n; ++i) {
        a[i] = io.read<i128>();
        specialA &= a[i] == 0;
    }
    for (int i = 1; i <= n; ++i) {
        b[i] = io.read<i128>();
        specialB &= b[i] == 0;
        specialans += std::min(a[i], b[i]);
    }
    for (int i = 1; i <= n - 1; ++i) {
        c[i] = io.read<i128>();
        specialC &= c[i] == 0;
    }
    
    while (q--) {
        long long p = io.read<i128>(), x = io.read<i128>(), y = io.read<i128>(), z = io.read<i128>();
        if (n > 5000 && specialC) {
            specialans -= std::min(a[p], b[p]);
            a[p] = x, b[p] = y;
            specialans += std::min(a[p], b[p]);
            io.write(specialans);
        } else if (n > 5000 && (specialA || specialB)) {
            io.write(0);
        } else {
            a[p] = x, b[p] = y, c[p] = z;
            io.write(Work(a, b, c));
        }
    }
    return 0;
}