#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if (x < 0)
x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if (x < 0)
x += mod;
}
struct SegmentTree
{
vector<int> st;
int n;
/// real n
SegmentTree(int _n = 0) : n(_n)
{
st.resize(4 * n + 10);
}
void resize(int _n)
{
n = _n;
st.resize(4 * n + 10);
}
void update(int id, int l, int r, int x, int val)
{
if (x > r or x < l)
return;
if (l == r)
{
st[id] += val;
return;
}
int mid = (l + r) >> 1;
update(id << 1, l, mid, x, val);
update(id << 1 | 1, mid + 1, r, x, val);
st[id] = st[id << 1] + st[id << 1 | 1];
}
void assign(int id, int l, int r, int x, int val)
{
if (x > r or x < l)
return;
if (l == r)
{
st[id] = val;
return;
}
int mid = (l + r) >> 1;
assign(id << 1, l, mid, x, val);
assign(id << 1 | 1, mid + 1, r, x, val);
st[id] = st[id << 1] + st[id << 1 | 1];
}
int get(int id, int l, int r, int u, int v)
{
if (l > v || u > r)
return 0;
if (u <= l && r <= v)
return st[id];
int mid = (l + r) >> 1;
return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
}
int get(int l, int r)
{
return get(1, 1, n, l, r);
}
void update(int x, int val)
{
update(1, 1, n, x, val);
}
void assign(int x, int val)
{
assign(1, 1, n, x, val);
}
} s, p;
int gets(int l, int r)
{
return s.get(l, r) - (l - 1) * p.get(l, r);
}
int getp(int l, int r)
{
return p.get(l, r);
}
int n, k, q, a[maxn];
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
s.resize(n);
p.resize(n);
fo(i, 1, n)
{
cin >> a[i];
p.assign(i, a[i]);
s.assign(i, a[i] * i);
}
cin >> q;
while (q--)
{
int t;
cin >> t;
if (t == 1)
{
vi id(k), val;
for (int &it : id)
{
cin >> it;
val.pb(a[it]);
}
fo(i, 0, k - 1)
{
a[id[i]] = val[(i + 1) % k];
s.assign(id[i], a[id[i]] * id[i]);
p.assign(id[i], a[id[i]]);
}
}
else
{
int l, r, m;
cin >> l >> r >> m;
int ans = 0;
if(r - l + 1 == m) ans = getp(l,r);
else
if (r - l + 1 < 2 * m)
{
int len = (r - l + 1) - m + 1;
// cout << len;en;
// cout << gets(l,r - m);en;
// cout << r - m + 1 << ' ' << r;en;
// cout << r - len + 2 << ' ' << r;en;
// cout << len * getp(r - m + 1, r);en;
ans = gets(l, r - m) + len * getp(r - m + 1, r) - gets(r - len + 2, r);
}
else
{
// fo(i,1,n) cout << a[i] << 'x';en;
// fo(i,1,n) cout << getp(i,i) << 'x';en;
ans = gets(l, l + m - 2) + m * getp(l + m - 1, r) - gets(r - m + 2, r);
}
cout << ans;
en;
}
}
}
Compilation message
Main.cpp:132:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
132 | main()
| ^~~~
Main.cpp: In function 'int main()':
Main.cpp:137:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
137 | freopen(name ".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:138:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
138 | freopen(name ".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
352 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
2 ms |
604 KB |
Output is correct |
| 4 |
Correct |
3 ms |
736 KB |
Output is correct |
| 5 |
Correct |
5 ms |
860 KB |
Output is correct |
| 6 |
Correct |
6 ms |
860 KB |
Output is correct |
| 7 |
Correct |
7 ms |
1040 KB |
Output is correct |
| 8 |
Correct |
8 ms |
1116 KB |
Output is correct |
| 9 |
Correct |
17 ms |
1500 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
39 ms |
3668 KB |
Output is correct |
| 3 |
Correct |
55 ms |
4692 KB |
Output is correct |
| 4 |
Correct |
98 ms |
8016 KB |
Output is correct |
| 5 |
Correct |
150 ms |
11280 KB |
Output is correct |
| 6 |
Correct |
157 ms |
11172 KB |
Output is correct |
| 7 |
Correct |
135 ms |
11104 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
124 ms |
6228 KB |
Output is correct |
| 2 |
Correct |
132 ms |
9552 KB |
Output is correct |
| 3 |
Correct |
236 ms |
12624 KB |
Output is correct |
| 4 |
Correct |
160 ms |
11656 KB |
Output is correct |
