| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1304050 | exoworldgd | Jelly Flavours (IOI20_jelly) | C++20 | 2097 ms | 50412 KiB |
#pragma GCC optimize("O5,unroll-loops,inline,fast-math")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0), cout.tie(0)
#define ll long long
#define pii pair<int,int>
using namespace std;
const int N=1e5+5,M=1e9+7,inf=1e18;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n=a.size(),dp[x+1][y+1],mx=0;
memset(dp,-1,sizeof dp),dp[0][0]=0;
for (int f=0; f<n; f++) {
for (int i=x; i>=0; i--) {
for (int j=y; j>=0; j--) {
if (dp[i][j]==-1) continue;
if (i+a[f]<=x) dp[i+a[f]][j]=max(dp[i+a[f]][j],dp[i][j]+1);
if (j+b[f]<=y) dp[i][j+b[f]]=max(dp[i][j+b[f]],dp[i][j]+1);
}
}
}
for (int i=0; i<=x; i++) for (int j=0; j<=y; j++) if (dp[i][j]!=-1) mx=max(mx,dp[i][j]);
return mx;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
