oj.uz

Submission #881121

# Submission time Handle Problem Language Result Execution time Memory
881121 2023-11-30T15:56:58 Z smartmonky Secret (JOI14_secret) C++14
0 / 100
 20000 ms 4636 KB 
#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];
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 20002 ms 2652 KB Time limit exceeded
2 Execution timed out 20009 ms 2808 KB Time limit exceeded
3 Execution timed out 20022 ms 2808 KB Time limit exceeded
4 Execution timed out 20082 ms 4352 KB Time limit exceeded
5 Execution timed out 20094 ms 4636 KB Time limit exceeded
6 Execution timed out 20065 ms 4352 KB Time limit exceeded
7 Execution timed out 20016 ms 4292 KB Time limit exceeded
8 Execution timed out 20100 ms 4344 KB Time limit exceeded
9 Execution timed out 20008 ms 4344 KB Time limit exceeded
10 Execution timed out 20019 ms 4436 KB Time limit exceeded