Submission #112048

#TimeUsernameProblemLanguageResultExecution timeMemory
112048Eug1enaBali Sculptures (APIO15_sculpture)C++14
71 / 100
80 ms768 KiB
#include <bits/stdc++.h> using namespace std; using lint = long long; int N, A, B; vector<lint> sum{0}; lint notbit = 0; lint dp[105][105]; bool minimum(int now, int cnt){ if(now == N){ return (A <= cnt && cnt <= B); }else if(dp[now][cnt] != -1){ return dp[now][cnt]; } bool ans = false; for(int i = now + 1; i <= N; i++){ if(((sum[i] - sum[now]) & notbit) == 0){ ans |= minimum(i, cnt + 1); } } return dp[now][cnt] = ans; } int main(){ cin >> N >> A >> B; for(int i = 0; i < N; i++){ lint Y; cin >> Y; lint item = sum.back() + Y; sum.push_back(item); } for(int i = 59; i >= 0; i--){ notbit += (1l << i); memset(dp, -1, sizeof(dp)); if(!minimum(0, 0)){ notbit -= (1l << i); } } cout << (1l << 60) - 1 - notbit << endl; }

Compilation message (stderr)

sculpture.cpp: In function 'bool minimum(int, int)':
sculpture.cpp:24:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     return dp[now][cnt] = ans;
            ~~~~~~~~~~~~~^~~~~
#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...