제출 #1169023

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