oj.uz

Submission #570961

# Submission time Handle Problem Language Result Execution time Memory
570961 2022-05-31T18:24:14 Z beaconmc Secret (JOI14_secret) C++14
0 / 100
 499 ms 4484 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "secret.h"

using namespace std;

vector<vector<ll>> sus(1025);
vector<ll> nums(1025);
ll n;

// int Secret(ll a, ll b){
// 	return a+floor(b/2)*2;
// }

void sussy(ll a, ll b){
	if (b-a > 2){
		ll mid = (a+b)/2;

		vector<ll> left;
		vector<ll> right;

		left.push_back(nums[mid-1]);

		FORNEG(i, mid-2, a-1){
			left.push_back(Secret(nums[i], left[left.size()-1]));
		}

		right.push_back(nums[mid]);
		FOR(i,mid+1, b){
			right.push_back(Secret(right[right.size()-1], nums[i]));
		}

		reverse(left.begin(), left.end());

		for (auto&i : left){
			sus[mid].push_back(i);
		}

		for (auto&i : right){
			sus[mid].push_back(i);
		}

		sussy(a, mid);
		sussy(mid, b);
	}
}

void Init(int N, int A[]) {
	n = N;
	FOR(i,0,1025) nums[i] = 1;

	FOR(i,0,N) nums[i] = A[i];

	sussy(0,n);
}

int Query(int L, int R){
	if (R == L+1){
		return Secret(nums[L], nums[R]);
	}
	if (L==R){
		return nums[L];
	}
	ll lo = 0;
	ll hi = n;

	while (lo<hi){
		ll mid = (lo+hi)/2;


		
		if (L<=mid && mid<=R){


			ll size = sus[mid].size()/2;

			return Secret(sus[mid][size - (mid - L)], sus[mid][size+(R-mid)]);
		}

		if (mid<=L && mid<=R){
			lo = mid;
		}
		if (mid >= L && mid >= R){
			hi = mid;
		}
	}
}

// int main(){
// 	int sussy[8] =  {1,4,7,2,5,8,3,6};

// 	Init(8, sussy);
// 	cout << Query(0,3) << endl;
// 	cout << Query(1,7) << endl;
// 	cout << Query(5,5) << endl;
// 	cout << Query(2,4) << endl;




// }

Compilation message

secret.cpp: In function 'int Query(int, int)':
secret.cpp:91:1: warning: control reaches end of non-void function [-Wreturn-type]
   91 | }
      | ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 122 ms 2380 KB Wrong Answer: Query(255, 409) - expected : 307522235, actual : 38999632.
2 Incorrect 119 ms 2344 KB Wrong Answer: Query(236, 238) - expected : 173116186, actual : 416517106.
3 Incorrect 133 ms 2360 KB Wrong Answer: Query(128, 153) - expected : 959658850, actual : 219466354.
4 Incorrect 463 ms 4460 KB Wrong Answer: Query(374, 396) - expected : 402362963, actual : 342036658.
5 Incorrect 470 ms 4412 KB Wrong Answer: Query(937, 999) - expected : 615241818, actual : 827956544.
6 Incorrect 460 ms 4452 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 707400362.
7 Correct 460 ms 4340 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 499 ms 4440 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 459 ms 4328 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 476 ms 4484 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1