QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#168068 | #6857. Easy problem II | C1942huangjiaxu | AC ✓ | 1881ms | 3820kb | C++14 | 871b | 2023-09-07 20:50:08 | 2023-09-07 20:50:08 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
int main() {
std::cin.tie(nullptr)->sync_with_stdio(false);
int n, m;
std::cin >>n>> n >> m;
std::vector<i64> a(n);
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
for (int i = 0; i < m; ++i) {
int op, l, r, x = -1;
std::cin >> op >> l >> r;
--l;
if (op == 1) {
std::cin >> x;
for (int i = l; i < r; ++i) {
if (a[i] < x) {
a[i] = x - a[i];
} else {
a[i] = x + a[i];
}
}
}
if (op == 2) {
i64 ans = 0;
for (int i = l; i < r; ++i) {
ans += a[i];
}
std::cout << ans << '\n';
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1881ms
memory: 3820kb
input:
1 100000 100000 9994250 1 9999152 1 9996205 1 9993920 1 9992936 1 9999312 1 9994863 1 9999950 1 9994702 1 9998302 1 9997460 1 9995584 1 9990858 1 9995764 1 9992400 1 9992970 1 9993486 1 9992200 1 9991250 1 9990336 1 9994212 1 9992704 1 9999400 1 9994826 1 9996272 1 9995920 1 9994960 1 9996400 1 9990...
output:
474104664177 469903014249 480933011291 483822399944 484396591822 485195157450 476873328231 500050522935 490495899612 455001143708 459350186600 463088605817 452789422852 457530804729 478921256445 483860248443 460953094343 461203887676 471567676461 499102979676 483610787357 490750641096 468023668995 4...
result:
ok 85563 lines