Submission #160896

#TimeUsernameProblemLanguageResultExecution timeMemory
160896nvmdavaBali Sculptures (APIO15_sculpture)C++17
21 / 100
5 ms504 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define N 2005 #define INF 0x3f3f3f3f3f3f3f3f #define MOD 1000000007LL ll p[N]; int dp1[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, a, b; cin>>n>>a>>b; ll res = 0; for(int i = 1; i <= n; i++){ cin>>p[i]; p[i] += p[i - 1]; } for(int k = 45; k >= 0; k--){ if(a == 1){ memset(dp1, 0x3f, sizeof dp1); dp1[0] = 0; } else { } for(int i = 1; i <= n; i++){ for(int j = 1; j <= i; j++){ if( (((p[i] - p[j - 1]) >> k ) | (res >> k)) != (res >> k) ) continue; if(a == 1){ dp1[i] = min(dp1[i], dp1[j - 1] + 1); } else { } } } if(a == 1){ if(dp1[n] > b) res += 1 << k; } else { } } cout<<res; }
#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...