Submission #950448

#	Time	Username	Problem	Language	Result	Execution time	Memory
950448		ALTAKEXE	Jelly Flavours (IOI20_jelly)	C++14	0 / 100	4 ms	348 KiB

jelly

#include <bits/stdc++.h>
#define ll long long int
#define f first
#define s second
#define pii pair<int, int>
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b)
{
    ll n = a.size(), ans = 0;
    vector<pii> v(n);
    for (int i = 0; i < n; i++)
        v.push_back({a[i], b[i]});
    sort(v.begin(), v.end());
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (v[i].f + v[j].f <= x)
                ans += 2;
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (v[i].s + v[j].s <= y)
                ans += 2;
        }
    }
    return ans - 10;
}

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