Submission #881121

#TimeUsernameProblemLanguageResultExecution timeMemory
881121smartmonkySecret (JOI14_secret)C++14
0 / 100
20100 ms4636 KiB
#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 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){
		for(int i = 0; i + 1 < r; i += 2){
			prev.pb(Secret(cur[i], cur[i + 1]));
		}
		cur = prev;
		prev.clear();
	}
	return cur[0];
}

void Init(int n, int a[])
{
	for(int i=0;i<n;i++)b[i]=a[i];
}
#Verdict Execution timeMemoryGrader output
Fetching results...