oj.uz

답안 #752620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752620 2023-06-03T10:16:07 Z Sam_a17 푸드 코트 (JOI21_foodcourt) C++17
7 / 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};
 
// 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;
      }

      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

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 165252 KB Output is correct
2 Correct 120 ms 165856 KB Output is correct
3 Correct 133 ms 175600 KB Output is correct
4 Correct 129 ms 181108 KB Output is correct
5 Correct 93 ms 164652 KB Output is correct
6 Correct 104 ms 164724 KB Output is correct
7 Correct 128 ms 183244 KB Output is correct
8 Correct 125 ms 176804 KB Output is correct
9 Correct 121 ms 165824 KB Output is correct
10 Correct 137 ms 175916 KB Output is correct
11 Correct 124 ms 171912 KB Output is correct
12 Correct 120 ms 165964 KB Output is correct
13 Correct 126 ms 166500 KB Output is correct
14 Correct 138 ms 168064 KB Output is correct
15 Correct 120 ms 168684 KB Output is correct
16 Correct 125 ms 166652 KB Output is correct
17 Correct 117 ms 165172 KB Output is correct
18 Correct 121 ms 165452 KB Output is correct
19 Correct 102 ms 164720 KB Output is correct
20 Correct 98 ms 164700 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 165252 KB Output is correct
2 Correct 120 ms 165856 KB Output is correct
3 Correct 133 ms 175600 KB Output is correct
4 Correct 129 ms 181108 KB Output is correct
5 Correct 93 ms 164652 KB Output is correct
6 Correct 104 ms 164724 KB Output is correct
7 Correct 128 ms 183244 KB Output is correct
8 Correct 125 ms 176804 KB Output is correct
9 Correct 121 ms 165824 KB Output is correct
10 Correct 137 ms 175916 KB Output is correct
11 Correct 124 ms 171912 KB Output is correct
12 Correct 120 ms 165964 KB Output is correct
13 Correct 126 ms 166500 KB Output is correct
14 Correct 138 ms 168064 KB Output is correct
15 Correct 120 ms 168684 KB Output is correct
16 Correct 125 ms 166652 KB Output is correct
17 Correct 117 ms 165172 KB Output is correct
18 Correct 121 ms 165452 KB Output is correct
19 Correct 102 ms 164720 KB Output is correct
20 Correct 98 ms 164700 KB Output is correct
21 Correct 122 ms 165788 KB Output is correct
22 Correct 117 ms 166092 KB Output is correct
23 Correct 135 ms 175632 KB Output is correct
24 Correct 136 ms 181324 KB Output is correct
25 Correct 97 ms 164684 KB Output is correct
26 Correct 95 ms 164752 KB Output is correct
27 Correct 132 ms 182624 KB Output is correct
28 Correct 136 ms 177884 KB Output is correct
29 Correct 124 ms 168564 KB Output is correct
30 Correct 142 ms 175672 KB Output is correct
31 Correct 127 ms 171552 KB Output is correct
32 Correct 119 ms 165868 KB Output is correct
33 Correct 124 ms 166324 KB Output is correct
34 Correct 129 ms 168924 KB Output is correct
35 Correct 124 ms 167220 KB Output is correct
36 Correct 136 ms 166732 KB Output is correct
37 Correct 94 ms 164688 KB Output is correct
38 Correct 93 ms 164760 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 165252 KB Output is correct
2 Correct 120 ms 165856 KB Output is correct
3 Correct 133 ms 175600 KB Output is correct
4 Correct 129 ms 181108 KB Output is correct
5 Correct 93 ms 164652 KB Output is correct
6 Correct 104 ms 164724 KB Output is correct
7 Correct 128 ms 183244 KB Output is correct
8 Correct 125 ms 176804 KB Output is correct
9 Correct 121 ms 165824 KB Output is correct
10 Correct 137 ms 175916 KB Output is correct
11 Correct 124 ms 171912 KB Output is correct
12 Correct 120 ms 165964 KB Output is correct
13 Correct 126 ms 166500 KB Output is correct
14 Correct 138 ms 168064 KB Output is correct
15 Correct 120 ms 168684 KB Output is correct
16 Correct 125 ms 166652 KB Output is correct
17 Correct 117 ms 165172 KB Output is correct
18 Correct 121 ms 165452 KB Output is correct
19 Correct 102 ms 164720 KB Output is correct
20 Correct 98 ms 164700 KB Output is correct
21 Execution timed out 1071 ms 166184 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 165252 KB Output is correct
2 Correct 120 ms 165856 KB Output is correct
3 Correct 133 ms 175600 KB Output is correct
4 Correct 129 ms 181108 KB Output is correct
5 Correct 93 ms 164652 KB Output is correct
6 Correct 104 ms 164724 KB Output is correct
7 Correct 128 ms 183244 KB Output is correct
8 Correct 125 ms 176804 KB Output is correct
9 Correct 121 ms 165824 KB Output is correct
10 Correct 137 ms 175916 KB Output is correct
11 Correct 124 ms 171912 KB Output is correct
12 Correct 120 ms 165964 KB Output is correct
13 Correct 126 ms 166500 KB Output is correct
14 Correct 138 ms 168064 KB Output is correct
15 Correct 120 ms 168684 KB Output is correct
16 Correct 125 ms 166652 KB Output is correct
17 Correct 117 ms 165172 KB Output is correct
18 Correct 121 ms 165452 KB Output is correct
19 Correct 102 ms 164720 KB Output is correct
20 Correct 98 ms 164700 KB Output is correct
21 Correct 122 ms 165788 KB Output is correct
22 Correct 117 ms 166092 KB Output is correct
23 Correct 135 ms 175632 KB Output is correct
24 Correct 136 ms 181324 KB Output is correct
25 Correct 97 ms 164684 KB Output is correct
26 Correct 95 ms 164752 KB Output is correct
27 Correct 132 ms 182624 KB Output is correct
28 Correct 136 ms 177884 KB Output is correct
29 Correct 124 ms 168564 KB Output is correct
30 Correct 142 ms 175672 KB Output is correct
31 Correct 127 ms 171552 KB Output is correct
32 Correct 119 ms 165868 KB Output is correct
33 Correct 124 ms 166324 KB Output is correct
34 Correct 129 ms 168924 KB Output is correct
35 Correct 124 ms 167220 KB Output is correct
36 Correct 136 ms 166732 KB Output is correct
37 Correct 94 ms 164688 KB Output is correct
38 Correct 93 ms 164760 KB Output is correct
39 Execution timed out 1071 ms 166184 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 165252 KB Output is correct
2 Correct 120 ms 165856 KB Output is correct
3 Correct 133 ms 175600 KB Output is correct
4 Correct 129 ms 181108 KB Output is correct
5 Correct 93 ms 164652 KB Output is correct
6 Correct 104 ms 164724 KB Output is correct
7 Correct 128 ms 183244 KB Output is correct
8 Correct 125 ms 176804 KB Output is correct
9 Correct 121 ms 165824 KB Output is correct
10 Correct 137 ms 175916 KB Output is correct
11 Correct 124 ms 171912 KB Output is correct
12 Correct 120 ms 165964 KB Output is correct
13 Correct 126 ms 166500 KB Output is correct
14 Correct 138 ms 168064 KB Output is correct
15 Correct 120 ms 168684 KB Output is correct
16 Correct 125 ms 166652 KB Output is correct
17 Correct 117 ms 165172 KB Output is correct
18 Correct 121 ms 165452 KB Output is correct
19 Correct 102 ms 164720 KB Output is correct
20 Correct 98 ms 164700 KB Output is correct
21 Correct 122 ms 165788 KB Output is correct
22 Correct 117 ms 166092 KB Output is correct
23 Correct 135 ms 175632 KB Output is correct
24 Correct 136 ms 181324 KB Output is correct
25 Correct 97 ms 164684 KB Output is correct
26 Correct 95 ms 164752 KB Output is correct
27 Correct 132 ms 182624 KB Output is correct
28 Correct 136 ms 177884 KB Output is correct
29 Correct 124 ms 168564 KB Output is correct
30 Correct 142 ms 175672 KB Output is correct
31 Correct 127 ms 171552 KB Output is correct
32 Correct 119 ms 165868 KB Output is correct
33 Correct 124 ms 166324 KB Output is correct
34 Correct 129 ms 168924 KB Output is correct
35 Correct 124 ms 167220 KB Output is correct
36 Correct 136 ms 166732 KB Output is correct
37 Correct 94 ms 164688 KB Output is correct
38 Correct 93 ms 164760 KB Output is correct
39 Execution timed out 1071 ms 166184 KB Time limit exceeded
40 Halted 0 ms 0 KB -