#pragma GCC optimize("unroll-loops")
#pragma gcc optimize("Ofast")
#pragma GCC optimization("Ofast")
#pragma optimize(Ofast)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define str string
#define fs first
#define ss second
#define all(a) a.begin(), a.end()
#define print(a) \
for (auto x : a) \
cout << x << ' '; \
cout << endl;
void __print(signed x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const str &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const array<int, 2> &x)
{
cerr << '{';
__print(x[0]);
cerr << ',';
__print(x[1]);
cerr << '}';
}
template <typename T, typename V>
void __print(const pair<T, V> &x)
{
cerr << '{';
__print(x.fs);
cerr << ',';
__print(x.ss);
cerr << '}';
}
template <typename T>
void __print(const T &x)
{
int f = 0;
cerr << '{';
for (auto &y : x)
cerr << (f++ ? "," : ""), __print(y);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#ifdef ONLINE_JUDGE
#define debug(x...) 42
#endif
const int mod = 1e9 + 7;
struct SegTree
{
int size = 1;
vector<int> sum, adds;
SegTree(int n)
{
while (size < n)
size <<= 1;
sum.resize(size << 1);
adds.resize(size << 1);
}
void add(int l, int r, int v, int x, int lx, int rx)
{
if (l <= lx and rx <= r)
{
sum[x] += max(v, -adds[x]) * (rx - lx);
adds[x] += v;
adds[x] = max(adds[x], 0ll);
return;
}
if (r <= lx or rx <= l)
return;
int m = (lx + rx) >> 1;
add(l, r, v, (x << 1) + 1, lx, m);
add(l, r, v, (x << 1) + 2, m, rx);
sum[x] = sum[(x << 1) + 1] + sum[(x << 1) + 2] + adds[x] * (rx - lx);
}
inline void add(int l, int r, int v)
{
add(l, r, v, 0, 0, size);
}
int get(int l, int r, int x, int lx, int rx)
{
if (l <= lx and rx <= r)
return sum[x];
if (r <= lx or rx <= l)
return 0;
int m = (lx + rx) >> 1;
int ans = get(l, r, (x << 1) + 1, lx, m) + get(l, r, (x << 1) + 2, m, rx) + adds[x] * (min(r, rx) - max(l, lx));
return ans;
}
inline int get(int l, int r)
{
return get(l, r, 0, 0, size);
}
};
void solve()
{
int n, m, q;
cin >> n >> m >> q;
if (m == 1)
{
SegTree s(n);
for (int i = 0; i < q; i++)
{
int t;
cin >> t;
if (t == 1)
{
int l, r, c, k;
cin >> l >> r >> c >> k;
l--;
s.add(l, r, k);
}
else if (t == 2)
{
int l, r, k;
cin >> l >> r >> k;
l--;
s.add(l, r, -k);
}
else
{
int a, b;
cin >> a >> b;
int x = s.get(a - 1, a);
cout << x << endl;
if(x >= b)
cout << 1;
else
cout << 0;
if(i < q - 1)
cout << endl;
}
}
}
}
signed main()
{
fastio;
int t = 1;
// cin >> t;
while (t--)
solve();
}
Compilation message
foodcourt.cpp:2: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
2 | #pragma gcc optimize("Ofast")
|
foodcourt.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
3 | #pragma GCC optimization("Ofast")
|
foodcourt.cpp:4: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
4 | #pragma optimize(Ofast)
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
149 ms |
9588 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
