Submission #978452

#	Time	Username	Problem	Language	Result	Execution time	Memory
978452		vjudge1	Food Court (JOI21_foodcourt)	C++17	0 / 100	5 ms	8792 KiB

foodcourt

#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> tree;

    SegTree(int n)
    {
        while (n > size)
            size <<= 1;
        tree.resize(size << 1);
    }

    void update(int l, int r, int v, int x, int lx, int rx){
        if(l <= lx and rx <= r){
            tree[x] += v;
            return;
        }
        if(rx <= l or rx <= lx)
            return;
        int m = (lx + rx) >> 1;
        update(l, r, v, (x << 1) + 1, lx, m);
        update(l, r, v, (x << 1) + 2, m, rx);
    }

    void update(int l, int r, int v){
        return update(l, r, v, 0, 0, size);
    }

    int query(int l, int r, int x, int lx, int rx){
        if(l <= lx and rx <= r)
            return tree[x];
        if(rx <= l or r <= lx)
            return 0;
        int mid = (lx + rx) >> 1;
        return query(l, r, (x << 1) + 1, lx, mid) + query(l, r, (x << 1) + 2, mid, rx);
    }

    inline int query(int l, int r){
        return query(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.update(l, r, k);
            }
            else if(t == 2){
                int l, r, c, k;
                cin >> l >> r >> c >> k;
                l --;
                s.update(l, r, k);
            }
            else{
                int l, r;
                cin >> l >> r;
                cout << s.query(l - 1, r);
                if(i < q - 1)
                        cout << endl;
            }
        }
    }
}

signed main()
{
    fastio;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Compilation message (stderr)

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)
      |

• Subtask 1: 0 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 7
• Subtask 4: 0 / 21
• Subtask 5: 0 / 15
• Subtask 6: 0 / 13
• Subtask 7: 0 / 26
• Subtask 8: 0 / 11