Submission #1138408

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1138408	2025-01-22 11:25:19	duckindog	Food Court (JOI21_foodcourt)	C++17	2 / 100	484 ms	66700 KiB

foodcourt

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
const int N = 250'000 + 10;
int n, m, q;
namespace IT1 { 
  std::vector<long long> lazy[N << 2];
  void shrink(int s) { 
    while (lazy[s].size() >= 2) { 
      if (lazy[s].back() <= 0) { 
        lazy[s].end()[-2] += lazy[s].back();
        lazy[s].pop_back();
        continue;
      }
      if (lazy[s].back() > 0 && lazy[s].end()[-2] >= 0) { 
        lazy[s].end()[-2] += lazy[s].back();
        lazy[s].pop_back();
        continue;
      }
      break;
    }
    if (lazy[s].size() && lazy[s].back() == 0) lazy[s].pop_back();
  }
  void push(int s) { 
    if (!lazy[s].size()) return;
    for (const auto& x : lazy[s]) { 
      lazy[s << 1].push_back(x);    lazy[s << 1 | 1].push_back(x);
      shrink(s << 1);               shrink(s << 1 | 1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 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