Submission #1240634

#TimeUsernameProblemLanguageResultExecution timeMemory
1240634thelegendary08Bali Sculptures (APIO15_sculpture)C++17
21 / 100
1 ms328 KiB
#include<bits/stdc++.h> #define pb push_back #define mp make_pair #define int long long #define vi vector<int> #define vvi vector<vector<int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vb vector<bool> #define mii map<int,int> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define in(a) int a; cin>>a #define in2(a,b) int a,b; cin>>a>>b #define in3(a,b,c) int a,b,c; cin>>a>>b>>c #define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d #define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];} #define out(a) cout<<a<<'\n' #define out2(a,b) cout<<a<<' '<<b<<'\n' #define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n' #define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n' #define pout(a) cout<<a.first<<' '<<a.second<<'\n' #define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl #define dout(a) cout<<a<<' '<<#a<<endl #define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl #define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';} const int leg = 1e9 + 7; const int mod = 998244353; using namespace std; int n,A,B; vi v; signed main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); cin>>n>>A>>B; v.resize(n); f0r(i,n)cin>>v[i]; vi ps(n + 1); FOR(i,1,n+1)ps[i] = ps[i-1] + v[i-1]; if(A == 1){ vector<vpii> adj(n + 1); f0r(i,n){ FOR(j, i + 1, n+1){ int sum = ps[j] - ps[i]; adj[i].pb(mp(j, sum)); } } vi dist(n+1, 4e18); vb ans(31); for(int b = 30; b>=0; b--){ f0r(j, n+1)dist[j] = 4e18; dist[0] = 0; queue<int>q; q.push(0); while(!q.empty()){ int node = q.front(); q.pop(); for(auto u : adj[node]){ if(dist[u.first] == 4e18){ int w=u.second; bool ok=1; for(int i = b; i<31; i++){ if(ans[i] == 0 && ((1LL << i) & w) > 0)ok = 0; } if(ok){ q.push(u.first); dist[u.first] = dist[node] + 1; } } } } if(dist[n] <= B)ans[b] = 0; else ans[b] = 1; } int ret = 0; f0r(i, 31){ ret += (1LL << i) * ans[i]; } out(ret); } }
#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...