| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 257553 | gs18115 | Secret (JOI14_secret) | C++14 | 519 ms | 4748 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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18+7;
inline int f(int x,int y)
{
return Secret(x,y);
}
vector<int>lv[4010],rv[4010];
vector<int>v;
void init(int n,int s,int e)
{
if(s>e-2)
return;
int m=s+(e-s)/2;
lv[n].eb(v[m]);
for(int i=m;i-->s;)
lv[n].eb(f(v[i],lv[n].back()));
rv[n].eb(v[m+1]);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||