oj.uz

Submission #752622

# Submission time Handle Problem Language Result Execution time Memory
752622 2023-06-03T10:18:12 Z Sam_a17 Food Court (JOI21_foodcourt) C++17
2 / 100
 1000 ms 337280 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 250005;
long long n, m, q;
deque<pair<long long, pair<long long, long long>>> st[N];
long long cnt[N];

void solve_() {
  cin >> n >> m >> q;
  
  long long it = 0, ok = 1;
  while(q--) {
    int type; cin >> type;
    if(type == 1) {
      long long l, r, c, k; cin >> l >> r >> c >> k;
      for(int i = l; i <= r; i++) {
        cnt[i] += k; 
        st[i].push_back({it, {c, k}});
      }

      if(k != 1) ok = 0;
    } else if(type == 2) {
      long long l, r, k; cin >> l >> r >> k;
      for(int i = l; i <= r; i++) {
        long long curr = k;
        while(!st[i].empty()) {
          if(curr >= st[i].front().second.second) {
            curr -= st[i].front().second.second;
            st[i].pop_front();
          } else {
            st[i].front().second.second -= curr;
            break;
          }
        }
        cnt[i] -= k;
        cnt[i] = max(cnt[i], 0ll);
      }
    } else {
      long long a, b; cin >> a >> b;
      if(cnt[a] < b) {
        cout << 0 << '\n';
        continue;
      }

      assert(ok == 1);
      if(ok) {
        cout << st[a][b - 1].second.first << '\n';
      } else {
        for(int i = 0; i < sz(st[a]); i++) {
          if(b > st[a][i].second.second) {
            b -= st[a][i].second.second;
          } else {
            cout << st[a][i].second.first << '\n';
            break;
          }
        }
      }
    }
    it++;
  }
}
 
int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

foodcourt.cpp: In function 'void setIO(std::string)':
foodcourt.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 165224 KB Output is correct
2 Correct 129 ms 165856 KB Output is correct
3 Correct 116 ms 175416 KB Output is correct
4 Correct 128 ms 181076 KB Output is correct
5 Correct 109 ms 164684 KB Output is correct
6 Correct 93 ms 164612 KB Output is correct
7 Correct 125 ms 183228 KB Output is correct
8 Correct 126 ms 176816 KB Output is correct
9 Correct 127 ms 165900 KB Output is correct
10 Correct 120 ms 175876 KB Output is correct
11 Correct 125 ms 171748 KB Output is correct
12 Correct 127 ms 166060 KB Output is correct
13 Correct 119 ms 166516 KB Output is correct
14 Correct 128 ms 168048 KB Output is correct
15 Correct 123 ms 168696 KB Output is correct
16 Correct 127 ms 166712 KB Output is correct
17 Correct 116 ms 165072 KB Output is correct
18 Correct 120 ms 165456 KB Output is correct
19 Correct 97 ms 164684 KB Output is correct
20 Correct 95 ms 164636 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 165224 KB Output is correct
2 Correct 129 ms 165856 KB Output is correct
3 Correct 116 ms 175416 KB Output is correct
4 Correct 128 ms 181076 KB Output is correct
5 Correct 109 ms 164684 KB Output is correct
6 Correct 93 ms 164612 KB Output is correct
7 Correct 125 ms 183228 KB Output is correct
8 Correct 126 ms 176816 KB Output is correct
9 Correct 127 ms 165900 KB Output is correct
10 Correct 120 ms 175876 KB Output is correct
11 Correct 125 ms 171748 KB Output is correct
12 Correct 127 ms 166060 KB Output is correct
13 Correct 119 ms 166516 KB Output is correct
14 Correct 128 ms 168048 KB Output is correct
15 Correct 123 ms 168696 KB Output is correct
16 Correct 127 ms 166712 KB Output is correct
17 Correct 116 ms 165072 KB Output is correct
18 Correct 120 ms 165456 KB Output is correct
19 Correct 97 ms 164684 KB Output is correct
20 Correct 95 ms 164636 KB Output is correct
21 Runtime error 218 ms 333824 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 980 ms 165388 KB Output is correct
2 Correct 741 ms 166376 KB Output is correct
3 Correct 944 ms 166732 KB Output is correct
4 Correct 961 ms 166380 KB Output is correct
5 Correct 697 ms 166608 KB Output is correct
6 Correct 705 ms 166528 KB Output is correct
7 Correct 110 ms 165440 KB Output is correct
8 Correct 113 ms 165524 KB Output is correct
9 Execution timed out 1091 ms 166380 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 244 ms 337280 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 165224 KB Output is correct
2 Correct 129 ms 165856 KB Output is correct
3 Correct 116 ms 175416 KB Output is correct
4 Correct 128 ms 181076 KB Output is correct
5 Correct 109 ms 164684 KB Output is correct
6 Correct 93 ms 164612 KB Output is correct
7 Correct 125 ms 183228 KB Output is correct
8 Correct 126 ms 176816 KB Output is correct
9 Correct 127 ms 165900 KB Output is correct
10 Correct 120 ms 175876 KB Output is correct
11 Correct 125 ms 171748 KB Output is correct
12 Correct 127 ms 166060 KB Output is correct
13 Correct 119 ms 166516 KB Output is correct
14 Correct 128 ms 168048 KB Output is correct
15 Correct 123 ms 168696 KB Output is correct
16 Correct 127 ms 166712 KB Output is correct
17 Correct 116 ms 165072 KB Output is correct
18 Correct 120 ms 165456 KB Output is correct
19 Correct 97 ms 164684 KB Output is correct
20 Correct 95 ms 164636 KB Output is correct
21 Correct 980 ms 165388 KB Output is correct
22 Correct 741 ms 166376 KB Output is correct
23 Correct 944 ms 166732 KB Output is correct
24 Correct 961 ms 166380 KB Output is correct
25 Correct 697 ms 166608 KB Output is correct
26 Correct 705 ms 166528 KB Output is correct
27 Correct 110 ms 165440 KB Output is correct
28 Correct 113 ms 165524 KB Output is correct
29 Execution timed out 1091 ms 166380 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 217 ms 334792 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 165224 KB Output is correct
2 Correct 129 ms 165856 KB Output is correct
3 Correct 116 ms 175416 KB Output is correct
4 Correct 128 ms 181076 KB Output is correct
5 Correct 109 ms 164684 KB Output is correct
6 Correct 93 ms 164612 KB Output is correct
7 Correct 125 ms 183228 KB Output is correct
8 Correct 126 ms 176816 KB Output is correct
9 Correct 127 ms 165900 KB Output is correct
10 Correct 120 ms 175876 KB Output is correct
11 Correct 125 ms 171748 KB Output is correct
12 Correct 127 ms 166060 KB Output is correct
13 Correct 119 ms 166516 KB Output is correct
14 Correct 128 ms 168048 KB Output is correct
15 Correct 123 ms 168696 KB Output is correct
16 Correct 127 ms 166712 KB Output is correct
17 Correct 116 ms 165072 KB Output is correct
18 Correct 120 ms 165456 KB Output is correct
19 Correct 97 ms 164684 KB Output is correct
20 Correct 95 ms 164636 KB Output is correct
21 Runtime error 218 ms 333824 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 165224 KB Output is correct
2 Correct 129 ms 165856 KB Output is correct
3 Correct 116 ms 175416 KB Output is correct
4 Correct 128 ms 181076 KB Output is correct
5 Correct 109 ms 164684 KB Output is correct
6 Correct 93 ms 164612 KB Output is correct
7 Correct 125 ms 183228 KB Output is correct
8 Correct 126 ms 176816 KB Output is correct
9 Correct 127 ms 165900 KB Output is correct
10 Correct 120 ms 175876 KB Output is correct
11 Correct 125 ms 171748 KB Output is correct
12 Correct 127 ms 166060 KB Output is correct
13 Correct 119 ms 166516 KB Output is correct
14 Correct 128 ms 168048 KB Output is correct
15 Correct 123 ms 168696 KB Output is correct
16 Correct 127 ms 166712 KB Output is correct
17 Correct 116 ms 165072 KB Output is correct
18 Correct 120 ms 165456 KB Output is correct
19 Correct 97 ms 164684 KB Output is correct
20 Correct 95 ms 164636 KB Output is correct
21 Runtime error 218 ms 333824 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -