Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define point pair<int, int>
- #define llong long long
- #define mp make_pair
- #define x first
- #define y second
- using namespace std;
- const int INF = (int) 1e6 + 3;
- const int MXN = (int) 1e5 + 7;
- int n, m;
- llong a[MXN], p[MXN];
- int main() {
- #define FN "army"
- #ifdef ONLINE_JUDGE
- freopen(FN".in", "r", stdin);
- freopen(FN".out", "w", stdout);
- #endif // ONLINE_JUDGE
- ios_base::sync_with_stdio(0);
- int len = 317;
- cin >> n;
- for (int i = 1; i <= len; i++)
- p[i] = 1;
- for (int i = 1; i <= n; i++) cin >> a[i];
- for (int i = 1; i <= n; i++)
- p[(i - 1) / len + 1] = (1ll * p[(i - 1) / len + 1] * a[i]) % INF;
- cin >> m;
- while (m--) {
- int q, l, r;
- cin >> q >> l >> r;
- if (q == 0) {
- for (int i = l; i <= r; i++) ++a[i];
- for (int i = 1; i <= len; i++)
- p[i] = 1;
- for (int i = 1; i <= n; i++)
- p[(i - 1) / len + 1] = (1ll * p[(i - 1) / len + 1] * a[i]) % INF;
- }
- else {
- int cur = 1;
- for (int i = 1; i <= len; i++) {
- int bl = (i - 1) * len + 1;
- int br = bl + len - 1;
- if (br > n) br = n;
- if (bl > n) break;
- if (l <= bl && br <= r) cur = (cur * 1ll * p[i]) % INF;
- else if (bl <= l && r <= br) {
- for (int q = l; q <= r; q++) cur = (cur * 1ll * a[q]) % INF;
- }
- else if (bl <= l && l <= br) {
- for (int q = l; q <= br; q++) cur = (cur * 1ll * a[q]) % INF;
- }
- else if (bl <= r && r <= br) {
- for (int q = bl; q <= r; q++) cur = (cur * 1ll * a[q]) % INF;
- }
- }
- cout << cur << "\n";
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment