Submission #394212

#	Time	Username	Problem	Language	Result	Execution time	Memory
394212		wenqi	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	8 ms	332 KiB

jelly

#include "jelly.h"
#include <bits/stdc++.h>

using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int N = a.size();
    valarray<int> sides(0, N);
    int X = x;
    int Y = y;
    for (int i = 0; i < N; i++) {
        if(a[i] <= X) {
            sides[i] = 1;
            X -= a[i];
        }else if(b[i] <= Y) {
            sides[i] = 2;
            Y -= b[i];
        }
        if(sides[i] != 0) continue;
        for(int j = 0; j < i; j++) {
            if(sides[j] == 1) {
                if(a[i] <= X + a[j] and b[j] <= Y) {
                    X += a[j] - a[i];
                    Y -= b[j];
                    sides[j] = 2;
                    sides[i] = 1;
                    break;
                }
            }else if(sides[j] == 2) {
                if(b[i] <= Y + b[j] and a[j] <= X) {
                    Y += b[j] - b[i];
                    X -= a[j];
                    sides[j] = 1;
                    sides[i] = 2;
                    break;
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < N; i++) {
        ans += sides[i] != 0;
    }
	return ans;
}

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