# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433363 | frodakcin | Jelly Flavours (IOI20_jelly) | C++17 | 62 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "jelly.h"
#include <algorithm>
#include <cstring>
#include <vector>
#include <numeric>
bool ckmax(auto& a, const auto& b) {return b>a?a=b,1:0;}
bool ckmin(auto& a, const auto& b) {return b<a?a=b,1:0;}
const int MN = 2e3+10;
const int MV = 1e4+10;
struct st
{
public:
int v, bv;
st inc() {return {v+1, bv};}
void buy(int cost) {++v, bv-=cost;}
bool operator > (const st& o) const {return v > o.v || !(o.v > v) && bv > o.bv;}
} dp[MV];
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b)
{
int N = a.size();
std::vector<int> ord(N);
std::iota(ord.begin(), ord.end(), 0);
std::sort(ord.begin(), ord.end(), [&](int u, int v){return b[u]<b[v];});
for(int i=0;i<=x;++i)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |