oj.uz

답안 #133335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133335 2019-07-20T12:17:05 Z egorlifar 비밀 (JOI14_secret) C++17
0 / 100
 602 ms 4584 KB 
#include "secret.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const int MAXN = 1003;


int n;
int val[MAXN][10];
int val1[MAXN][10];


void Init(int N, int A[]) {
	n = N;
	for (int i = 1; i <= n; i++) {
		val[i][0] = A[i - 1];
		val1[i][0] = A[i - 1];
	}
	for (int k = 1; k <= 9; k++) {
		for (int i = 1; i <= n; i++) {
			int f = i % (1 << k);
			if (i == 1 || f == 0) {
				val[i][k] = val[i][k - 1];
				continue;
			}
			if (i - f == i - i % (1 << (k - 1))) {
				val[i][k] = val[i][k - 1];
			} else {
				val[i][k] = Secret(val[i - 1][k], val[i][0]);
			}
		}
		for (int i = n; i >= 1; i--) {
			// if (i % (1 << k) == 0) {
			// 	val1[i][k] = val[min(n - 1, i + (1 << k) - 1)][k];
			// 	continue;
			// }
			if (i == n || (i % (1 << k)) == (1 << k) - 1) {
				val1[i][k] = val1[i][0];
				continue;
			} else {
				val1[i][k] = Secret(val1[i][0], val1[i + 1][k]);
			}
			// int g = i % (1 << k);
			// int ft = (1 << k) - g - 1;
			// int g1 = i % (1 << (k - 1));
			// int ft1 = (1 << (k - 1)) - g1 - 1;
			// int h = i + ft;
			// int h1 = i + ft1;
			// if (h == h1) {
			// 	val1[i][k] = val1[i][k - 1];
			// } else {
			// 	val1[i][k] = Secret(val1[i][0], val1[i + 1][k]);
			// }
		}
	}
}


int Query(int L, int R) {
	int l = L;
	int r = R;
	l++;
	r++;
	int f = 0;
	int g;
	bool was = false;
	for (g = 1; g <= 512; g++) {
		int pos = -1;
		for (int i = l; i <= r; i++) {
			if (i % g == 0) {
				pos = i;
				break;
			}
		}
		if (pos != -1 && pos + g > r) {
			was = true;
			break;
		}
		f++;
	}
	assert(was);
	if (l % g == 0) {
		return val[r][f];
	}
	return Secret(val1[l][f], val[r][f]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 166 ms 2552 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 302259546.
2 Incorrect 163 ms 2488 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 207696192.
3 Incorrect 164 ms 2548 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 427073154.
4 Incorrect 601 ms 4532 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 906641635.
5 Incorrect 602 ms 4472 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 250533494.
6 Incorrect 592 ms 4584 KB Wrong Answer: Query(26, 30) - expected : 321366825, actual : 461663353.
7 Incorrect 601 ms 4504 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 762329193.
8 Incorrect 592 ms 4472 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 947036496.
9 Incorrect 597 ms 4524 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 147339631.
10 Incorrect 595 ms 4480 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 612303235.