# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881103 | smartmonky | Secret (JOI14_secret) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "secret.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
using namespace std;
int t[10][1001],msk[1001],b[1001];
int n;
void Init(int n, int a[])
{
n = n;
for(int i=0;i<n;i++)b[i]=a[i];
//build(0,0,n-1,a);
}
int Query(int l, int r)
{
vector <int> prev, cur;
for(int i =1 ; i <= r; i++)
cur.pb(b[i]);
while(cur.size() != 1){
for(int i = 0; i + 1< n; i += 2){
prev.pb(Secret(cur[i], cur[i + 1]));
}
cur = prev;
prev.clear();
}
return cur[0];
}