Submission #301665

#TimeUsernameProblemLanguageResultExecution timeMemory
301665aloo123Secret (JOI14_secret)C++14
Compilation error
0 ms0 KiB
#include <algorithm> #include <bitset> #include <cassert> #include <chrono> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <ratio> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #include <climits> #include "secret.h" #define ll long long #define ld long double #define mp make_pair #define pb push_back #define in insert #define vll vector<ll> #define endl "\n" #define pll pair<ll,ll> #define f first #define s second #define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++) // #define int ll #define sz(x) (ll)x.size() #define all(x) (x.begin(),x.end()) using namespace std; const ll INF = 1e12; const int M =(1e5+5); // TODO : change value as per problem const ll MOD = 1e9+7; int a[M]; int n; int dat[18][M], mask[M]; void divi(int l, int r, int lev) { // generate dat and mask if (l == r) return; int m = (l+r)/2; dat[lev][m] = a[m]; for(int i = m-1;i>=1;i--) dat[lev][i] = Secret(a[i],dat[lev][i+1]); dat[lev][m+1] = a[m+1]; for(int i = m+2;i<=r;i++) dat[lev][i] = Secret(dat[lev][i-1],x[i]); for(int i = m+1;i<=r;i++) mask[i] ^= 1<<lev; divi(l,m,lev+1); divi(m+1,r,lev+1); } void Init(int N,int A[]){ n = N; for(int i = 0;i<n;i++){ a[i+1] = A[i]; } divi(1,n,0); } int Query(int L, int R){ if(L == R){ return a[L]; } int bits = __builtin_ctz(mask[L]^mask[R]); return Secret(dat[bits][a],dat[bits][b]); } // void solve(){ // } // signed main(){ // ios_base::sync_with_stdio(0); // cin.tie(NULL); // // freopen(".in","r",stdin);freopen(".out","w",stdout); // ll tt=1; // // cin >> tt; // while(tt--){ // solve(); // } // }

Compilation message (stderr)

secret.cpp: In function 'void divi(int, int, int)':
secret.cpp:62:66: error: 'x' was not declared in this scope
   62 |     for(int i = m+2;i<=r;i++) dat[lev][i] = Secret(dat[lev][i-1],x[i]);
      |                                                                  ^
secret.cpp: In function 'int Query(int, int)':
secret.cpp:82:30: error: invalid types 'int [100005][int [100005]]' for array subscript
   82 |     return Secret(dat[bits][a],dat[bits][b]);
      |                              ^
secret.cpp:82:42: error: 'b' was not declared in this scope
   82 |     return Secret(dat[bits][a],dat[bits][b]);
      |                                          ^