Submission #385513

#	Time	Username	Problem	Language	Result	Execution time	Memory
385513		The_Bitch	Jelly Flavours (IOI20_jelly)	C++14	Compilation error	0 ms	0 KiB

jelly

#include "jelly.h"
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N=1e6,M=1e4;
int mem[203][600][600];
long long minn=1e18,mux=-1e18;
int n,x,y;
int a[N],b[N];

int dp(int i,int x,int y){
    if(i==n)return 0;
    if(mem[i][x][y]!=-1)return mem[i][x][y];
    if(x>=a[i]&&y>=b[i])return mem[i][x][y]=max({dp(i+1,x-a[i],y)+1,dp(i+1,x,y-b[i])+1,dp(i+1,x,y)});
    else if(x>=a[i]&&y<b[i])return mem[i][x][y]=max(dp(i+1,x-a[i],y)+1,dp(i+1,x,y));
    else if(x<a[i]&&y>=b[i])return mem[i][x][y]=max(dp(i+1,x,y-b[i])+1,dp(i+1,x,y));
    else return mem[i][x][y]=dp(i+1,x,y);
}

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
	int n = a.size();

    for(int i=0;i<n+2;i++)
        for(int j=0;j<x+2;j++)
            for(int k=0;k<y+2;k++)
                mem[i][j][k]=-1;

    return dp(0,x,y);

}
/*
static int n, x, y;
static std::vector<int> a, b;

int main() {
    assert(scanf("%d %d %d", &n, &x, &y) == 3);
    a.resize(n);
    b.resize(n);
    for (int i = 0; i < n; i++) {
        assert(scanf("%d %d", &a[i], &b[i]) == 2);
    }

    fclose(stdin);

    int answer = find_maximum_unique(x, y, a, b);

    printf("%d\n", answer);
}*/

 /*main()
{
    cin>>n>>x>>y;
    for(int i=0;i<n+2;i++)
        for(int j=0;j<x+2;j++)
        for(int k=0;k<y+2;k++)
        mem[i][j][k]=-1;
    for(int i=0;i<n;i++)cin>>a[i]>>b[i];
    cout<<dp(0,x,y)<<endl;
    return 0;
}*/

Compilation message (stderr)

/tmp/ccwzKGwA.o: In function `main':
grader.cpp:(.text.startup+0x247): undefined reference to `find_maximum_unique(int, int, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status