oj.uz

Submission #930802

# Submission time Handle Problem Language Result Execution time Memory
930802 2024-02-20T12:34:02 Z boris_mihov Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 76532 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 250000 + 10;
const llong INF = 1e18;

int n, m, q;
struct SegmentTree
{
    struct Node
    {
        llong minPrefix;
        llong maxSuffix;
        llong sumPositive;
        llong sumNegative;
        llong sum;
        int c;

        Node()
        {
            maxSuffix = minPrefix = sumPositive = sumNegative = sum = c = 0;
        }   

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.sum = left.sum + right.sum;
            res.sumPositive = left.sumPositive + right.sumPositive;
            res.sumNegative = left.sumNegative + right.sumNegative;
            res.minPrefix = std::min(left.minPrefix, left.sum + right.minPrefix);
            res.maxSuffix = std::max(right.maxSuffix, right.sum + left.maxSuffix);
            res.c = std::max(left.c, right.c);
            return res;
        }
    };

    Node tree[4*MAXN];
    void update(int l, int r, int node, int queryPos, int queryVal, int queryC, bool queryType)
    {
        if (l == r)
        {
            tree[node].c = queryC;
            if (queryType == true)
            {
                tree[node].sum = queryVal;
                tree[node].sumNegative = 0;
                tree[node].sumPositive = queryVal;
            } else
            {
                tree[node].sum = -queryVal;
                tree[node].sumPositive = 0;
                tree[node].sumNegative = queryVal;
            }

            tree[node].minPrefix = std::min(0LL, tree[node].sum);
            tree[node].maxSuffix = std::max(0LL, tree[node].sum);
            return;
        }

        int mid = (l + r) / 2;
        if (queryPos <= mid) update(l, mid, 2*node, queryPos, queryVal, queryC, queryType);
        else update(mid + 1, r, 2*node + 1, queryPos, queryVal, queryC, queryType);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    Node query(int l, int r, int node, int queryL, int queryR)
    {
        if (queryL <= l && r <= queryR)
        {
            return tree[node];
        }

        Node res;
        int mid = (l + r) / 2;
        if (queryL <= mid) res = res + query(l, mid, 2*node, queryL, queryR);
        if (mid + 1 <= queryR) res = res + query(mid + 1, r, 2*node + 1, queryL, queryR);
        return res;
    }

    llong find(int l, int r, int node, int queryL, int queryR, llong k)
    {
        if (queryR < l || r < queryL)
        {
            return 0;
        }

        if (queryL <= l && r <= queryR && tree[node].sumPositive < k)
        {
            return -tree[node].sumPositive;
        }

        if (l == r)
        {
            return tree[node].c;
        }

        int mid = (l + r) / 2;
        llong res = find(l, mid, 2*node, queryL, queryR, k);
        if (res > 0) return res;
        llong res2 = find(mid + 1, r, 2*node + 1, queryL, queryR, k + res);
        if (res2 > 0) return res2;
        else return res + res2;
    }

    void update(int pos, int val, int c, bool type)
    {
        update(1, q, 1, pos, val, c, type);
    }

    Node query(int l, int r)
    {
        return query(1, q, 1, l, r);
    }

    int find(int l, int r, llong k)
    {
        return find(1, q, 1, l, r, k);
    }
};

struct QueryAsk
{
    int time;
    llong val;
    int idx;
};

struct QueryAdd
{
    bool type;
    int val;
    int c;
    int idx;
};

int cntServices;
std::vector <QueryAdd> activate[MAXN];
std::vector <QueryAdd> deactivate[MAXN];
std::vector <QueryAsk> v[MAXN];
SegmentTree tree;
int answer[MAXN];

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (const QueryAdd query : activate[i])
        {
            tree.update(query.idx, query.val, query.c, query.type);
        }

        for (const QueryAdd query : deactivate[i])
        {
            tree.update(query.idx, 0, 0, false);
        }

        for (const auto &[time, val, idx] : v[i])
        {
            int l = 0, r = time + 1, mid;
            while (l < r - 1)
            {
                mid = (l + r) / 2;
                llong res = tree.query(mid, time).minPrefix;
                if (mid > 1) res += tree.query(1, mid - 1).maxSuffix;
                if (res >= 0) r = mid;
                else l = mid;
            }
            // for (int idx = 1 ; idx <= time ; ++idx)
            // {
            //     if (tree.query(idx, time).minPrefix >= 0)
            //     {
            //         r = idx;
            //         break;
            //     }
            // }

            if (r > time)
            {
                answer[idx] = 0;
                continue;
            }
            
            llong cntPositive = tree.query(r, time).sumPositive;
            llong cntNegative = tree.query(r, time).sumNegative;

            if (val + cntNegative > cntPositive) answer[idx] = 0;
            else answer[idx] = tree.find(r, time, val + cntNegative);
        }
    }
}

void input()
{
    std::cin >> n >> m >> q;
    for (int i = 1 ; i <= q ; ++i)
    {
        int qType;
        std::cin >> qType;
        if (qType == 1)
        {
            int l, r, c, val;
            std::cin >> l >> r >> c >> val;
            activate[l].push_back({true, val, c, i});
            deactivate[r + 1].push_back({true, val, c, i});
            continue;
        }

        if (qType == 2)
        {
            int l, r, c, val;
            std::cin >> l >> r >> val;
            activate[l].push_back({false, val, 0, i});
            deactivate[r + 1].push_back({false, val, 0, i});
            continue;
        }

        assert(qType == 3);
        int pos;
        llong k;
        std::cin >> pos >> k;
        v[pos].push_back({i, k, ++cntServices});
    }
}

void print()
{
    for (int i = 1 ; i <= cntServices ; ++i)
    {
        std::cout << answer[i] << '\n';
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();
    print();

    return 0;
}

Compilation message

foodcourt.cpp: In function 'void input()':
foodcourt.cpp:214:23: warning: unused variable 'c' [-Wunused-variable]
  214 |             int l, r, c, val;
      |                       ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 65924 KB Output is correct
2 Correct 18 ms 65796 KB Output is correct
3 Correct 15 ms 65880 KB Output is correct
4 Correct 17 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 16 ms 65884 KB Output is correct
7 Correct 16 ms 65740 KB Output is correct
8 Correct 17 ms 65948 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 17 ms 65880 KB Output is correct
11 Correct 18 ms 65884 KB Output is correct
12 Correct 17 ms 65884 KB Output is correct
13 Correct 16 ms 65884 KB Output is correct
14 Correct 17 ms 65884 KB Output is correct
15 Correct 16 ms 65884 KB Output is correct
16 Correct 18 ms 65736 KB Output is correct
17 Correct 16 ms 65884 KB Output is correct
18 Correct 16 ms 65884 KB Output is correct
19 Correct 16 ms 65884 KB Output is correct
20 Correct 15 ms 65856 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 65924 KB Output is correct
2 Correct 18 ms 65796 KB Output is correct
3 Correct 15 ms 65880 KB Output is correct
4 Correct 17 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 16 ms 65884 KB Output is correct
7 Correct 16 ms 65740 KB Output is correct
8 Correct 17 ms 65948 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 17 ms 65880 KB Output is correct
11 Correct 18 ms 65884 KB Output is correct
12 Correct 17 ms 65884 KB Output is correct
13 Correct 16 ms 65884 KB Output is correct
14 Correct 17 ms 65884 KB Output is correct
15 Correct 16 ms 65884 KB Output is correct
16 Correct 18 ms 65736 KB Output is correct
17 Correct 16 ms 65884 KB Output is correct
18 Correct 16 ms 65884 KB Output is correct
19 Correct 16 ms 65884 KB Output is correct
20 Correct 15 ms 65856 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 18 ms 65884 KB Output is correct
23 Correct 17 ms 65796 KB Output is correct
24 Correct 17 ms 65880 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 16 ms 66136 KB Output is correct
27 Correct 18 ms 65884 KB Output is correct
28 Correct 17 ms 65716 KB Output is correct
29 Correct 16 ms 65812 KB Output is correct
30 Correct 16 ms 65880 KB Output is correct
31 Correct 18 ms 65884 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 17 ms 66136 KB Output is correct
34 Correct 17 ms 65920 KB Output is correct
35 Correct 17 ms 65884 KB Output is correct
36 Correct 18 ms 65800 KB Output is correct
37 Correct 15 ms 65800 KB Output is correct
38 Correct 16 ms 65880 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 69000 KB Output is correct
2 Correct 189 ms 69076 KB Output is correct
3 Correct 213 ms 68944 KB Output is correct
4 Correct 234 ms 68980 KB Output is correct
5 Correct 189 ms 69068 KB Output is correct
6 Correct 180 ms 69072 KB Output is correct
7 Correct 166 ms 68000 KB Output is correct
8 Correct 166 ms 68292 KB Output is correct
9 Correct 188 ms 69040 KB Output is correct
10 Correct 180 ms 69040 KB Output is correct
11 Correct 187 ms 68868 KB Output is correct
12 Correct 178 ms 69048 KB Output is correct
13 Correct 200 ms 68620 KB Output is correct
14 Correct 226 ms 69000 KB Output is correct
15 Correct 141 ms 68948 KB Output is correct
16 Correct 141 ms 69136 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 76532 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 65924 KB Output is correct
2 Correct 18 ms 65796 KB Output is correct
3 Correct 15 ms 65880 KB Output is correct
4 Correct 17 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 16 ms 65884 KB Output is correct
7 Correct 16 ms 65740 KB Output is correct
8 Correct 17 ms 65948 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 17 ms 65880 KB Output is correct
11 Correct 18 ms 65884 KB Output is correct
12 Correct 17 ms 65884 KB Output is correct
13 Correct 16 ms 65884 KB Output is correct
14 Correct 17 ms 65884 KB Output is correct
15 Correct 16 ms 65884 KB Output is correct
16 Correct 18 ms 65736 KB Output is correct
17 Correct 16 ms 65884 KB Output is correct
18 Correct 16 ms 65884 KB Output is correct
19 Correct 16 ms 65884 KB Output is correct
20 Correct 15 ms 65856 KB Output is correct
21 Correct 256 ms 69000 KB Output is correct
22 Correct 189 ms 69076 KB Output is correct
23 Correct 213 ms 68944 KB Output is correct
24 Correct 234 ms 68980 KB Output is correct
25 Correct 189 ms 69068 KB Output is correct
26 Correct 180 ms 69072 KB Output is correct
27 Correct 166 ms 68000 KB Output is correct
28 Correct 166 ms 68292 KB Output is correct
29 Correct 188 ms 69040 KB Output is correct
30 Correct 180 ms 69040 KB Output is correct
31 Correct 187 ms 68868 KB Output is correct
32 Correct 178 ms 69048 KB Output is correct
33 Correct 200 ms 68620 KB Output is correct
34 Correct 226 ms 69000 KB Output is correct
35 Correct 141 ms 68948 KB Output is correct
36 Correct 141 ms 69136 KB Output is correct
37 Correct 220 ms 68688 KB Output is correct
38 Correct 159 ms 68420 KB Output is correct
39 Correct 127 ms 67596 KB Output is correct
40 Correct 150 ms 68560 KB Output is correct
41 Correct 190 ms 68948 KB Output is correct
42 Correct 191 ms 68824 KB Output is correct
43 Correct 216 ms 68988 KB Output is correct
44 Correct 207 ms 68956 KB Output is correct
45 Correct 209 ms 68956 KB Output is correct
46 Correct 217 ms 69204 KB Output is correct
47 Correct 213 ms 67908 KB Output is correct
48 Correct 238 ms 68964 KB Output is correct
49 Correct 123 ms 67928 KB Output is correct
50 Correct 148 ms 68444 KB Output is correct
51 Correct 178 ms 68948 KB Output is correct
52 Correct 187 ms 69028 KB Output is correct
53 Correct 115 ms 68444 KB Output is correct
54 Correct 151 ms 69136 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 68476 KB Output is correct
2 Correct 297 ms 68680 KB Output is correct
3 Correct 312 ms 68872 KB Output is correct
4 Correct 205 ms 67924 KB Output is correct
5 Correct 261 ms 68436 KB Output is correct
6 Correct 302 ms 68752 KB Output is correct
7 Correct 218 ms 67840 KB Output is correct
8 Correct 208 ms 67540 KB Output is correct
9 Correct 293 ms 68016 KB Output is correct
10 Correct 196 ms 67920 KB Output is correct
11 Correct 301 ms 68388 KB Output is correct
12 Correct 292 ms 68412 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 65924 KB Output is correct
2 Correct 18 ms 65796 KB Output is correct
3 Correct 15 ms 65880 KB Output is correct
4 Correct 17 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 16 ms 65884 KB Output is correct
7 Correct 16 ms 65740 KB Output is correct
8 Correct 17 ms 65948 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 17 ms 65880 KB Output is correct
11 Correct 18 ms 65884 KB Output is correct
12 Correct 17 ms 65884 KB Output is correct
13 Correct 16 ms 65884 KB Output is correct
14 Correct 17 ms 65884 KB Output is correct
15 Correct 16 ms 65884 KB Output is correct
16 Correct 18 ms 65736 KB Output is correct
17 Correct 16 ms 65884 KB Output is correct
18 Correct 16 ms 65884 KB Output is correct
19 Correct 16 ms 65884 KB Output is correct
20 Correct 15 ms 65856 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 18 ms 65884 KB Output is correct
23 Correct 17 ms 65796 KB Output is correct
24 Correct 17 ms 65880 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 16 ms 66136 KB Output is correct
27 Correct 18 ms 65884 KB Output is correct
28 Correct 17 ms 65716 KB Output is correct
29 Correct 16 ms 65812 KB Output is correct
30 Correct 16 ms 65880 KB Output is correct
31 Correct 18 ms 65884 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 17 ms 66136 KB Output is correct
34 Correct 17 ms 65920 KB Output is correct
35 Correct 17 ms 65884 KB Output is correct
36 Correct 18 ms 65800 KB Output is correct
37 Correct 15 ms 65800 KB Output is correct
38 Correct 16 ms 65880 KB Output is correct
39 Correct 256 ms 69000 KB Output is correct
40 Correct 189 ms 69076 KB Output is correct
41 Correct 213 ms 68944 KB Output is correct
42 Correct 234 ms 68980 KB Output is correct
43 Correct 189 ms 69068 KB Output is correct
44 Correct 180 ms 69072 KB Output is correct
45 Correct 166 ms 68000 KB Output is correct
46 Correct 166 ms 68292 KB Output is correct
47 Correct 188 ms 69040 KB Output is correct
48 Correct 180 ms 69040 KB Output is correct
49 Correct 187 ms 68868 KB Output is correct
50 Correct 178 ms 69048 KB Output is correct
51 Correct 200 ms 68620 KB Output is correct
52 Correct 226 ms 69000 KB Output is correct
53 Correct 141 ms 68948 KB Output is correct
54 Correct 141 ms 69136 KB Output is correct
55 Correct 220 ms 68688 KB Output is correct
56 Correct 159 ms 68420 KB Output is correct
57 Correct 127 ms 67596 KB Output is correct
58 Correct 150 ms 68560 KB Output is correct
59 Correct 190 ms 68948 KB Output is correct
60 Correct 191 ms 68824 KB Output is correct
61 Correct 216 ms 68988 KB Output is correct
62 Correct 207 ms 68956 KB Output is correct
63 Correct 209 ms 68956 KB Output is correct
64 Correct 217 ms 69204 KB Output is correct
65 Correct 213 ms 67908 KB Output is correct
66 Correct 238 ms 68964 KB Output is correct
67 Correct 123 ms 67928 KB Output is correct
68 Correct 148 ms 68444 KB Output is correct
69 Correct 178 ms 68948 KB Output is correct
70 Correct 187 ms 69028 KB Output is correct
71 Correct 115 ms 68444 KB Output is correct
72 Correct 151 ms 69136 KB Output is correct
73 Correct 274 ms 68476 KB Output is correct
74 Correct 297 ms 68680 KB Output is correct
75 Correct 312 ms 68872 KB Output is correct
76 Correct 205 ms 67924 KB Output is correct
77 Correct 261 ms 68436 KB Output is correct
78 Correct 302 ms 68752 KB Output is correct
79 Correct 218 ms 67840 KB Output is correct
80 Correct 208 ms 67540 KB Output is correct
81 Correct 293 ms 68016 KB Output is correct
82 Correct 196 ms 67920 KB Output is correct
83 Correct 301 ms 68388 KB Output is correct
84 Correct 292 ms 68412 KB Output is correct
85 Correct 242 ms 68688 KB Output is correct
86 Correct 258 ms 69056 KB Output is correct
87 Correct 164 ms 68444 KB Output is correct
88 Correct 200 ms 68948 KB Output is correct
89 Correct 144 ms 68180 KB Output is correct
90 Correct 196 ms 68968 KB Output is correct
91 Correct 177 ms 68588 KB Output is correct
92 Correct 156 ms 68176 KB Output is correct
93 Correct 205 ms 68980 KB Output is correct
94 Correct 204 ms 68972 KB Output is correct
95 Correct 201 ms 68856 KB Output is correct
96 Correct 214 ms 68944 KB Output is correct
97 Correct 204 ms 68972 KB Output is correct
98 Correct 196 ms 68692 KB Output is correct
99 Correct 216 ms 67976 KB Output is correct
100 Correct 195 ms 68176 KB Output is correct
101 Correct 250 ms 69196 KB Output is correct
102 Correct 147 ms 69252 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 65924 KB Output is correct
2 Correct 18 ms 65796 KB Output is correct
3 Correct 15 ms 65880 KB Output is correct
4 Correct 17 ms 65880 KB Output is correct
5 Correct 15 ms 65884 KB Output is correct
6 Correct 16 ms 65884 KB Output is correct
7 Correct 16 ms 65740 KB Output is correct
8 Correct 17 ms 65948 KB Output is correct
9 Correct 16 ms 65884 KB Output is correct
10 Correct 17 ms 65880 KB Output is correct
11 Correct 18 ms 65884 KB Output is correct
12 Correct 17 ms 65884 KB Output is correct
13 Correct 16 ms 65884 KB Output is correct
14 Correct 17 ms 65884 KB Output is correct
15 Correct 16 ms 65884 KB Output is correct
16 Correct 18 ms 65736 KB Output is correct
17 Correct 16 ms 65884 KB Output is correct
18 Correct 16 ms 65884 KB Output is correct
19 Correct 16 ms 65884 KB Output is correct
20 Correct 15 ms 65856 KB Output is correct
21 Correct 17 ms 65880 KB Output is correct
22 Correct 18 ms 65884 KB Output is correct
23 Correct 17 ms 65796 KB Output is correct
24 Correct 17 ms 65880 KB Output is correct
25 Correct 15 ms 65884 KB Output is correct
26 Correct 16 ms 66136 KB Output is correct
27 Correct 18 ms 65884 KB Output is correct
28 Correct 17 ms 65716 KB Output is correct
29 Correct 16 ms 65812 KB Output is correct
30 Correct 16 ms 65880 KB Output is correct
31 Correct 18 ms 65884 KB Output is correct
32 Correct 16 ms 65884 KB Output is correct
33 Correct 17 ms 66136 KB Output is correct
34 Correct 17 ms 65920 KB Output is correct
35 Correct 17 ms 65884 KB Output is correct
36 Correct 18 ms 65800 KB Output is correct
37 Correct 15 ms 65800 KB Output is correct
38 Correct 16 ms 65880 KB Output is correct
39 Correct 256 ms 69000 KB Output is correct
40 Correct 189 ms 69076 KB Output is correct
41 Correct 213 ms 68944 KB Output is correct
42 Correct 234 ms 68980 KB Output is correct
43 Correct 189 ms 69068 KB Output is correct
44 Correct 180 ms 69072 KB Output is correct
45 Correct 166 ms 68000 KB Output is correct
46 Correct 166 ms 68292 KB Output is correct
47 Correct 188 ms 69040 KB Output is correct
48 Correct 180 ms 69040 KB Output is correct
49 Correct 187 ms 68868 KB Output is correct
50 Correct 178 ms 69048 KB Output is correct
51 Correct 200 ms 68620 KB Output is correct
52 Correct 226 ms 69000 KB Output is correct
53 Correct 141 ms 68948 KB Output is correct
54 Correct 141 ms 69136 KB Output is correct
55 Execution timed out 1066 ms 76532 KB Time limit exceeded
56 Halted 0 ms 0 KB -