Untitled
user_9000366
plain_text
8 months ago
1.1 kB
5
Indexable
void Mesh_JOO() {
int n, m, q;
cin >> n >> m >> q;
vector<int> a(n);
for (auto &i: a)cin >> i;
vector<array<int, 3>> b(m);
for (auto &i: b)
cin >> i[0] >> i[1] >> i[2];
vector<int> on(m + 1);
while (q--) {
int l, r;
cin >> l >> r;
l--, r--;
on[l]++;
on[r + 1]--;
}
for (int i = 1; i <= m; ++i)
on[i] += on[i - 1];
vector<ll> pref1(n + 1);
for (int i = 0; i < m; ++i) {
int l = b[i][0], r = b[i][1], d = b[i][2];
l--, r--;
pref1[l] += 1ll * d * on[i], pref1[r + 1] -= 1ll * d * on[i];
}
for (int i = 1; i <= n; ++i)
pref1[i] += pref1[i - 1];
for (int i = 0; i < n; ++i)
cout << pref1[i] + a[i] << ' ';
}
void Mesh_JOO() {
string s;
cin >> s;
int sum = 0, res = 0;
for (int i = 0; i < s.size(); ++i) {
res++;
if (s[i] == '-')sum--;
else sum++;
if (sum < 0) {
res += i + 1;
sum = 0;
}
}
cout << res << '\n';
}Editor is loading...
Leave a Comment