Submission #1276309

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276309		thelegendary08	Secret (JOI14_secret)	C++17	100 / 100	343 ms	4440 KiB

secret

#include "secret.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rs resize
#define ft front()
#define bk back()
#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 r0f(i,n) for(int i = n-1; i >= 0; i--)
#define R0F(i,k,n) for(int i = n-1; i >= k; 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';}
#define p2(x) (1LL << (x))
#define pct(x) (__builtin_popcountll(x))
#define ist(x,y) ((x >> y) & 1)
template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } 
template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } 
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1005, lg = 10;
int mask[mxn], comp[mxn][lg], A[mxn]; 
void solve(int L, int R, int dep){
	if(L == R)return; int mid = L + R >> 1; 
	comp[mid][dep] = A[mid]; for(int i = mid - 1; i >= L; i--)comp[i][dep] = Secret(A[i], comp[i+1][dep]); 
	comp[mid+1][dep] = A[mid+1]; FOR(i,mid+2,R+1)comp[i][dep] = Secret(comp[i-1][dep], A[i]);
	FOR(i, mid+1, R+1)mask[i] ^= p2(dep); solve(L, mid, dep+1); solve(mid+1, R, dep+1);
}
void Init(int N, int B[]) {
	f0r(i, N)A[i] = B[i]; solve(0, N-1, 0); 
}

int Query(int L, int R) {
	if(L == R)return A[L]; int d = __builtin_ctz(mask[L] ^ mask[R]); 
	return Secret(comp[L][d], comp[R][d]);
}

• Subtask 1: 100 / 100