Submission #523214

#TimeUsernameProblemLanguageResultExecution timeMemory
523214vonatlusBali Sculptures (APIO15_sculpture)C++17
0 / 100
1081 ms332 KiB
/// adil sultanov | vonat1us #pragma GCC optimize("O3") //#pragma comment(linker, "/STACK:36777216") #include<bits/stdc++.h> #define x first #define y second #define pb push_back #define sz(x) (int) x.size() #define all(z) (z).begin(), (z).end() using namespace std; using ll = long long; using pii = pair<int, int>; const int MOD = 1e9 + 7; const int INF = 1e9 + 1e2; void fin() { #ifdef AM freopen(".in", "r", stdin); #endif } const bool flag = 0; const int N = 2e3+10; int a[N], n, L, R; ll f(int i, int cnt) { if (cnt > R) return (1ll<<45); if (i == n-1) { if (cnt >= L) return 0; else return (1ll<<45); } ll sum = 0, res = (1ll<<45); for (int j = i+1; j < n; ++j) { sum += a[j]; res = min(res, (sum|(f(j, cnt+1)))); } return res; } void ma1n() { cin >> n >> L >> R; for (int i = 0; i < n; ++i) cin >> a[i]; cout << f(-1, 0); } int main() { ios_base::sync_with_stdio(0); cin.tie(nullptr), fin(); int ts = 1; if (flag) { cin >> ts; } while (ts--) { ma1n(); } return 0; }
#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...