oj.uz

Submission #935628

# Submission time Handle Problem Language Result Execution time Memory
935628 2024-02-29T09:58:07 Z Baizho Secret (JOI14_secret) C++14
0 / 100
 385 ms 8532 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7;
const ll MOD = 998244353;
const long long inf = 5e18;
const int M = 1005;

int Secret(int x, int y);

int val[M][M], n, a[M];

void solve(int l, int r) {
	if(l >= r) return;
	int mid = (l + r) / 2;
	val[mid][mid] = a[mid];
	val[mid + 1][mid + 1] = a[mid + 1];
	for(int i = mid - 1; i >= l; i --) val[mid][i] = Secret(val[mid][i + 1], a[i]);
	for(int i = mid + 2; i <= r; i ++) val[mid + 1][i] = Secret(val[mid + 1][i - 1], a[i]);
	solve(l, mid); solve(mid + 1, r);
}

void Init(int N, int A[]) {
	n = N;
	for(int i = 0; i < N; i ++) a[i] = A[i];
	solve(0, n - 1);
}

int Query(int L, int R) {
	int l = L, r = R, tl = 0, tr = n - 1;
	if(l == r) {
		return a[l];
	}
	while(tl != tr) {
		int mid = (tl + tr) / 2;
		if(l <= mid && mid + 1 <= r) {
//			cout<<tl<<" "<<tr<<" "<<mid<<endl;
			return Secret(val[mid][l], val[mid + 1][r]);
		} 
		else if(l == mid) return val[mid + 1][r];
		else if(r == mid) return val[mid][l];
		else if(r <= mid) tr = mid;
		else tl = mid + 1; 
	}
	return -1;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 6508 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 104 ms 6752 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 103 ms 6756 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 376 ms 8276 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 376 ms 8528 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 372 ms 8272 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 385 ms 8532 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 377 ms 8284 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 379 ms 8460 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 378 ms 8288 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.