LeetCode Weekly Contest 244 4問目 - Minimum Space Wasted From Packaging [1889]

Source

LeetCode Weekly Contest 244
問題文

問題概要

省略

解法

省略

cLay（version 20210607-1）のコード

C++に変換後のコードはこちら

#define main dummy_main
{}
#undef main

Arr1d<ll> t1, t2;

class Solution {
public:
  int minWastedSpace(vector<int>& packages, vector<vector<int>>& boxes) {
    dummy_main();
    ll res = ll_inf, mx = -1;
    t1.malloc(1d5+1);
    t2.malloc(1d5+1);
    rep(i,1d5+1) t1[i] = t2[i] = 0;

    for(auto i : packages){
      (t1[i], t2[i]) += (1, i);
      mx >?= i;
    }
    for(auto v : boxes){
      int n = v.size(), s = -1;
      ll tmp = 0;
      sort(v.begin(), v.end());
      if(v[n-1] < mx) continue;
      rep(i,n){
        tmp += v[i] * t1.getSum(s+1, v[i]) - t2.getSum(s+1, v[i]);
        s = v[i];
      }
      res <?= tmp;
    }

    if(res == ll_inf) return -1;
    return res % MD;
  }
};

Current time: 2024年04月20日08時57分10秒
Last modified: 2021年06月07日19時37分54秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る

Logged in as: unknown user (not login)