Submission #1168990

#TimeUsernameProblemLanguageResultExecution timeMemory
1168990bbartekJelly Flavours (IOI20_jelly)C++20
0 / 100
4 ms9024 KiB
#include <bits/stdc++.h> #include "jelly.h" using namespace std; typedef long long ll; #define st first #define nd second #define pb push_back const int maxn = 2003; int dp[203][503][503]; int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) { int n = a.size(); for(int i=1;i<=n;i++){ for(int j=0;j<=x;j++){ for(int k=0;k<=y;k++){ dp[i][j][k] = min(dp[i-1][j-a[i-1]][k],dp[i-1][j][k-b[i-1]]); dp[i][j][k]++; } } } return dp[n][x][y]; }
#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...