oj.uz

답안 #752629

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752629 2023-06-03T10:23:32 Z Sam_a17 푸드 코트 (JOI21_foodcourt) C++17
2 / 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;
  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(k != 1) ok = 0;
    } else if(type == 2) {
      long long l, r, k; 
      // cin >> l >> r >> k;
      l = ka(), r = ka(), k = ka();

      for(int i = l; i <= r; i++) {
        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);
      }
    } 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 104 ms 165296 KB Output is correct
2 Correct 121 ms 165860 KB Output is correct
3 Correct 119 ms 175516 KB Output is correct
4 Correct 124 ms 181212 KB Output is correct
5 Correct 97 ms 164644 KB Output is correct
6 Correct 96 ms 164704 KB Output is correct
7 Correct 118 ms 183240 KB Output is correct
8 Correct 117 ms 176728 KB Output is correct
9 Correct 114 ms 165916 KB Output is correct
10 Correct 127 ms 175792 KB Output is correct
11 Correct 114 ms 171844 KB Output is correct
12 Correct 113 ms 166040 KB Output is correct
13 Correct 116 ms 166528 KB Output is correct
14 Correct 120 ms 168040 KB Output is correct
15 Correct 113 ms 168596 KB Output is correct
16 Correct 133 ms 166664 KB Output is correct
17 Correct 112 ms 165148 KB Output is correct
18 Correct 108 ms 165420 KB Output is correct
19 Correct 93 ms 164716 KB Output is correct
20 Correct 93 ms 164684 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 165296 KB Output is correct
2 Correct 121 ms 165860 KB Output is correct
3 Correct 119 ms 175516 KB Output is correct
4 Correct 124 ms 181212 KB Output is correct
5 Correct 97 ms 164644 KB Output is correct
6 Correct 96 ms 164704 KB Output is correct
7 Correct 118 ms 183240 KB Output is correct
8 Correct 117 ms 176728 KB Output is correct
9 Correct 114 ms 165916 KB Output is correct
10 Correct 127 ms 175792 KB Output is correct
11 Correct 114 ms 171844 KB Output is correct
12 Correct 113 ms 166040 KB Output is correct
13 Correct 116 ms 166528 KB Output is correct
14 Correct 120 ms 168040 KB Output is correct
15 Correct 113 ms 168596 KB Output is correct
16 Correct 133 ms 166664 KB Output is correct
17 Correct 112 ms 165148 KB Output is correct
18 Correct 108 ms 165420 KB Output is correct
19 Correct 93 ms 164716 KB Output is correct
20 Correct 93 ms 164684 KB Output is correct
21 Correct 114 ms 165784 KB Output is correct
22 Correct 114 ms 166116 KB Output is correct
23 Correct 120 ms 175640 KB Output is correct
24 Correct 134 ms 181264 KB Output is correct
25 Correct 94 ms 164732 KB Output is correct
26 Correct 96 ms 164720 KB Output is correct
27 Correct 137 ms 182740 KB Output is correct
28 Correct 133 ms 177892 KB Output is correct
29 Correct 119 ms 168560 KB Output is correct
30 Correct 131 ms 175564 KB Output is correct
31 Correct 141 ms 171596 KB Output is correct
32 Correct 111 ms 165884 KB Output is correct
33 Correct 115 ms 166492 KB Output is correct
34 Correct 123 ms 168932 KB Output is correct
35 Correct 124 ms 167208 KB Output is correct
36 Correct 132 ms 166812 KB Output is correct
37 Incorrect 93 ms 164832 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 958 ms 165464 KB Output is correct
2 Correct 693 ms 165340 KB Output is correct
3 Correct 898 ms 165644 KB Output is correct
4 Correct 913 ms 165468 KB Output is correct
5 Correct 708 ms 165560 KB Output is correct
6 Correct 688 ms 165328 KB Output is correct
7 Incorrect 111 ms 164832 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 165296 KB Output is correct
2 Correct 121 ms 165860 KB Output is correct
3 Correct 119 ms 175516 KB Output is correct
4 Correct 124 ms 181212 KB Output is correct
5 Correct 97 ms 164644 KB Output is correct
6 Correct 96 ms 164704 KB Output is correct
7 Correct 118 ms 183240 KB Output is correct
8 Correct 117 ms 176728 KB Output is correct
9 Correct 114 ms 165916 KB Output is correct
10 Correct 127 ms 175792 KB Output is correct
11 Correct 114 ms 171844 KB Output is correct
12 Correct 113 ms 166040 KB Output is correct
13 Correct 116 ms 166528 KB Output is correct
14 Correct 120 ms 168040 KB Output is correct
15 Correct 113 ms 168596 KB Output is correct
16 Correct 133 ms 166664 KB Output is correct
17 Correct 112 ms 165148 KB Output is correct
18 Correct 108 ms 165420 KB Output is correct
19 Correct 93 ms 164716 KB Output is correct
20 Correct 93 ms 164684 KB Output is correct
21 Correct 958 ms 165464 KB Output is correct
22 Correct 693 ms 165340 KB Output is correct
23 Correct 898 ms 165644 KB Output is correct
24 Correct 913 ms 165468 KB Output is correct
25 Correct 708 ms 165560 KB Output is correct
26 Correct 688 ms 165328 KB Output is correct
27 Incorrect 111 ms 164832 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 165296 KB Output is correct
2 Correct 121 ms 165860 KB Output is correct
3 Correct 119 ms 175516 KB Output is correct
4 Correct 124 ms 181212 KB Output is correct
5 Correct 97 ms 164644 KB Output is correct
6 Correct 96 ms 164704 KB Output is correct
7 Correct 118 ms 183240 KB Output is correct
8 Correct 117 ms 176728 KB Output is correct
9 Correct 114 ms 165916 KB Output is correct
10 Correct 127 ms 175792 KB Output is correct
11 Correct 114 ms 171844 KB Output is correct
12 Correct 113 ms 166040 KB Output is correct
13 Correct 116 ms 166528 KB Output is correct
14 Correct 120 ms 168040 KB Output is correct
15 Correct 113 ms 168596 KB Output is correct
16 Correct 133 ms 166664 KB Output is correct
17 Correct 112 ms 165148 KB Output is correct
18 Correct 108 ms 165420 KB Output is correct
19 Correct 93 ms 164716 KB Output is correct
20 Correct 93 ms 164684 KB Output is correct
21 Correct 114 ms 165784 KB Output is correct
22 Correct 114 ms 166116 KB Output is correct
23 Correct 120 ms 175640 KB Output is correct
24 Correct 134 ms 181264 KB Output is correct
25 Correct 94 ms 164732 KB Output is correct
26 Correct 96 ms 164720 KB Output is correct
27 Correct 137 ms 182740 KB Output is correct
28 Correct 133 ms 177892 KB Output is correct
29 Correct 119 ms 168560 KB Output is correct
30 Correct 131 ms 175564 KB Output is correct
31 Correct 141 ms 171596 KB Output is correct
32 Correct 111 ms 165884 KB Output is correct
33 Correct 115 ms 166492 KB Output is correct
34 Correct 123 ms 168932 KB Output is correct
35 Correct 124 ms 167208 KB Output is correct
36 Correct 132 ms 166812 KB Output is correct
37 Incorrect 93 ms 164832 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 165296 KB Output is correct
2 Correct 121 ms 165860 KB Output is correct
3 Correct 119 ms 175516 KB Output is correct
4 Correct 124 ms 181212 KB Output is correct
5 Correct 97 ms 164644 KB Output is correct
6 Correct 96 ms 164704 KB Output is correct
7 Correct 118 ms 183240 KB Output is correct
8 Correct 117 ms 176728 KB Output is correct
9 Correct 114 ms 165916 KB Output is correct
10 Correct 127 ms 175792 KB Output is correct
11 Correct 114 ms 171844 KB Output is correct
12 Correct 113 ms 166040 KB Output is correct
13 Correct 116 ms 166528 KB Output is correct
14 Correct 120 ms 168040 KB Output is correct
15 Correct 113 ms 168596 KB Output is correct
16 Correct 133 ms 166664 KB Output is correct
17 Correct 112 ms 165148 KB Output is correct
18 Correct 108 ms 165420 KB Output is correct
19 Correct 93 ms 164716 KB Output is correct
20 Correct 93 ms 164684 KB Output is correct
21 Correct 114 ms 165784 KB Output is correct
22 Correct 114 ms 166116 KB Output is correct
23 Correct 120 ms 175640 KB Output is correct
24 Correct 134 ms 181264 KB Output is correct
25 Correct 94 ms 164732 KB Output is correct
26 Correct 96 ms 164720 KB Output is correct
27 Correct 137 ms 182740 KB Output is correct
28 Correct 133 ms 177892 KB Output is correct
29 Correct 119 ms 168560 KB Output is correct
30 Correct 131 ms 175564 KB Output is correct
31 Correct 141 ms 171596 KB Output is correct
32 Correct 111 ms 165884 KB Output is correct
33 Correct 115 ms 166492 KB Output is correct
34 Correct 123 ms 168932 KB Output is correct
35 Correct 124 ms 167208 KB Output is correct
36 Correct 132 ms 166812 KB Output is correct
37 Incorrect 93 ms 164832 KB Output isn't correct
38 Halted 0 ms 0 KB -