oj.uz

답안 #538499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538499 2022-03-17T03:22:27 Z Wayne_Yan 푸드 코트 (JOI21_foodcourt) C++17
7 / 100
 276 ms 21196 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
#define int long long
typedef int64_t ll;
typedef long double ld;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define RF(n) RFi(i,n)
#define RFi(i,n) RFl(i,0,n)
#define RFl(i,l,n) for(int i=n-1;i>=l;i--)
#define all(v) begin(v),end(v)
#define siz(v) (ll(v.size()))
#define get_pos(v,x) (lower_bound(all(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define mem(v,x) memset(v,x,sizeof v)
#define ff first
#define ss second
#define mid ((l+r)>>1)
#define RAN(a,b) uniform_int_distribution<int> (a, b)(rng)
#define debug(x) (cerr << (#x) << " = " << x << "\n")
template <typename T> using max_heap = __gnu_pbds::priority_queue<T,less<T> >;
template <typename T> using min_heap = __gnu_pbds::priority_queue<T,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

const int maxN = 250010;
vector<int> qs[maxN];
int N,M,Q;

/*
namespace sub3{
  const int maxN = 65010;
  deque<int> shop[maxN];

  void solve(){
    Fi(j, Q){
      vector<int> curr = qs[j];
      if(curr[0] == 1){
        Fl(i, curr[1], curr[2]+1){
          shop[i].push_back(curr[3]);
        }
      }
      if(curr[0] == 2){
        Fl(i, curr[1], curr[2]+1){
          int K = curr[3];
          if((int)shop[i].size() <= K) shop[i].clear();
          else{
            F(K) shop[i].pop_front();
          }
        }
      }
      if(curr[0] == 3){
        if( (int)shop[curr[1]].size() >= curr[2]){
          cout << shop[curr[1]][curr[2]-1];
        }else{
          cout << 0;
        }
        cout << "\n";
      }
    }
  }
}
*/

namespace sub2{
  const int maxN = 2e3+10;
  deque<pii> shop[maxN];
  
  void solve(){
    Fi(j, Q){
      vector<int> curr = qs[j];
      if(curr[0] == 1){
        Fl(i, curr[1], curr[2]+1){
          shop[i].push_back(mp(curr[3], curr[4]));
        }
      }
      if(curr[0] == 2){
        Fl(i, curr[1], curr[2]+1){
          int K = curr[3];
          while(!shop[i].empty() && K){
            if(shop[i][0].ss > K){
              shop[i][0].ss -= K;
              K = 0; 
            }else{
              K -= shop[i][0].ss;
              shop[i].pop_front();
            }
          }
        }
      }
      if(curr[0] == 3){
        int b = curr[2];
        deque<pii> now = shop[curr[1]];
        for(pii p : now){
          if(b <= p.ss){
            cout << p.ff << "\n";
            b = 0;
            break;
          }else{
            b -= p.ss;
          }
        }
        if(b) cout << "0\n";
      }
    }
  }
}

signed main(){

  cin >> N >> M >> Q;
  int x;
  F(Q){
    int t;
    cin >> t;
    qs[i].pb(t);
    Fi(j, 5-t){
      cin >> x;
      qs[i].pb(x);
    }
  }

  if(N <= 2000 && Q <= 2000) sub2::solve();

  bool __sub3 = true;
  F(Q){
    if(qs[i][0] == 1 && (qs[i][2] - qs[i][1] > 10 || qs[i][4] != 1)){
      __sub3 = false; 
    }
  }

  // if( N <= 65000 && Q <= 65000 && __sub3) sub3::solve();
  return 0;
}

Compilation message

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:131:8: warning: variable '__sub3' set but not used [-Wunused-but-set-variable]
  131 |   bool __sub3 = true;
      |        ^~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8020 KB Output is correct
2 Correct 12 ms 8444 KB Output is correct
3 Correct 17 ms 14996 KB Output is correct
4 Correct 24 ms 18644 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 24 ms 20148 KB Output is correct
8 Correct 20 ms 15760 KB Output is correct
9 Correct 14 ms 8404 KB Output is correct
10 Correct 19 ms 15304 KB Output is correct
11 Correct 17 ms 12428 KB Output is correct
12 Correct 14 ms 8532 KB Output is correct
13 Correct 13 ms 8532 KB Output is correct
14 Correct 18 ms 9720 KB Output is correct
15 Correct 14 ms 10484 KB Output is correct
16 Correct 18 ms 9720 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 13 ms 8148 KB Output is correct
19 Correct 7 ms 7676 KB Output is correct
20 Correct 8 ms 7636 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8020 KB Output is correct
2 Correct 12 ms 8444 KB Output is correct
3 Correct 17 ms 14996 KB Output is correct
4 Correct 24 ms 18644 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 24 ms 20148 KB Output is correct
8 Correct 20 ms 15760 KB Output is correct
9 Correct 14 ms 8404 KB Output is correct
10 Correct 19 ms 15304 KB Output is correct
11 Correct 17 ms 12428 KB Output is correct
12 Correct 14 ms 8532 KB Output is correct
13 Correct 13 ms 8532 KB Output is correct
14 Correct 18 ms 9720 KB Output is correct
15 Correct 14 ms 10484 KB Output is correct
16 Correct 18 ms 9720 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 13 ms 8148 KB Output is correct
19 Correct 7 ms 7676 KB Output is correct
20 Correct 8 ms 7636 KB Output is correct
21 Correct 12 ms 8316 KB Output is correct
22 Correct 14 ms 8532 KB Output is correct
23 Correct 18 ms 14980 KB Output is correct
24 Correct 23 ms 18772 KB Output is correct
25 Correct 7 ms 7548 KB Output is correct
26 Correct 6 ms 7636 KB Output is correct
27 Correct 27 ms 19576 KB Output is correct
28 Correct 27 ms 16468 KB Output is correct
29 Correct 18 ms 10196 KB Output is correct
30 Correct 24 ms 14892 KB Output is correct
31 Correct 20 ms 12324 KB Output is correct
32 Correct 17 ms 8456 KB Output is correct
33 Correct 17 ms 8656 KB Output is correct
34 Correct 23 ms 10784 KB Output is correct
35 Correct 18 ms 9172 KB Output is correct
36 Correct 23 ms 9740 KB Output is correct
37 Correct 7 ms 7636 KB Output is correct
38 Correct 6 ms 7636 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8020 KB Output is correct
2 Correct 12 ms 8444 KB Output is correct
3 Correct 17 ms 14996 KB Output is correct
4 Correct 24 ms 18644 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 24 ms 20148 KB Output is correct
8 Correct 20 ms 15760 KB Output is correct
9 Correct 14 ms 8404 KB Output is correct
10 Correct 19 ms 15304 KB Output is correct
11 Correct 17 ms 12428 KB Output is correct
12 Correct 14 ms 8532 KB Output is correct
13 Correct 13 ms 8532 KB Output is correct
14 Correct 18 ms 9720 KB Output is correct
15 Correct 14 ms 10484 KB Output is correct
16 Correct 18 ms 9720 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 13 ms 8148 KB Output is correct
19 Correct 7 ms 7676 KB Output is correct
20 Correct 8 ms 7636 KB Output is correct
21 Incorrect 72 ms 11828 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8020 KB Output is correct
2 Correct 12 ms 8444 KB Output is correct
3 Correct 17 ms 14996 KB Output is correct
4 Correct 24 ms 18644 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 24 ms 20148 KB Output is correct
8 Correct 20 ms 15760 KB Output is correct
9 Correct 14 ms 8404 KB Output is correct
10 Correct 19 ms 15304 KB Output is correct
11 Correct 17 ms 12428 KB Output is correct
12 Correct 14 ms 8532 KB Output is correct
13 Correct 13 ms 8532 KB Output is correct
14 Correct 18 ms 9720 KB Output is correct
15 Correct 14 ms 10484 KB Output is correct
16 Correct 18 ms 9720 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 13 ms 8148 KB Output is correct
19 Correct 7 ms 7676 KB Output is correct
20 Correct 8 ms 7636 KB Output is correct
21 Correct 12 ms 8316 KB Output is correct
22 Correct 14 ms 8532 KB Output is correct
23 Correct 18 ms 14980 KB Output is correct
24 Correct 23 ms 18772 KB Output is correct
25 Correct 7 ms 7548 KB Output is correct
26 Correct 6 ms 7636 KB Output is correct
27 Correct 27 ms 19576 KB Output is correct
28 Correct 27 ms 16468 KB Output is correct
29 Correct 18 ms 10196 KB Output is correct
30 Correct 24 ms 14892 KB Output is correct
31 Correct 20 ms 12324 KB Output is correct
32 Correct 17 ms 8456 KB Output is correct
33 Correct 17 ms 8656 KB Output is correct
34 Correct 23 ms 10784 KB Output is correct
35 Correct 18 ms 9172 KB Output is correct
36 Correct 23 ms 9740 KB Output is correct
37 Correct 7 ms 7636 KB Output is correct
38 Correct 6 ms 7636 KB Output is correct
39 Incorrect 72 ms 11828 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8020 KB Output is correct
2 Correct 12 ms 8444 KB Output is correct
3 Correct 17 ms 14996 KB Output is correct
4 Correct 24 ms 18644 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7636 KB Output is correct
7 Correct 24 ms 20148 KB Output is correct
8 Correct 20 ms 15760 KB Output is correct
9 Correct 14 ms 8404 KB Output is correct
10 Correct 19 ms 15304 KB Output is correct
11 Correct 17 ms 12428 KB Output is correct
12 Correct 14 ms 8532 KB Output is correct
13 Correct 13 ms 8532 KB Output is correct
14 Correct 18 ms 9720 KB Output is correct
15 Correct 14 ms 10484 KB Output is correct
16 Correct 18 ms 9720 KB Output is correct
17 Correct 9 ms 7892 KB Output is correct
18 Correct 13 ms 8148 KB Output is correct
19 Correct 7 ms 7676 KB Output is correct
20 Correct 8 ms 7636 KB Output is correct
21 Correct 12 ms 8316 KB Output is correct
22 Correct 14 ms 8532 KB Output is correct
23 Correct 18 ms 14980 KB Output is correct
24 Correct 23 ms 18772 KB Output is correct
25 Correct 7 ms 7548 KB Output is correct
26 Correct 6 ms 7636 KB Output is correct
27 Correct 27 ms 19576 KB Output is correct
28 Correct 27 ms 16468 KB Output is correct
29 Correct 18 ms 10196 KB Output is correct
30 Correct 24 ms 14892 KB Output is correct
31 Correct 20 ms 12324 KB Output is correct
32 Correct 17 ms 8456 KB Output is correct
33 Correct 17 ms 8656 KB Output is correct
34 Correct 23 ms 10784 KB Output is correct
35 Correct 18 ms 9172 KB Output is correct
36 Correct 23 ms 9740 KB Output is correct
37 Correct 7 ms 7636 KB Output is correct
38 Correct 6 ms 7636 KB Output is correct
39 Incorrect 72 ms 11828 KB Output isn't correct
40 Halted 0 ms 0 KB -