Algorithms

Size Times the Lowest Taste

Difficulty

Asked at Graviton Research Capital

Theory: Algorithms Under a Complexity Bound

Read the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.

Available in Python and C++. You are solving it in C++. Switch to Python

xxxxx xxx (x) xxxxxx. xxxx (x) xxx x xxxx (x_x) xxx x xxxxx (x_x). xxx xxx xxx xx xxxx (x) xxxxxxxxx xxxxxx, xxx x xxxx xx xxxxx [ xxx(xxx_{x xx xxxx{xxxx}} x_xxxx) xxxxx xxx_{x xx xxxx{xxxx}} x_x ] xxx xxxxx xxxx xx xxx xxxxxx xxx xxx, xxxxx xxx xxxxxx xxxxx xxxxx xxxx. x xxxxxx xxxx xxxx xxxx xxx xxx xxxx xxxxx xxx xxxxxxx xxxxx, xx xxxx xx xxx xxxxxx xxxxxx. xxxxxxxxx xxx_xxxxxxxxxxxx(xxxx, xxxxx, x) xxxxxxxxx xxx xxxxxxx xxxxx xxx xxxx xx xxxxxxx x xxx x xxxxxx xxx xxxxx. xxxxxxxx xxx_xxxxxxxxxxxx([xx, x, x, xx, x], [x, x, x, x, x], x) # xx (xxx xxxxxx xx xxxx x xxx xx: (x + xx) * xxx(x, x)) xxx_xxxxxxxxxxxx([xx, x, x, xx, x], [x, x, x, x, x], x) # xx (xxx xxxx xx xxxx xx xxxxx: xx * x) xxxxxxxxxxx (x xx x xx x xx xx^x), xxx xxxx xxx xxxxx xxxx xxxxxx (x). (x xx x_x, x_x xx xx^x). xxx xxxxxx xxx xxxxx xxxxx (xx^{xx}), xx xx xxxxx x xx-xxx xxxxxxx. xxxxxx xxxxx xxxxxx xx xxx xx xxx xxxxxxxx, xxx xxxxxx xxxxx xxxx xx xxx xxxxxx xxxxx xxxx x xxxxx xxxxxxxxx xxxx xxxx xx (x(x^x)), xxxxx xxxx xxx xxxxxx xx xxx xxxxxxx xxxxxx xxxx. xx x++ xxxx xxxx xxx_xxxxxxxxxxxx(xxxxx xxx::xxxxxx<xxxx xxxx>& xxxx, xxxxx xxx::xxxxxx<xxxx xxxx>& xxxxx, xxx x);

This problem is only available to subscribers.

Language:

Python 3.12 C++23

max_satisfaction

#include <vector>

// ...
// ...
// ...
// ...
// ...
long long max_satisfaction(const std::vector<long long>& size, const std::vector<long long>& taste, int m) {
    // ...
    (void)size;
    (void)taste;
    (void)m;
    return -1;
}

Unlock to runUpgrade

Unlock the problem to run it against the tests.