Submission #1091230

#TimeUsernameProblemLanguageResultExecution timeMemory
1091230modwweBali Sculptures (APIO15_sculpture)C++17
100 / 100
55 ms600 KiB
//#include "game.h" //#pragma GCC optimize("conserve-stack") #pragma GCC optimize("Ofast,unroll-loops") #include<bits/stdc++.h> #define int long long #define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".ans","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while(c<'0'||c>'9') { c=getchar_unlocked(); } while(c>='0'&&c<='9') { x=(x<<1)+(x<<3)+c-'0'; c=getchar_unlocked(); } return x; } void phongbeo(); const int inf=1e9; const int mod2=1e9+9; const int mod1=998244353; struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a,b,c; }; struct id { int a,b,c,d; }; struct ie { int a,b,c,d,e; }; int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center; int i,s10,s12; int kk; int el=19; main() { #ifndef ONLINE_JUDGE //fin(task); //fou(task); #endif NHP /// cin>>s1; ///modwwe phongbeo(),down // checktime } int a[2001]; namespace sub3 { bool dp[101][101]; bool check(int x) { memset(dp,0,sizeof dp); dp[0][0]=1; for(int i=1;i<=n;i++) for(int j=0;j<i;j++){ if(a[i]-a[j]>x) continue; for(int z=1;z<=i;z++) if(dp[j][z-1]) if(((a[i]-a[j])&x)==a[i]-a[j]) dp[i][z]=1;} for(int i=l;i<=r;i++) if(dp[n][i]) return 1; return 0; } void solve() { for(int i=1; i<=n; i++) cin>>a[i]; s2=(1ll<<40)-1; for(int i=1;i<=n;i++) a[i]+=a[i-1]; for(int i=39; i>=0; --i) { if(!bit(s2,1ll*i)) continue; if(check(s2-(1ll<<i))) s2-=(1ll<<i); } cout<<s2,down } }; namespace sub4{ int dp[2001]; bool check(int x) { for(int i=1;i<=n;i++) dp[i]=n+1; for(int i=1;i<=n;i++) for(int j=0;j<=i-1;j++) { if(a[i]-a[j]>x) continue; if(((a[i]-a[j])&x)==a[i]-a[j]) dp[i]=min(dp[j]+1,dp[i]); } return dp[n]<=r; } void solve() { s2=0; for(int i=1; i<=n; i++) cin>>a[i]; s2=(1ll<<41)-1; for(int i=1;i<=n;i++){ a[i]+=a[i-1]; } for(int i=40; i>=0; --i) { if(!bit(s2,i)) continue; if(check(s2-(1ll<<i))) s2-=(1ll<<i); } cout<<s2,down } }; void phongbeo() { cin>>n; cin>>l>>r; if(n<=100) sub3::solve(); else sub4::solve(); }

Compilation message (stderr)

sculpture.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
sculpture.cpp: In function 'void sub3::solve()':
sculpture.cpp:104:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  104 |         for(int i=1; i<=n; i++)
      |         ^~~
sculpture.cpp:106:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  106 |             s2=(1ll<<40)-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...