Submission #1100934

#TimeUsernameProblemLanguageResultExecution timeMemory
1100934doducanhSecret (JOI14_secret)C++14
Compilation error
0 ms0 KiB
///breaker #include "secret.h" using namespace std; #define ll long long #define fi first #define se second #define ii pair<int,int> #define mp make_pair #define in(x) freopen(x,"r",stdin) #define out(x) freopen(x,"w",stdout) #define bit(x,i) ((x>>i)&1) #define lc (id<<1) #define rc ((id<<1)^1) const int maxn=1005; int pre[maxn][maxn]; int a[maxn]; int n; void dac(int l,int r) { if(l>r)return; int m=(l+r)/2; pre[m][m]=a[m]; pre[m+1][m+1]=a[m+1]; for(int i=l;i<=m-1;i++){ pre[i][m]=Secret(a[i],pre[m][m+1]); } for(int i=m+2;i<=r;i++){ pre[m][i]=Secret(pre[m+1][i-1],a[i]); } dac(l,m-1); dac(m+1,r); } void Init(int N,int A[]) { n=N; for(int i=0;i<n;i++){ a[i]=A[i]; } dac(0,n-1); } int Query(int l,int r) { int lo=0,hi=n-1; while(lo<=hi){ int m=(lo+hi)/2; if(m>=l&&m<r){ return Secret(pre[m][l],pre[m+1][r]); } else if(m==r){ return Secret(pre[m][l]); } else if(m<l){ lo=m+1; } else hi=m-1; } } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN * DON'T GET STUCK ON ONE APPROACH */

Compilation message (stderr)

secret.cpp: In function 'int Query(int, int)':
secret.cpp:50:36: error: too few arguments to function 'int Secret(int, int)'
   50 |             return Secret(pre[m][l]);
      |                                    ^
In file included from secret.cpp:2:
secret.h:7:5: note: declared here
    7 | int Secret(int X, int Y);
      |     ^~~~~~