Submission #743424

#TimeUsernameProblemLanguageResultExecution timeMemory
743424Magikarp4000Bali Sculptures (APIO15_sculpture)C++17
46 / 100
1079 ms3224 KiB
#include <bits/stdc++.h> using namespace std; #define OPTM ios_base::sync_with_stdio(0); cin.tie(0); #define INF int(1e9+7) #define ln '\n' #define ll long long #define ull unsigned long long #define ui unsigned int #define us unsigned short #define FOR(i,s,n) for (int i = s; i < n; i++) #define FORR(i,n,s) for (int i = n; i > s; i--) #define FORX(u, arr) for (auto u : arr) #define PB push_back #define in(v,x) (v.find(x) != v.end()) #define F first #define S second #define PII pair<int, int> #define PLL pair<ll, ll> #define UM unordered_map #define US unordered_set #define PQ priority_queue #define ALL(v) v.begin(), v.end() const ll LLINF = 1e18+1; #define int long long const int MAXN = 1e2+1, LOG = 41; int n,A,B; int a[MAXN], p[MAXN]; int dp[MAXN][MAXN], res[LOG]; vector<int> v[MAXN][MAXN]; signed main() { cin >> n >> A >> B; FOR(i,0,n) cin >> a[i]; FOR(i,1,n+1) p[i] = p[i-1]+a[i-1]; dp[0][0] = 1; FOR(i,0,n) { FOR(j,i,n) { int x = p[j+1]-p[i]; while (x > 0) { v[i][j].PB(x%2); x /= 2; } int vn = v[i][j].size(); FOR(k,0,LOG-vn) v[i][j].PB(0); } } FORR(k,LOG-1,-1) { FOR(i,0,n+1) { FOR(j,1,n+1) dp[i][j] = 0; } FOR(j,0,n) { FOR(i,0,n+1) { FOR(l,i+1,n+1) { bool ok = 1; FORR(k1,LOG-1,k) if (v[i][l-1][k1] && !res[k1]) ok = 0; dp[l][j+1] = dp[l][j+1] || (dp[i][j] && ok && !v[i][l-1][k]); } } } res[k] = 1; FOR(x,A,B+1) { if (dp[n][x]) res[k] = 0; } } int ans = 0, cur = 1; FOR(k,0,LOG+1) { ans += cur*res[k]; cur *= 2; } cout << ans; }

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:68:25: warning: iteration 41 invokes undefined behavior [-Waggressive-loop-optimizations]
   68 |         ans += cur*res[k];
      |                    ~~~~~^
sculpture.cpp:10:38: note: within this loop
   10 | #define FOR(i,s,n) for (int i = s; i < n; i++)
......
   67 |     FOR(k,0,LOG+1) {
      |         ~~~~~~~~~                     
sculpture.cpp:67:5: note: in expansion of macro 'FOR'
   67 |     FOR(k,0,LOG+1) {
      |     ^~~
#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...