oj.uz

답안 #752664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752664 2023-06-03T11:46:22 Z Sam_a17 푸드 코트 (JOI21_foodcourt) C++17
14 / 100
 1000 ms 317920 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;
vector<pair<int, pair<int, int>>> to_add[N], to_del[N], qq[N];
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;

struct segTree {
 
  struct node {
    long long value, cur, lazy;
  };

  int size = 1;
  vector<node> tree;

  void init(int s) {
    while(s > size) {
      size *= 2;
    }
    tree.assign(2 * size - 1, {0, 0, 0});
  }

  void propagate(int x, int lx, int rx) {
    if(rx - lx == 1 || !tree[x].lazy) {
      return;
    }

    int mid = (lx + rx) / 2;
    tree[2 * x + 1].value += tree[x].lazy * (mid - lx);
    tree[2 * x + 1].lazy += tree[x].lazy;

    tree[2 * x + 2].value += tree[x].lazy * (rx - mid);
    tree[2 * x + 2].lazy += tree[x].lazy;

    tree[x].lazy = 0;
  }

  void upd(int l, int r, long long value, long long vul, int x, int lx, int rx) {
    propagate(x, lx, rx);
    if(lx >= r || rx <= l) {
      return;
    }

    if(lx >= l && rx <= r) {
      if(value == -1) {
        tree[x].value = 0;
        tree[x].cur = 0;
        tree[x].lazy = 0;
      } else {
        tree[x] = {value, vul, value};
        propagate(x, lx, rx);
      }
      return;
    }

    int mid = (lx + rx) / 2;
    upd(l, r, value, vul, 2 * x + 1, lx, mid);
    upd(l, r, value, vul, 2 * x + 2, mid, rx);
    tree[x].value = tree[2 * x + 1].value + tree[2 * x + 2].value;
  }

  void upd(int l, int r, long long value, long long vul) {
    upd(l, r, value, vul, 0, 0, size);
  }

  pair<long long, long long> qry(long long d, int x, int lx, int rx) {
    propagate(x, lx, rx);
    if(rx - lx == 1) {
      return {tree[x].cur, lx};
    }

    int mid = (lx + rx) / 2;
    if(tree[2 * x + 1].value >= d) {
      return qry(d, 2 * x + 1, lx, mid);
    } else { 
      return qry(d - tree[2 * x + 1].value, 2 * x + 2, mid, rx);
    }
  }

  pair<long long, long long> qry(long long d) {
    if(tree[0].value < d) {
      return {0ll, 0ll};
    }

    return qry(d, 0, 0, size);
  }
};
 
segTree seg;

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) {
    seg.init(q + 1);
    vector<int> answ(q + 1), out(q + 1);
    for(int i = 0; i < q; i++) {
      int type = queries[i].type;
      if(type == 1) {
        int l = queries[i].l;
        int r = queries[i].r;
        int c = queries[i].c;
        int k = queries[i].k;

        to_add[l].push_back({i, {k, c}});
        to_del[r + 1].push_back({i, {k, c}});
      } else {
        int a = queries[i].l;
        int b = queries[i].r;
        qq[a].push_back({i, {b, -1}});
        out[i] = 1;
      }
    }

    for(int i = 1; i <= n; i++) {
      for(auto j: to_add[i]) {
        seg.upd(j.first, j.first + 1, j.second.first, j.second.second);
      }

      for(auto j: to_del[i]) {
        seg.upd(j.first, j.first + 1, -1, -1);
      } 

      for(auto j: qq[i]) {
        auto u = seg.qry(j.second.first);
        if(u.first == 0) {
          answ[j.first] = u.first;
        } else if(u.second > j.first) {
          answ[j.first] = 0;
        } else {
          answ[j.first] = u.first;
        }
      }
    }

    for(int i = 0; i < q; i++) {
      if(out[i]) {
        cout << answ[i] << '\n';
      }
    }
  } 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

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 182984 KB Output is correct
2 Correct 127 ms 183644 KB Output is correct
3 Correct 138 ms 193304 KB Output is correct
4 Correct 137 ms 198848 KB Output is correct
5 Correct 111 ms 182384 KB Output is correct
6 Correct 113 ms 182384 KB Output is correct
7 Correct 147 ms 200944 KB Output is correct
8 Correct 146 ms 194648 KB Output is correct
9 Correct 132 ms 183716 KB Output is correct
10 Correct 141 ms 193732 KB Output is correct
11 Correct 151 ms 189516 KB Output is correct
12 Correct 136 ms 183816 KB Output is correct
13 Correct 132 ms 184256 KB Output is correct
14 Correct 147 ms 185840 KB Output is correct
15 Correct 134 ms 186492 KB Output is correct
16 Correct 149 ms 184508 KB Output is correct
17 Correct 123 ms 182948 KB Output is correct
18 Correct 136 ms 183172 KB Output is correct
19 Correct 107 ms 182484 KB Output is correct
20 Correct 108 ms 182392 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 182984 KB Output is correct
2 Correct 127 ms 183644 KB Output is correct
3 Correct 138 ms 193304 KB Output is correct
4 Correct 137 ms 198848 KB Output is correct
5 Correct 111 ms 182384 KB Output is correct
6 Correct 113 ms 182384 KB Output is correct
7 Correct 147 ms 200944 KB Output is correct
8 Correct 146 ms 194648 KB Output is correct
9 Correct 132 ms 183716 KB Output is correct
10 Correct 141 ms 193732 KB Output is correct
11 Correct 151 ms 189516 KB Output is correct
12 Correct 136 ms 183816 KB Output is correct
13 Correct 132 ms 184256 KB Output is correct
14 Correct 147 ms 185840 KB Output is correct
15 Correct 134 ms 186492 KB Output is correct
16 Correct 149 ms 184508 KB Output is correct
17 Correct 123 ms 182948 KB Output is correct
18 Correct 136 ms 183172 KB Output is correct
19 Correct 107 ms 182484 KB Output is correct
20 Correct 108 ms 182392 KB Output is correct
21 Correct 146 ms 183528 KB Output is correct
22 Correct 131 ms 183832 KB Output is correct
23 Correct 131 ms 193416 KB Output is correct
24 Correct 141 ms 199120 KB Output is correct
25 Correct 106 ms 182464 KB Output is correct
26 Correct 115 ms 182452 KB Output is correct
27 Correct 145 ms 200356 KB Output is correct
28 Correct 149 ms 195616 KB Output is correct
29 Correct 145 ms 186244 KB Output is correct
30 Correct 140 ms 193356 KB Output is correct
31 Correct 149 ms 189388 KB Output is correct
32 Correct 173 ms 183584 KB Output is correct
33 Correct 151 ms 184116 KB Output is correct
34 Correct 157 ms 186604 KB Output is correct
35 Correct 140 ms 184996 KB Output is correct
36 Correct 165 ms 184472 KB Output is correct
37 Correct 102 ms 182456 KB Output is correct
38 Correct 120 ms 182484 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 185504 KB Output is correct
2 Correct 167 ms 185528 KB Output is correct
3 Correct 173 ms 185504 KB Output is correct
4 Correct 170 ms 185444 KB Output is correct
5 Correct 197 ms 185456 KB Output is correct
6 Correct 198 ms 185644 KB Output is correct
7 Correct 125 ms 184972 KB Output is correct
8 Correct 126 ms 185024 KB Output is correct
9 Correct 173 ms 186056 KB Output is correct
10 Correct 153 ms 185428 KB Output is correct
11 Correct 160 ms 185728 KB Output is correct
12 Correct 155 ms 185536 KB Output is correct
13 Correct 170 ms 185124 KB Output is correct
14 Correct 178 ms 185528 KB Output is correct
15 Correct 198 ms 185468 KB Output is correct
16 Correct 204 ms 185752 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 317920 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 182984 KB Output is correct
2 Correct 127 ms 183644 KB Output is correct
3 Correct 138 ms 193304 KB Output is correct
4 Correct 137 ms 198848 KB Output is correct
5 Correct 111 ms 182384 KB Output is correct
6 Correct 113 ms 182384 KB Output is correct
7 Correct 147 ms 200944 KB Output is correct
8 Correct 146 ms 194648 KB Output is correct
9 Correct 132 ms 183716 KB Output is correct
10 Correct 141 ms 193732 KB Output is correct
11 Correct 151 ms 189516 KB Output is correct
12 Correct 136 ms 183816 KB Output is correct
13 Correct 132 ms 184256 KB Output is correct
14 Correct 147 ms 185840 KB Output is correct
15 Correct 134 ms 186492 KB Output is correct
16 Correct 149 ms 184508 KB Output is correct
17 Correct 123 ms 182948 KB Output is correct
18 Correct 136 ms 183172 KB Output is correct
19 Correct 107 ms 182484 KB Output is correct
20 Correct 108 ms 182392 KB Output is correct
21 Correct 151 ms 185504 KB Output is correct
22 Correct 167 ms 185528 KB Output is correct
23 Correct 173 ms 185504 KB Output is correct
24 Correct 170 ms 185444 KB Output is correct
25 Correct 197 ms 185456 KB Output is correct
26 Correct 198 ms 185644 KB Output is correct
27 Correct 125 ms 184972 KB Output is correct
28 Correct 126 ms 185024 KB Output is correct
29 Correct 173 ms 186056 KB Output is correct
30 Correct 153 ms 185428 KB Output is correct
31 Correct 160 ms 185728 KB Output is correct
32 Correct 155 ms 185536 KB Output is correct
33 Correct 170 ms 185124 KB Output is correct
34 Correct 178 ms 185528 KB Output is correct
35 Correct 198 ms 185468 KB Output is correct
36 Correct 204 ms 185752 KB Output is correct
37 Execution timed out 1082 ms 214976 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 164 ms 190392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 182984 KB Output is correct
2 Correct 127 ms 183644 KB Output is correct
3 Correct 138 ms 193304 KB Output is correct
4 Correct 137 ms 198848 KB Output is correct
5 Correct 111 ms 182384 KB Output is correct
6 Correct 113 ms 182384 KB Output is correct
7 Correct 147 ms 200944 KB Output is correct
8 Correct 146 ms 194648 KB Output is correct
9 Correct 132 ms 183716 KB Output is correct
10 Correct 141 ms 193732 KB Output is correct
11 Correct 151 ms 189516 KB Output is correct
12 Correct 136 ms 183816 KB Output is correct
13 Correct 132 ms 184256 KB Output is correct
14 Correct 147 ms 185840 KB Output is correct
15 Correct 134 ms 186492 KB Output is correct
16 Correct 149 ms 184508 KB Output is correct
17 Correct 123 ms 182948 KB Output is correct
18 Correct 136 ms 183172 KB Output is correct
19 Correct 107 ms 182484 KB Output is correct
20 Correct 108 ms 182392 KB Output is correct
21 Correct 146 ms 183528 KB Output is correct
22 Correct 131 ms 183832 KB Output is correct
23 Correct 131 ms 193416 KB Output is correct
24 Correct 141 ms 199120 KB Output is correct
25 Correct 106 ms 182464 KB Output is correct
26 Correct 115 ms 182452 KB Output is correct
27 Correct 145 ms 200356 KB Output is correct
28 Correct 149 ms 195616 KB Output is correct
29 Correct 145 ms 186244 KB Output is correct
30 Correct 140 ms 193356 KB Output is correct
31 Correct 149 ms 189388 KB Output is correct
32 Correct 173 ms 183584 KB Output is correct
33 Correct 151 ms 184116 KB Output is correct
34 Correct 157 ms 186604 KB Output is correct
35 Correct 140 ms 184996 KB Output is correct
36 Correct 165 ms 184472 KB Output is correct
37 Correct 102 ms 182456 KB Output is correct
38 Correct 120 ms 182484 KB Output is correct
39 Correct 151 ms 185504 KB Output is correct
40 Correct 167 ms 185528 KB Output is correct
41 Correct 173 ms 185504 KB Output is correct
42 Correct 170 ms 185444 KB Output is correct
43 Correct 197 ms 185456 KB Output is correct
44 Correct 198 ms 185644 KB Output is correct
45 Correct 125 ms 184972 KB Output is correct
46 Correct 126 ms 185024 KB Output is correct
47 Correct 173 ms 186056 KB Output is correct
48 Correct 153 ms 185428 KB Output is correct
49 Correct 160 ms 185728 KB Output is correct
50 Correct 155 ms 185536 KB Output is correct
51 Correct 170 ms 185124 KB Output is correct
52 Correct 178 ms 185528 KB Output is correct
53 Correct 198 ms 185468 KB Output is correct
54 Correct 204 ms 185752 KB Output is correct
55 Execution timed out 1082 ms 214976 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 182984 KB Output is correct
2 Correct 127 ms 183644 KB Output is correct
3 Correct 138 ms 193304 KB Output is correct
4 Correct 137 ms 198848 KB Output is correct
5 Correct 111 ms 182384 KB Output is correct
6 Correct 113 ms 182384 KB Output is correct
7 Correct 147 ms 200944 KB Output is correct
8 Correct 146 ms 194648 KB Output is correct
9 Correct 132 ms 183716 KB Output is correct
10 Correct 141 ms 193732 KB Output is correct
11 Correct 151 ms 189516 KB Output is correct
12 Correct 136 ms 183816 KB Output is correct
13 Correct 132 ms 184256 KB Output is correct
14 Correct 147 ms 185840 KB Output is correct
15 Correct 134 ms 186492 KB Output is correct
16 Correct 149 ms 184508 KB Output is correct
17 Correct 123 ms 182948 KB Output is correct
18 Correct 136 ms 183172 KB Output is correct
19 Correct 107 ms 182484 KB Output is correct
20 Correct 108 ms 182392 KB Output is correct
21 Correct 146 ms 183528 KB Output is correct
22 Correct 131 ms 183832 KB Output is correct
23 Correct 131 ms 193416 KB Output is correct
24 Correct 141 ms 199120 KB Output is correct
25 Correct 106 ms 182464 KB Output is correct
26 Correct 115 ms 182452 KB Output is correct
27 Correct 145 ms 200356 KB Output is correct
28 Correct 149 ms 195616 KB Output is correct
29 Correct 145 ms 186244 KB Output is correct
30 Correct 140 ms 193356 KB Output is correct
31 Correct 149 ms 189388 KB Output is correct
32 Correct 173 ms 183584 KB Output is correct
33 Correct 151 ms 184116 KB Output is correct
34 Correct 157 ms 186604 KB Output is correct
35 Correct 140 ms 184996 KB Output is correct
36 Correct 165 ms 184472 KB Output is correct
37 Correct 102 ms 182456 KB Output is correct
38 Correct 120 ms 182484 KB Output is correct
39 Correct 151 ms 185504 KB Output is correct
40 Correct 167 ms 185528 KB Output is correct
41 Correct 173 ms 185504 KB Output is correct
42 Correct 170 ms 185444 KB Output is correct
43 Correct 197 ms 185456 KB Output is correct
44 Correct 198 ms 185644 KB Output is correct
45 Correct 125 ms 184972 KB Output is correct
46 Correct 126 ms 185024 KB Output is correct
47 Correct 173 ms 186056 KB Output is correct
48 Correct 153 ms 185428 KB Output is correct
49 Correct 160 ms 185728 KB Output is correct
50 Correct 155 ms 185536 KB Output is correct
51 Correct 170 ms 185124 KB Output is correct
52 Correct 178 ms 185528 KB Output is correct
53 Correct 198 ms 185468 KB Output is correct
54 Correct 204 ms 185752 KB Output is correct
55 Execution timed out 1082 ms 317920 KB Time limit exceeded
56 Halted 0 ms 0 KB -