Submission #901694

#	Time	Username	Problem	Language	Result	Execution time	Memory
901694		trMatherz	Secret (JOI14_secret)	C++17	30 / 100	415 ms	8428 KiB

secret

//#include <iostream> //cin, cout
#include "secret.h"
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/




// includes
#include <cmath> 
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>



//usings 
using namespace std;
using namespace __gnu_pbds;


// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;

// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()


// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second

// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// maps
#define mii map<int, int>
#define mll map<ll, ll>

// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)


int n;
vvi v;

int build(int l, int r){
	if(l == r) return v[l][l];
	int m = (l + r) / 2;
	v[l][r] = Secret(build(l, m), build(m + 1, r));
	return v[l][r];
}
int get(int l, int r, int rl, int rr){
	if(r < rl || l > rr) return -1;
	if(rl <= l && r <= rr) return v[l][r];
	int m = (l + r) / 2;
	int x = get(l, m, rl, rr);
	int y = get(m + 1, r, rl, rr);
	if(x == -1) return y; 
	else if(y == -1) return x;
	else return Secret(x, y);
}
void Init(int N, int A[]){
	n = N;
	v = vvi(n, vi(n));
	F(i, n) v[i][i] = A[i];
	build(0, n - 1);
}
int Query(int L, int R){
	return get(0, n - 1, L, R);
}

• Subtask 1: 30 / 100