제출 #1340145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1340145		avighna	푸드 코트 (JOI21_foodcourt)	C++20	2 / 100	1083 ms	589824 KiB

foodcourt

#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n, m, q;
  cin >> n >> m >> q;

  // {num, group}
  vector<deque<int>> shops(n);

  auto leave = [&](deque<int> &a, int64_t k) {
    for (int i = 0; !a.empty() && i < k; ++i) {
      a.pop_front();
    }
  };

  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int64_t l, r, c, k;
      cin >> l >> r >> c >> k;
      --l, --r;
      for (int i = l; i <= r; ++i) {
        for (int j = 0; j < k; ++j) {
          shops[i].push_back(c);
        }
      }
    } else if (t == 2) {
      int64_t l, r, k;
      cin >> l >> r >> k;
      --l, --r;
      for (int i = l; i <= r; ++i) {
        leave(shops[i], k);
      }
    } else {
      int64_t a, b;
      cin >> a >> b;
      --a, --b;
      int64_t sz = 0;
      int found = 0;
      if (b >= shops[a].size()) {
        cout << "0\n";
      } else {
        cout << shops[a][b] << '\n';
      }
    }
  }
}

• 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