제출 #950448

#제출 시각아이디문제언어결과실행 시간메모리
950448ALTAKEXEJelly Flavours (IOI20_jelly)C++14
0 / 100
4 ms348 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...