oj.uz

Submission #752648

# Submission time Handle Problem Language Result Execution time Memory
752648 2023-06-03T11:16:55 Z Sam_a17 Food Court (JOI21_foodcourt) C++17
14 / 100
 1000 ms 315732 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};

long long ka() {
	long long x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}

// 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];

struct node {
  long long type;
  long long l, r, k, c;
};

vector<node> queries;

void solve_() {
  cin >> n >> m >> q;

  int oki = 1;
  for(int i = 0; i < q; i++) {
    int type; cin >> type;

    if(type == 1) {
      long long l, r, c, k; 
      cin >> l >> r >> c >> k;
      queries.push_back({type, l, r, k, c});
    } else if(type == 2) {
      long long l, r, k; cin >> l >> r >> k;
      queries.push_back({type, l, r, k, -1});
      oki = 0;
    } else {
      long long l, r; cin >> l >> r;
      queries.push_back({type, l, r, -1, -1});
    }
  }

  if(oki) {

  } else {
    long long it = 0, ok = 1;
    set<int> not_empty;
    vector<bool> have(n + 1);
    for(int t = 0; t < q; t++) {
      int type = queries[t].type;
      if(type == 1) {
        long long l, r, c, k;
        l = queries[t].l;
        r = queries[t].r;
        c = queries[t].c;
        k = queries[t].k;
        for(int i = l; i <= r; i++) {
          cnt[i] += k; 
          st[i].push_back({it, {c, k}});
          if(!have[i]) {
            have[i] = true;
            not_empty.insert(i);
          }
        }

        if(k != 1) ok = 0;
      } else if(type == 2) {
        long long l, r, k; 
        l = queries[t].l;
        r = queries[t].r;
        k = queries[t].k;
        if(k != 1) ok = 0;

        auto it = not_empty.lower_bound(l);
        vector<int> to_del;
        while(it != not_empty.end() && *it <= r) {
          int i = *it;
          if(ok) {
            if(!st[i].empty()) {
              st[i].pop_front();
            }  
          } else {
            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);
          if(cnt[i] == 0) {
            to_del.push_back(i);
          }
          it = next(it);
        }

        for(auto i: to_del) {
          have[i] = false;
          not_empty.erase(i);
        }

      } else {
        long long a, b; 
        // cin >> a >> b;
        a = queries[t].l;
        b = queries[t].r;

        if(cnt[a] < b) {
          cout << 0 << '\n';
        } else {
          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:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 165452 KB Output is correct
2 Correct 125 ms 166044 KB Output is correct
3 Correct 128 ms 175708 KB Output is correct
4 Correct 132 ms 181288 KB Output is correct
5 Correct 107 ms 164816 KB Output is correct
6 Correct 113 ms 164864 KB Output is correct
7 Correct 131 ms 183436 KB Output is correct
8 Correct 135 ms 176956 KB Output is correct
9 Correct 143 ms 166096 KB Output is correct
10 Correct 135 ms 176008 KB Output is correct
11 Correct 148 ms 172000 KB Output is correct
12 Correct 135 ms 166180 KB Output is correct
13 Correct 129 ms 166708 KB Output is correct
14 Correct 136 ms 168268 KB Output is correct
15 Correct 127 ms 168888 KB Output is correct
16 Correct 161 ms 166896 KB Output is correct
17 Correct 126 ms 165280 KB Output is correct
18 Correct 130 ms 165612 KB Output is correct
19 Correct 100 ms 164888 KB Output is correct
20 Correct 98 ms 164908 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 165452 KB Output is correct
2 Correct 125 ms 166044 KB Output is correct
3 Correct 128 ms 175708 KB Output is correct
4 Correct 132 ms 181288 KB Output is correct
5 Correct 107 ms 164816 KB Output is correct
6 Correct 113 ms 164864 KB Output is correct
7 Correct 131 ms 183436 KB Output is correct
8 Correct 135 ms 176956 KB Output is correct
9 Correct 143 ms 166096 KB Output is correct
10 Correct 135 ms 176008 KB Output is correct
11 Correct 148 ms 172000 KB Output is correct
12 Correct 135 ms 166180 KB Output is correct
13 Correct 129 ms 166708 KB Output is correct
14 Correct 136 ms 168268 KB Output is correct
15 Correct 127 ms 168888 KB Output is correct
16 Correct 161 ms 166896 KB Output is correct
17 Correct 126 ms 165280 KB Output is correct
18 Correct 130 ms 165612 KB Output is correct
19 Correct 100 ms 164888 KB Output is correct
20 Correct 98 ms 164908 KB Output is correct
21 Correct 126 ms 165848 KB Output is correct
22 Correct 143 ms 166240 KB Output is correct
23 Correct 124 ms 175932 KB Output is correct
24 Correct 134 ms 181436 KB Output is correct
25 Correct 99 ms 164860 KB Output is correct
26 Correct 110 ms 164808 KB Output is correct
27 Correct 144 ms 182864 KB Output is correct
28 Correct 139 ms 178064 KB Output is correct
29 Correct 136 ms 168796 KB Output is correct
30 Correct 145 ms 175848 KB Output is correct
31 Correct 142 ms 171824 KB Output is correct
32 Correct 140 ms 165976 KB Output is correct
33 Correct 147 ms 166568 KB Output is correct
34 Correct 161 ms 169112 KB Output is correct
35 Correct 135 ms 167376 KB Output is correct
36 Correct 170 ms 166928 KB Output is correct
37 Correct 100 ms 164872 KB Output is correct
38 Correct 119 ms 164924 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 168324 KB Output is correct
2 Correct 164 ms 168092 KB Output is correct
3 Correct 187 ms 168168 KB Output is correct
4 Correct 171 ms 168084 KB Output is correct
5 Correct 198 ms 168168 KB Output is correct
6 Correct 195 ms 168076 KB Output is correct
7 Correct 146 ms 167496 KB Output is correct
8 Correct 122 ms 167748 KB Output is correct
9 Correct 154 ms 169028 KB Output is correct
10 Correct 183 ms 169088 KB Output is correct
11 Correct 152 ms 169528 KB Output is correct
12 Correct 152 ms 169284 KB Output is correct
13 Correct 165 ms 168472 KB Output is correct
14 Correct 178 ms 169036 KB Output is correct
15 Correct 202 ms 169144 KB Output is correct
16 Correct 204 ms 169360 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 165452 KB Output is correct
2 Correct 125 ms 166044 KB Output is correct
3 Correct 128 ms 175708 KB Output is correct
4 Correct 132 ms 181288 KB Output is correct
5 Correct 107 ms 164816 KB Output is correct
6 Correct 113 ms 164864 KB Output is correct
7 Correct 131 ms 183436 KB Output is correct
8 Correct 135 ms 176956 KB Output is correct
9 Correct 143 ms 166096 KB Output is correct
10 Correct 135 ms 176008 KB Output is correct
11 Correct 148 ms 172000 KB Output is correct
12 Correct 135 ms 166180 KB Output is correct
13 Correct 129 ms 166708 KB Output is correct
14 Correct 136 ms 168268 KB Output is correct
15 Correct 127 ms 168888 KB Output is correct
16 Correct 161 ms 166896 KB Output is correct
17 Correct 126 ms 165280 KB Output is correct
18 Correct 130 ms 165612 KB Output is correct
19 Correct 100 ms 164888 KB Output is correct
20 Correct 98 ms 164908 KB Output is correct
21 Correct 155 ms 168324 KB Output is correct
22 Correct 164 ms 168092 KB Output is correct
23 Correct 187 ms 168168 KB Output is correct
24 Correct 171 ms 168084 KB Output is correct
25 Correct 198 ms 168168 KB Output is correct
26 Correct 195 ms 168076 KB Output is correct
27 Correct 146 ms 167496 KB Output is correct
28 Correct 122 ms 167748 KB Output is correct
29 Correct 154 ms 169028 KB Output is correct
30 Correct 183 ms 169088 KB Output is correct
31 Correct 152 ms 169528 KB Output is correct
32 Correct 152 ms 169284 KB Output is correct
33 Correct 165 ms 168472 KB Output is correct
34 Correct 178 ms 169036 KB Output is correct
35 Correct 202 ms 169144 KB Output is correct
36 Correct 204 ms 169360 KB Output is correct
37 Execution timed out 1083 ms 198316 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 168496 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 165452 KB Output is correct
2 Correct 125 ms 166044 KB Output is correct
3 Correct 128 ms 175708 KB Output is correct
4 Correct 132 ms 181288 KB Output is correct
5 Correct 107 ms 164816 KB Output is correct
6 Correct 113 ms 164864 KB Output is correct
7 Correct 131 ms 183436 KB Output is correct
8 Correct 135 ms 176956 KB Output is correct
9 Correct 143 ms 166096 KB Output is correct
10 Correct 135 ms 176008 KB Output is correct
11 Correct 148 ms 172000 KB Output is correct
12 Correct 135 ms 166180 KB Output is correct
13 Correct 129 ms 166708 KB Output is correct
14 Correct 136 ms 168268 KB Output is correct
15 Correct 127 ms 168888 KB Output is correct
16 Correct 161 ms 166896 KB Output is correct
17 Correct 126 ms 165280 KB Output is correct
18 Correct 130 ms 165612 KB Output is correct
19 Correct 100 ms 164888 KB Output is correct
20 Correct 98 ms 164908 KB Output is correct
21 Correct 126 ms 165848 KB Output is correct
22 Correct 143 ms 166240 KB Output is correct
23 Correct 124 ms 175932 KB Output is correct
24 Correct 134 ms 181436 KB Output is correct
25 Correct 99 ms 164860 KB Output is correct
26 Correct 110 ms 164808 KB Output is correct
27 Correct 144 ms 182864 KB Output is correct
28 Correct 139 ms 178064 KB Output is correct
29 Correct 136 ms 168796 KB Output is correct
30 Correct 145 ms 175848 KB Output is correct
31 Correct 142 ms 171824 KB Output is correct
32 Correct 140 ms 165976 KB Output is correct
33 Correct 147 ms 166568 KB Output is correct
34 Correct 161 ms 169112 KB Output is correct
35 Correct 135 ms 167376 KB Output is correct
36 Correct 170 ms 166928 KB Output is correct
37 Correct 100 ms 164872 KB Output is correct
38 Correct 119 ms 164924 KB Output is correct
39 Correct 155 ms 168324 KB Output is correct
40 Correct 164 ms 168092 KB Output is correct
41 Correct 187 ms 168168 KB Output is correct
42 Correct 171 ms 168084 KB Output is correct
43 Correct 198 ms 168168 KB Output is correct
44 Correct 195 ms 168076 KB Output is correct
45 Correct 146 ms 167496 KB Output is correct
46 Correct 122 ms 167748 KB Output is correct
47 Correct 154 ms 169028 KB Output is correct
48 Correct 183 ms 169088 KB Output is correct
49 Correct 152 ms 169528 KB Output is correct
50 Correct 152 ms 169284 KB Output is correct
51 Correct 165 ms 168472 KB Output is correct
52 Correct 178 ms 169036 KB Output is correct
53 Correct 202 ms 169144 KB Output is correct
54 Correct 204 ms 169360 KB Output is correct
55 Execution timed out 1083 ms 198316 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 165452 KB Output is correct
2 Correct 125 ms 166044 KB Output is correct
3 Correct 128 ms 175708 KB Output is correct
4 Correct 132 ms 181288 KB Output is correct
5 Correct 107 ms 164816 KB Output is correct
6 Correct 113 ms 164864 KB Output is correct
7 Correct 131 ms 183436 KB Output is correct
8 Correct 135 ms 176956 KB Output is correct
9 Correct 143 ms 166096 KB Output is correct
10 Correct 135 ms 176008 KB Output is correct
11 Correct 148 ms 172000 KB Output is correct
12 Correct 135 ms 166180 KB Output is correct
13 Correct 129 ms 166708 KB Output is correct
14 Correct 136 ms 168268 KB Output is correct
15 Correct 127 ms 168888 KB Output is correct
16 Correct 161 ms 166896 KB Output is correct
17 Correct 126 ms 165280 KB Output is correct
18 Correct 130 ms 165612 KB Output is correct
19 Correct 100 ms 164888 KB Output is correct
20 Correct 98 ms 164908 KB Output is correct
21 Correct 126 ms 165848 KB Output is correct
22 Correct 143 ms 166240 KB Output is correct
23 Correct 124 ms 175932 KB Output is correct
24 Correct 134 ms 181436 KB Output is correct
25 Correct 99 ms 164860 KB Output is correct
26 Correct 110 ms 164808 KB Output is correct
27 Correct 144 ms 182864 KB Output is correct
28 Correct 139 ms 178064 KB Output is correct
29 Correct 136 ms 168796 KB Output is correct
30 Correct 145 ms 175848 KB Output is correct
31 Correct 142 ms 171824 KB Output is correct
32 Correct 140 ms 165976 KB Output is correct
33 Correct 147 ms 166568 KB Output is correct
34 Correct 161 ms 169112 KB Output is correct
35 Correct 135 ms 167376 KB Output is correct
36 Correct 170 ms 166928 KB Output is correct
37 Correct 100 ms 164872 KB Output is correct
38 Correct 119 ms 164924 KB Output is correct
39 Correct 155 ms 168324 KB Output is correct
40 Correct 164 ms 168092 KB Output is correct
41 Correct 187 ms 168168 KB Output is correct
42 Correct 171 ms 168084 KB Output is correct
43 Correct 198 ms 168168 KB Output is correct
44 Correct 195 ms 168076 KB Output is correct
45 Correct 146 ms 167496 KB Output is correct
46 Correct 122 ms 167748 KB Output is correct
47 Correct 154 ms 169028 KB Output is correct
48 Correct 183 ms 169088 KB Output is correct
49 Correct 152 ms 169528 KB Output is correct
50 Correct 152 ms 169284 KB Output is correct
51 Correct 165 ms 168472 KB Output is correct
52 Correct 178 ms 169036 KB Output is correct
53 Correct 202 ms 169144 KB Output is correct
54 Correct 204 ms 169360 KB Output is correct
55 Execution timed out 1087 ms 315732 KB Time limit exceeded
56 Halted 0 ms 0 KB -