Submission #394126

#	Time	Username	Problem	Language	Result	Execution time	Memory
394126		usachevd0	Food Court (JOI21_foodcourt)	C++14	7 / 100	1092 ms	4980 KiB

foodcourt

#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1& x, T2 y) {
  return y < x ? (x = y, true) : false;
}
template<typename T1, typename T2> bool chkmax(T1& x, T2 y) {
  return y > x ? (x = y, true) : false;
}
void debug_out() {
  cerr << endl;
}
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) {
  cerr << ' ' << A;
  debug_out(B...);
}
template<typename T> void mdebug_out(T* a, int n) {
  for (int i = 0; i < n; ++i) cerr << a[i];
  cerr << endl;
}
template<typename T> ostream& operator << (ostream& stream, const vector<T>& v) {
  for (auto& x : v) {
    stream << x << ' ';
  }
  return stream;
}
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) {
  return stream << p.first << ' ' << p.second;
}

#ifdef DEBUG
  #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
  #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
  #define debug(...) 1337
  #define mdebug(a, n) 1337
#endif

const int maxN = 250005;
int N, M, Q;

namespace sgt1 {
  ll sz[maxN];
  ll rem[maxN];
}

struct Query1 {
  int l, r, c, k;
  
  Query1() {}

  void read() {
    cin >> l >> r >> c >> k;
  }
} qr1[maxN];
int qr1_t[maxN];
struct Query3 {
  int i;
  ll k;
} qr3[maxN];


int32_t main() {
#ifdef DEBUG
  freopen("in", "r", stdin);
#endif
  ios::sync_with_stdio(0);
  cin.tie(0);

  cin >> N >> M >> Q;
  int T = 0;
  int Q1 = 0;
  for (int qi = 0; qi < Q; ++qi) {
    int tp;
    cin >> tp;
    if (tp == 1) {
      auto& q = qr1[Q1];
      q.read();
      qr1_t[Q1++] = T;

      for (int i = q.l; i <= q.r; ++i) {
        sgt1::sz[i] += q.k;
        sgt1::rem[i] += q.k;
      } 
    } else if (tp == 2) {
      int l, r, k;
      cin >> l >> r >> k;
      for (int i = l; i <= r; ++i) {
        sgt1::rem[i] -= k;
        chkmax(sgt1::rem[i], 0);
      }
    } else {
      auto& q = qr3[T++];
      cin >> q.i >> q.k;
      --q.k;
      q.k += (sgt1::sz[q.i] - sgt1::rem[q.i]);
    }
  }
  for (int i = 0; i < T; ++i) {
    auto& q = qr3[i];
    ll k = q.k;
    for (int j = 0; j < Q1 && qr1_t[j] <= i; ++j) {
      auto& y = qr1[j];
      if (y.l <= q.i && q.i <= y.r) {
        if ((k -= y.k) < 0) {
          cout << y.c << '\n';
          break;
        }
      }
    }
    if (k >= 0) {
      cout << "0\n";
    }
  }

  return 0;
}

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