oj.uz

답안 #243308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
243308 2020-06-30T22:14:16 Z Rainbowbunny 비밀 (JOI14_secret) C++17
0 / 100
 20000 ms 4600 KB 
#include <bits/stdc++.h>
#include "secret.h"
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
 
typedef pair <int, int> pii;
 
const int Inf = 2e9;
const int mod = 998244353;
const double Pi = acos(-1);
 
void Fastio()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
}

int n;
int A[1005];
int Table[10][1005];

void Build(int h, int l, int r)
{
	if(r - l <= 1)
	{
		return;
	}
	int mid = (l + r) >> 1;
	Table[h][mid] = A[mid];
	Table[h][mid - 1] = A[mid - 1];
	for(int i = mid + 1; i <= r; i++)
	{
		Table[h][i] = Secret(Table[h][i - 1], A[i]);
	}
	for(int i = mid - 2; i >= l; i--)
	{
		Table[h][i] = Secret(A[i], Table[h][i + 1]);
	}
	Build(h + 1, l, mid - 1);
	Build(h + 1, mid, r);
}

int Get(int l, int r, int h, int L, int R)
{
	int mid = (L + R) >> 1;
	if(r <= mid)
	{
		return Get(l, r, h + 1, L, mid - 1);
	}
	if(l >= mid)
	{
		return Get(l, r, h + 1, mid, R);
	}
	return Secret(Table[h][l], Table[h][r]);
}

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

int Query(int l, int r)
{
	if(r == l)
	{
		return A[l];
	}
	else if(r - l == 1)
	{
		return Secret(A[l], A[l + 1]);
	}
	else
	{
		return Get(l, r, 0, 0, n - 1);
	}
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 135 ms 2556 KB Wrong Answer: Query(25, 255) - expected : 538271930, actual : 51390112.
2 Execution timed out 20044 ms 2556 KB Time limit exceeded
3 Incorrect 138 ms 2552 KB Wrong Answer: Query(352, 384) - expected : 142799164, actual : 680636466.
4 Incorrect 499 ms 4476 KB Wrong Answer: Query(514, 748) - expected : 885539008, actual : 97722890.
5 Incorrect 504 ms 4600 KB Wrong Answer: Query(70, 76) - expected : 75622482, actual : 533149696.
6 Incorrect 494 ms 4448 KB Wrong Answer: Query(26, 30) - expected : 321366825, actual : 666015328.
7 Partially correct 515 ms 4388 KB Output isn't correct - number of calls to Secret by Init = 8141, maximum number of calls to Secret by Query = 1
8 Partially correct 521 ms 4572 KB Output isn't correct - number of calls to Secret by Init = 8141, maximum number of calls to Secret by Query = 1
9 Partially correct 507 ms 4472 KB Output isn't correct - number of calls to Secret by Init = 8141, maximum number of calls to Secret by Query = 1
10 Partially correct 510 ms 4600 KB Output isn't correct - number of calls to Secret by Init = 8141, maximum number of calls to Secret by Query = 1