제출 #301615

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
301615	2020-09-18 05:21:40	kevinsogo	Jelly Flavours (IOI20_jelly)	C++17	100 / 100	67 ms	632 KiB

jelly

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
int find_maximum_unique(int X, int Y, vector<int> xs, vector<int> ys) {
    xs.push_back(0);
    ys.push_back(0);
    int n = xs.size();
    vector<bool> inc(n);
    vector<int> miny(X + 1);
    vector<int> xis(n), yis(n);
    iota(xis.begin(), xis.end(), 0);
    iota(yis.begin(), yis.end(), 0);
    sort(xis.begin(), xis.end(), [&](int i, int j) { return xs[i] < xs[j]; });
    sort(yis.begin(), yis.end(), [&](int i, int j) { return ys[i] < ys[j]; });
    int ans = 0, curr = 0;
    for (int i : xis) {
        curr++;
        inc[i] = true;
        for (int x = X; x >= 0; x--) miny[x] += ys[i];
        for (int x = X; x >= xs[i]; x--) miny[x] = min(miny[x], miny[x-xs[i]]-ys[i]);
        if (int y = miny[X]; y <= Y) {
            int cand = curr;
            for (int j : yis) {
                if (!inc[j] && y + ys[j] <= Y) {
                    y += ys[j];
                    cand++;
                }
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 24 / 24
• Subtask 3: 9 / 9
• Subtask 4: 10 / 10
• Subtask 5: 14 / 14
• Subtask 6: 32 / 32