제출 #983681

#제출 시각아이디문제언어결과실행 시간메모리
983681SofiatpcJelly Flavours (IOI20_jelly)C++14
0 / 100
40 ms77160 KiB
#include "jelly.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 2005, MAX = 1e4+5; int dp[MAXN][MAX]; int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) { int n = a.size(); for(int i = n; i >= 1; i--) for(int j = 0; j <= x; j++){ if(b[i-1] == 0)dp[i][j] = dp[i+1][j]+1; else dp[i][j] = max(dp[i+1][j], dp[i+1][j-a[i-1]]+1); } return dp[1][x]; }
#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...