Submission #31137

#TimeUsernameProblemLanguageResultExecution timeMemory
31137nibnalinBali Sculptures (APIO15_sculpture)C++14
100 / 100
156 ms33460 KiB
#include <iostream> #include <cstdio> #include <vector> using namespace std; typedef long long int lli; const lli maxn = lli(2e3)+5, inf = lli(1e14)+5, maxb = 50; lli n, a, b, A[maxn], memo1[maxn], memo2[maxn][maxn]; lli DP1(lli idx, lli mask) { if(idx > n) return 0; else if(memo1[idx] != -1) return memo1[idx]; else { lli res = inf; for(lli i = idx;i <= n;i++) { lli c = A[i]-A[idx-1]; if((mask|c) == mask) { res = min(res, DP1(i+1, mask)+1); } } memo1[idx] = res; return res; } } bool DP2(lli idx, lli p, lli mask) { if(idx == n+1) { return (a <= p && p <= b); } else if(p > b) return 0; else if(memo2[idx][p] != -1) return memo2[idx][p]; else { for(lli i = idx;i <= n;i++) { lli c = A[i]-A[idx-1]; if((mask|c) == mask && DP2(i+1, p+1, mask)) { memo2[idx][p] = 1; return 1; } } memo2[idx][p] = 0; return 0; } } int main(void) { scanf("%lld%lld%lld", &n, &a, &b); for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]); for(lli i = 1;i <= n;i++) A[i] += A[i-1]; if(a == 1) { lli mask = (1ll<<maxb)-1; for(lli i = maxb-1;i >= 0;i--) { for(int i = 0;i <= n;i++) memo1[i] = -1; if(DP1(1, mask-(1ll<<i)) <= b) mask -= (1ll<<i); } printf("%lld\n", mask); } else { lli mask = (1ll<<maxb)-1; for(lli i = maxb-1;i >= 0;i--) { for(lli i = 0;i <= n;i++) { for(lli j = 0;j <= b;j++) memo2[i][j] = -1; } if(DP2(1, 0, mask-(1ll<<i))) mask -= (1ll<<i); } printf("%lld\n", mask); } }

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:58:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld", &n, &a, &b);
                                      ^
sculpture.cpp:60:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]);
                                                   ^
#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...