oj.uz

답안 #752633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752633 2023-06-03T10:32:51 Z Sam_a17 푸드 코트 (JOI21_foodcourt) C++17
14 / 100
 1000 ms 524288 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];

void solve_() {
  // cin >> n >> m >> q;
  n = ka();
  m = ka();
  q = ka();
  
  long long it = 0, ok = 1;
  set<int> not_empty;
  vector<bool> have(n + 1);
  while(q--) {
    int type = ka();
    // cin >> type;
    if(type == 1) {
      long long l, r, c, k; 
      // cin >> l >> r >> c >> k;
      l = ka(), r = ka(), c = ka(), k = ka();
      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 = ka(), r = ka(), k = ka();
      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 = ka(), b = ka();

      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 122 ms 165316 KB Output is correct
2 Correct 129 ms 165908 KB Output is correct
3 Correct 141 ms 175636 KB Output is correct
4 Correct 146 ms 181256 KB Output is correct
5 Correct 97 ms 164684 KB Output is correct
6 Correct 105 ms 164708 KB Output is correct
7 Correct 129 ms 183368 KB Output is correct
8 Correct 134 ms 176856 KB Output is correct
9 Correct 157 ms 165972 KB Output is correct
10 Correct 154 ms 175916 KB Output is correct
11 Correct 169 ms 171948 KB Output is correct
12 Correct 135 ms 166168 KB Output is correct
13 Correct 128 ms 166584 KB Output is correct
14 Correct 146 ms 168040 KB Output is correct
15 Correct 131 ms 168780 KB Output is correct
16 Correct 143 ms 166760 KB Output is correct
17 Correct 121 ms 165164 KB Output is correct
18 Correct 132 ms 165584 KB Output is correct
19 Correct 102 ms 164680 KB Output is correct
20 Correct 95 ms 164688 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 165316 KB Output is correct
2 Correct 129 ms 165908 KB Output is correct
3 Correct 141 ms 175636 KB Output is correct
4 Correct 146 ms 181256 KB Output is correct
5 Correct 97 ms 164684 KB Output is correct
6 Correct 105 ms 164708 KB Output is correct
7 Correct 129 ms 183368 KB Output is correct
8 Correct 134 ms 176856 KB Output is correct
9 Correct 157 ms 165972 KB Output is correct
10 Correct 154 ms 175916 KB Output is correct
11 Correct 169 ms 171948 KB Output is correct
12 Correct 135 ms 166168 KB Output is correct
13 Correct 128 ms 166584 KB Output is correct
14 Correct 146 ms 168040 KB Output is correct
15 Correct 131 ms 168780 KB Output is correct
16 Correct 143 ms 166760 KB Output is correct
17 Correct 121 ms 165164 KB Output is correct
18 Correct 132 ms 165584 KB Output is correct
19 Correct 102 ms 164680 KB Output is correct
20 Correct 95 ms 164688 KB Output is correct
21 Correct 130 ms 165840 KB Output is correct
22 Correct 131 ms 166080 KB Output is correct
23 Correct 140 ms 175696 KB Output is correct
24 Correct 148 ms 181428 KB Output is correct
25 Correct 109 ms 164688 KB Output is correct
26 Correct 98 ms 164592 KB Output is correct
27 Correct 168 ms 182672 KB Output is correct
28 Correct 144 ms 177936 KB Output is correct
29 Correct 145 ms 168628 KB Output is correct
30 Correct 151 ms 175720 KB Output is correct
31 Correct 143 ms 171672 KB Output is correct
32 Correct 141 ms 166080 KB Output is correct
33 Correct 171 ms 166424 KB Output is correct
34 Correct 158 ms 168984 KB Output is correct
35 Correct 149 ms 167328 KB Output is correct
36 Correct 160 ms 166808 KB Output is correct
37 Correct 98 ms 164780 KB Output is correct
38 Correct 101 ms 164856 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 165372 KB Output is correct
2 Correct 158 ms 165324 KB Output is correct
3 Correct 158 ms 165208 KB Output is correct
4 Correct 160 ms 165244 KB Output is correct
5 Correct 194 ms 165292 KB Output is correct
6 Correct 200 ms 165324 KB Output is correct
7 Correct 105 ms 164700 KB Output is correct
8 Correct 102 ms 164728 KB Output is correct
9 Correct 148 ms 166008 KB Output is correct
10 Correct 145 ms 166508 KB Output is correct
11 Correct 152 ms 166852 KB Output is correct
12 Correct 134 ms 166524 KB Output is correct
13 Correct 155 ms 166084 KB Output is correct
14 Correct 163 ms 166300 KB Output is correct
15 Correct 188 ms 166728 KB Output is correct
16 Correct 197 ms 166816 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 165316 KB Output is correct
2 Correct 129 ms 165908 KB Output is correct
3 Correct 141 ms 175636 KB Output is correct
4 Correct 146 ms 181256 KB Output is correct
5 Correct 97 ms 164684 KB Output is correct
6 Correct 105 ms 164708 KB Output is correct
7 Correct 129 ms 183368 KB Output is correct
8 Correct 134 ms 176856 KB Output is correct
9 Correct 157 ms 165972 KB Output is correct
10 Correct 154 ms 175916 KB Output is correct
11 Correct 169 ms 171948 KB Output is correct
12 Correct 135 ms 166168 KB Output is correct
13 Correct 128 ms 166584 KB Output is correct
14 Correct 146 ms 168040 KB Output is correct
15 Correct 131 ms 168780 KB Output is correct
16 Correct 143 ms 166760 KB Output is correct
17 Correct 121 ms 165164 KB Output is correct
18 Correct 132 ms 165584 KB Output is correct
19 Correct 102 ms 164680 KB Output is correct
20 Correct 95 ms 164688 KB Output is correct
21 Correct 131 ms 165372 KB Output is correct
22 Correct 158 ms 165324 KB Output is correct
23 Correct 158 ms 165208 KB Output is correct
24 Correct 160 ms 165244 KB Output is correct
25 Correct 194 ms 165292 KB Output is correct
26 Correct 200 ms 165324 KB Output is correct
27 Correct 105 ms 164700 KB Output is correct
28 Correct 102 ms 164728 KB Output is correct
29 Correct 148 ms 166008 KB Output is correct
30 Correct 145 ms 166508 KB Output is correct
31 Correct 152 ms 166852 KB Output is correct
32 Correct 134 ms 166524 KB Output is correct
33 Correct 155 ms 166084 KB Output is correct
34 Correct 163 ms 166300 KB Output is correct
35 Correct 188 ms 166728 KB Output is correct
36 Correct 197 ms 166816 KB Output is correct
37 Execution timed out 1085 ms 195300 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 534 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 165316 KB Output is correct
2 Correct 129 ms 165908 KB Output is correct
3 Correct 141 ms 175636 KB Output is correct
4 Correct 146 ms 181256 KB Output is correct
5 Correct 97 ms 164684 KB Output is correct
6 Correct 105 ms 164708 KB Output is correct
7 Correct 129 ms 183368 KB Output is correct
8 Correct 134 ms 176856 KB Output is correct
9 Correct 157 ms 165972 KB Output is correct
10 Correct 154 ms 175916 KB Output is correct
11 Correct 169 ms 171948 KB Output is correct
12 Correct 135 ms 166168 KB Output is correct
13 Correct 128 ms 166584 KB Output is correct
14 Correct 146 ms 168040 KB Output is correct
15 Correct 131 ms 168780 KB Output is correct
16 Correct 143 ms 166760 KB Output is correct
17 Correct 121 ms 165164 KB Output is correct
18 Correct 132 ms 165584 KB Output is correct
19 Correct 102 ms 164680 KB Output is correct
20 Correct 95 ms 164688 KB Output is correct
21 Correct 130 ms 165840 KB Output is correct
22 Correct 131 ms 166080 KB Output is correct
23 Correct 140 ms 175696 KB Output is correct
24 Correct 148 ms 181428 KB Output is correct
25 Correct 109 ms 164688 KB Output is correct
26 Correct 98 ms 164592 KB Output is correct
27 Correct 168 ms 182672 KB Output is correct
28 Correct 144 ms 177936 KB Output is correct
29 Correct 145 ms 168628 KB Output is correct
30 Correct 151 ms 175720 KB Output is correct
31 Correct 143 ms 171672 KB Output is correct
32 Correct 141 ms 166080 KB Output is correct
33 Correct 171 ms 166424 KB Output is correct
34 Correct 158 ms 168984 KB Output is correct
35 Correct 149 ms 167328 KB Output is correct
36 Correct 160 ms 166808 KB Output is correct
37 Correct 98 ms 164780 KB Output is correct
38 Correct 101 ms 164856 KB Output is correct
39 Correct 131 ms 165372 KB Output is correct
40 Correct 158 ms 165324 KB Output is correct
41 Correct 158 ms 165208 KB Output is correct
42 Correct 160 ms 165244 KB Output is correct
43 Correct 194 ms 165292 KB Output is correct
44 Correct 200 ms 165324 KB Output is correct
45 Correct 105 ms 164700 KB Output is correct
46 Correct 102 ms 164728 KB Output is correct
47 Correct 148 ms 166008 KB Output is correct
48 Correct 145 ms 166508 KB Output is correct
49 Correct 152 ms 166852 KB Output is correct
50 Correct 134 ms 166524 KB Output is correct
51 Correct 155 ms 166084 KB Output is correct
52 Correct 163 ms 166300 KB Output is correct
53 Correct 188 ms 166728 KB Output is correct
54 Correct 197 ms 166816 KB Output is correct
55 Execution timed out 1085 ms 195300 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 165316 KB Output is correct
2 Correct 129 ms 165908 KB Output is correct
3 Correct 141 ms 175636 KB Output is correct
4 Correct 146 ms 181256 KB Output is correct
5 Correct 97 ms 164684 KB Output is correct
6 Correct 105 ms 164708 KB Output is correct
7 Correct 129 ms 183368 KB Output is correct
8 Correct 134 ms 176856 KB Output is correct
9 Correct 157 ms 165972 KB Output is correct
10 Correct 154 ms 175916 KB Output is correct
11 Correct 169 ms 171948 KB Output is correct
12 Correct 135 ms 166168 KB Output is correct
13 Correct 128 ms 166584 KB Output is correct
14 Correct 146 ms 168040 KB Output is correct
15 Correct 131 ms 168780 KB Output is correct
16 Correct 143 ms 166760 KB Output is correct
17 Correct 121 ms 165164 KB Output is correct
18 Correct 132 ms 165584 KB Output is correct
19 Correct 102 ms 164680 KB Output is correct
20 Correct 95 ms 164688 KB Output is correct
21 Correct 130 ms 165840 KB Output is correct
22 Correct 131 ms 166080 KB Output is correct
23 Correct 140 ms 175696 KB Output is correct
24 Correct 148 ms 181428 KB Output is correct
25 Correct 109 ms 164688 KB Output is correct
26 Correct 98 ms 164592 KB Output is correct
27 Correct 168 ms 182672 KB Output is correct
28 Correct 144 ms 177936 KB Output is correct
29 Correct 145 ms 168628 KB Output is correct
30 Correct 151 ms 175720 KB Output is correct
31 Correct 143 ms 171672 KB Output is correct
32 Correct 141 ms 166080 KB Output is correct
33 Correct 171 ms 166424 KB Output is correct
34 Correct 158 ms 168984 KB Output is correct
35 Correct 149 ms 167328 KB Output is correct
36 Correct 160 ms 166808 KB Output is correct
37 Correct 98 ms 164780 KB Output is correct
38 Correct 101 ms 164856 KB Output is correct
39 Correct 131 ms 165372 KB Output is correct
40 Correct 158 ms 165324 KB Output is correct
41 Correct 158 ms 165208 KB Output is correct
42 Correct 160 ms 165244 KB Output is correct
43 Correct 194 ms 165292 KB Output is correct
44 Correct 200 ms 165324 KB Output is correct
45 Correct 105 ms 164700 KB Output is correct
46 Correct 102 ms 164728 KB Output is correct
47 Correct 148 ms 166008 KB Output is correct
48 Correct 145 ms 166508 KB Output is correct
49 Correct 152 ms 166852 KB Output is correct
50 Correct 134 ms 166524 KB Output is correct
51 Correct 155 ms 166084 KB Output is correct
52 Correct 163 ms 166300 KB Output is correct
53 Correct 188 ms 166728 KB Output is correct
54 Correct 197 ms 166816 KB Output is correct
55 Execution timed out 1087 ms 301256 KB Time limit exceeded
56 Halted 0 ms 0 KB -