oj.uz

답안 #85559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
85559 2018-11-20T23:20:10 Z KCSC 비밀 (JOI14_secret) C++14
6 / 100
 669 ms 6288 KB 
#include <bits/stdc++.h>
using namespace std;

int Secret(int x, int y);
void Init(int n, int arr[]);
int Query(int le, int ri);
/*
int Secret(int x, int y) {
	return x xor y xor 13; }
*/
int secret(int x, int y) {
	static map<pair<int, int>, int> mmp;
	if (mmp.find(make_pair(x, y)) != mmp.end()) {
		return mmp[make_pair(x, y)]; }
	else
		return (mmp[make_pair(x, y)] = Secret(x, y)); }

const int DIM = 1005;
vector<int> lef[DIM * 4], rig[DIM * 4];

void build(int nd, int le, int ri, int arr[]) {
	lef[nd].resize(ri - le + 1); lef[nd][0] = arr[le]; 
	for (int i = 1; i <= ri - le; ++i) {
		lef[nd][i] = secret(lef[nd][i - 1], arr[le + i]); }
	rig[nd].resize(ri - le + 1); rig[nd][ri - le] = arr[ri];
	for (int i = ri - le - 1; i >= 0; --i) {
		rig[nd][i] = secret(arr[le + i], rig[nd][i + 1]); }
	if (le != ri) {
		int md = (le + ri) / 2;
		build(nd * 2, le, md, arr);	
		build(nd * 2 + 1, md + 1, ri, arr); } }

int query(int nd, int le, int ri, int st, int en) {
	if (le == ri) {
		return lef[nd][0]; }
	else {
		int md = (le + ri) / 2;
		if (en <= md) {
			return query(nd * 2, le, md, st, en); }
		if (md <  st) {
			return query(nd * 2 + 1, md + 1, ri, st, en); }
		return secret(rig[nd * 2][st - le], lef[nd * 2 + 1][en - (md + 1)]); } } 

int _n;
void Init(int n, int arr[]) {
	build(1, 0, n - 1, arr); _n = n; }

int Query(int le, int ri) {
	return query(1, 0, _n - 1, le, ri); }
/*
int arr[10];

int main(void) {
#ifdef HOME
	freopen("secret.in", "r", stdin);
	freopen("secret.out", "w", stdout);
#endif
	int n; cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> arr[i]; }
	Init(n, arr);
	int m; cin >> m;
	while (m--) {
		int le, ri; cin >> le >> ri;
		int val = arr[le];
		for (int i = le + 1; i <= ri; ++i) {
			val = Secret(val, arr[i]); }
		cout << Query(le, ri) << " " << val << "\n"; }
	return 0; }	
*/

Subtask #1
6.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 3576 KB Output is correct - number of calls to Secret by Init = 4343, maximum number of calls to Secret by Query = 1
2 Correct 190 ms 3708 KB Output is correct - number of calls to Secret by Init = 4352, maximum number of calls to Secret by Query = 1
3 Correct 188 ms 3744 KB Output is correct - number of calls to Secret by Init = 4363, maximum number of calls to Secret by Query = 1
4 Incorrect 646 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9478, maximum number of calls to Secret by Query = 1
5 Incorrect 636 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1
6 Incorrect 628 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1
7 Incorrect 651 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1
8 Incorrect 643 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1
9 Incorrect 669 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1
10 Incorrect 657 ms 6288 KB Output isn't correct - number of calls to Secret by Init = 9488, maximum number of calls to Secret by Query = 1