# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881259 | smartmonky | Secret (JOI14_secret) | C++14 | 20100 ms | 4268 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 "secret.h"
#include <bits/stdc++.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()
using namespace std;
int b[10005];
int cnt = 0;
int Query(int l, int r){
vector <int> prev, cur;
for(int i = l; i <= r; i++)
cur.pb(b[i]);
while((int)cur.size() > 1){
if(cnt > 1e8)return 0;
for(int i = 0; i + 1 < r; i += 2){
prev.pb(Secret(cur[i], cur[i + 1]));
}
cnt++;
cur = prev;
prev.clear();
}
return cur[0];
}
void Init(int n, int a[])
{
for(int i=0;i<n;i++)b[i + 1]=a[i];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |