#include<bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int lazy[402000], a[100009], n, m, K, f[402000], imax[402000];
void init(int k, int l, int r)
{
if(l == r)
{
f[k] = a[l];
imax[k] = a[l];
return ;
}
int mid = (l + r) / 2;
init(k * 2, l, mid);
init(k * 2 + 1, mid + 1, r);
f[k] = f[k * 2] + f[k * 2 + 1];
imax[k] = max(imax[k * 2], imax[k * 2 + 1]);
}
void upd(int k, int l, int r, int L, int R)
{
if(r < L || R < l || r < l)
return ;
if(l == r)
{
f[k] = f[k] / K;
imax[k] = f[k];
return;
}
int mid = (l + r) / 2;
if(imax[k * 2] > 0)
upd(k * 2, l, mid, L, R);
if(imax[k * 2 + 1] > 0)
upd(k * 2 + 1, mid + 1, r, L, R);
f[k] = f[k * 2] + f[k * 2 + 1];
imax[k] = max(imax[k * 2], imax[k * 2 + 1]);
}
void updd(int k, int l, int r, int pos, int val)
{
if(r < pos || l > pos)
return;
if(l == pos && r == pos)
{
f[k] = val;
imax[k] = f[k];
return;
}
int mid = (l + r) / 2;
updd(k * 2, l, mid, pos, val);
updd(k * 2 + 1, mid + 1, r, pos, val);
f[k] = f[k * 2] + f[k * 2 + 1];
imax[k] = max(imax[k * 2], imax[k * 2 + 1]);
}
int getsum(int k, int l, int r, int L, int R)
{
if(r < L || R < l || r < l)
return 0;
if(L <= l && r <= R)
return f[k];
int mid = (l + r) / 2;
return getsum(k * 2, l, mid, L, R) + getsum(k * 2 + 1, mid + 1, r, L, R);
}
signed main()
{
scanf("%d%d%d", &n, &m, &K);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
init(1, 1, n);
while(m --)
{
int t, l, r;
cin >> t >> l >> r;
if(t == 1)
updd(1, 1, n, l, r);
else if(t == 2 && K != 1)
upd(1, 1, n, l, r);
else
printf("%d\n", getsum(1, 1, n, l, r));
}
}
Compilation message
sterilizing.cpp: In function 'int main()':
sterilizing.cpp:64:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &n, &m, &K);
^
sterilizing.cpp:66:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i]);
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
7116 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
533 ms |
7116 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
93 ms |
7116 KB |
Output is correct |
2 |
Correct |
73 ms |
7116 KB |
Output is correct |
3 |
Correct |
43 ms |
7116 KB |
Output is correct |
4 |
Correct |
313 ms |
7116 KB |
Output is correct |
5 |
Correct |
156 ms |
7116 KB |
Output is correct |
6 |
Correct |
326 ms |
7116 KB |
Output is correct |
7 |
Incorrect |
306 ms |
7116 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
236 ms |
7116 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |