oj.uz

답안 #922535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922535 2024-02-05T16:16:43 Z hqminhuwu 비밀 (JOI14_secret) C++14
0 / 100
 398 ms 8752 KB 
#include "secret.h"
#include <bits/stdc++.h>
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define file "test"


using namespace std;
const int N = 2e3 + 5;
const ll oo = 1e9;
const ll mod = 1e9 + 7;

int a[N], n, f[N][N];

void calc (int l, int r){
	if (r < l)
		return;
	int mid = (l + r) / 2;
	f[mid][mid] = a[mid];
	f[mid + 1][mid + 1] = a[mid + 1];

	ford (i, mid - 1, l)
		f[mid][i] = Secret(a[i], f[mid][i + 1]);

	forr (i, mid + 2, r)
		f[mid + 1][i] = Secret(a[i], f[mid + 1][i - 1]);
	
	calc (l, mid - 1);
	calc (mid + 1, r);
}

void Init (int u, int z[]){
	n = u;
	forf (i, 0, n)
		a[i] = z[i];
	calc (0, n - 1);
}

int Query (int u, int v){
	int l = 0, r = n - 1;
	
	while (l < r){
		int mid = (l + r) / 2;
		if (mid >= u && mid < v) return Secret(f[mid][u], f[mid + 1][v]);
		if (mid == v) return f[mid][u];
		if (mid > u) r = mid - 1;
		else l = mid + 1;
	}

	return f[l][l];
}


/*



*/

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 105 ms 4648 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 102 ms 4496 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 104 ms 4644 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 379 ms 8528 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 378 ms 8472 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 378 ms 8752 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 415063604.
7 Incorrect 378 ms 8356 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 398 ms 8356 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 385 ms 8516 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 392 ms 8600 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.