제출 #1311780

#제출 시각아이디문제언어결과실행 시간메모리
1311780norrawichzzzJelly Flavours (IOI20_jelly)C++20
35 / 100
2096 ms16224 KiB
#include <bits/stdc++.h> using namespace std; const int MXV = 2005; int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) { int n=a.size(); vector<vector<int>> dp(MXV, vector<int>(MXV)); dp[0][0] = 0; for (int e=0; e<n; e++) { for (int i=MXV-1; i>=0; i--) { for (int j=MXV-1; j>=0; j--) { if (i-a[e] >= 0) dp[i][j] = max(dp[i-a[e]][j]+1, dp[i][j]); if (j-b[e] >= 0) dp[i][j] = max(dp[i][j-b[e]]+1, dp[i][j]); } } } return dp[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...