# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
542679 | __Variatto | Secret (JOI14_secret) | C++17 | 457 ms | 4516 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"
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const ll MAX=1e3+10, L=10;
ll n, daq[MAX][L+2], q, a, b, t[MAX], pot, skad[MAX][L+2];
/*ll Secret(ll a, ll b){
return a*b;
}
*/int znajdz(int pocz, int kon, int l, int r, int nr){
int sr=(pocz+kon)/2;
if(pocz>=l && kon<=r && sr>=l && sr<=r) return nr;
if(sr<l) return znajdz(sr+1, kon, l, r, nr+1);
else return znajdz(pocz, sr, l, r, nr+1);
}
int Query(int l, int r){
if(l==r) return t[l];
ll x=znajdz(0, n-1, l, r, 1);
if(r==skad[r][x]) return daq[l][x];
//cout<<x<<" "<<skad[r][x]<<" "<<skad[l][x]<<"\n";
return Secret(daq[l][x], daq[r][x]);
}
void rek(int pocz, int kon, int nr){
if(pocz==kon){
daq[pocz][nr]=t[pocz];
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |