oj.uz

답안 #1100462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100462 2024-10-14T03:23:48 Z anhphant 비밀 (JOI14_secret) C++14
0 / 100
 313 ms 4796 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long  ll;

int N, A[1000007], Q;
ll dat[17][1007], mask[1007];

// int Secret(int a, int b) {
// 	return a + b;
// }

void divi(ll l, ll r, ll lev) {
	if (l == r) return;
	ll mid = (l + r) / 2;
	dat[lev][mid] = A[mid];
	for(int i = mid - 1; i >= l; --i) {
		dat[lev][i] = Secret(A[i], dat[lev][i + 1]);
	}
	dat[lev][mid + 1] = A[mid + 1];
	for(int i = mid + 2; i <= r; ++i) {
		dat[lev][i] = Secret(dat[lev][i - 1], A[i]);
	}
	for(int i = mid + 1; i <= r; ++i) mask[i] ^= (1 << lev);
	divi(l, mid, lev + 1);
	divi(mid + 1, r, lev + 1);
}

void Init(int N, int A[]) {
	cin >> N;
	for(int i = 1; i <= N; ++i) cin >> A[i];

	divi(1, N, 0);
}

int Query(int l, int r) {
	if (l == r) return A[l];
	int bits = __builtin_ctz(mask[l] ^ mask[r]);
	return Secret(dat[bits][l], dat[bits][r]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 77 ms 4796 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912.
2 Incorrect 78 ms 4796 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0.
3 Incorrect 80 ms 4692 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912.
4 Incorrect 299 ms 4692 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912.
5 Incorrect 307 ms 4684 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912.
6 Incorrect 305 ms 4692 KB Wrong Answer: Query(915, 915) - expected : 282904741, actual : 0.
7 Incorrect 307 ms 4684 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0.
8 Incorrect 307 ms 4684 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912.
9 Incorrect 304 ms 4684 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0.
10 Incorrect 313 ms 4692 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0.