#974570 (C++14) No.2735 Demarcation

• 問題: No.2735 Demarcation
• ユーザー: startcpp
• 提出日時: 2024-04-19 23:15:01
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 2,500 bytes
• コンパイル時間: 1,179 ms
• コンパイル使用メモリ: 86,712 KB
• 実行使用メモリ: 43,648 KB
• 最終ジャッジ日時: 2024-10-11 17:40:30
• 合計ジャッジ時間: 13,965 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	RE	-
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	RE	-
testcase_04	RE	-
testcase_05	RE	-
testcase_06	RE	-
testcase_07	RE	-
testcase_08	WA	-
testcase_09	RE	-
testcase_10	RE	-
testcase_11	RE	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	AC	244 ms; 8,576 KB
testcase_22	AC	294 ms; 10,752 KB
testcase_23	RE	-
testcase_24	RE	-
testcase_25	RE	-
testcase_26	AC	270 ms; 36,448 KB
testcase_27	WA	-
testcase_28	RE	-
testcase_29	AC	392 ms; 43,008 KB

ソースコード

#include <iostream>
#include <vector>
#include <bitset>
#include <atcoder/segtree>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;

const int INF = (1LL << 60) + 1;
int op(int a, int b) {
	if (a > INF / b) return INF;
	return a * b;
}
int e() { return 1; }

int n, q;
vector<int> X, ls, rs, s;

void input() {
	int i;
	cin >> n;
	X.resize(n);
	rep(i, n) cin >> X[i];
	cin >> q;
	ls.resize(q);
	rs.resize(q);
	s.resize(q);
	rep(i, q) {
		cin >> ls[i] >> rs[i] >> s[i];
		ls[i]--;
	}
}

int solve_dp(vector<int> &X, int l, int r, int s) {
	int i, j, n = r - l;
	vector<int> a(n), sa(n);
	rep(i, n) { a[i] = X[l + i]; sa[i] = a[i]; }
	sort(sa.begin(), sa.end());
	sa.erase(unique(sa.begin(), sa.end()));
	rep(i, n) { a[i] = lower_bound(sa.begin(), sa.end(), a[i]) - sa.begin(); }

	int ok = 0, ng = n + 1, mid;
	bool kusira = false;
	while (ng - ok >= 2) {
		mid = (ok + ng) / 2;
		vector<int> dp(n + 1);
		dp[0] = 1;
		rep(i, n) {
			bitset<90> bs; int cnt = 0;
			for (j = i + 1; j <= n; j++) {
				if (!bs[a[j - 1]]) { bs[a[j - 1]] = 1; cnt++; }
				if (cnt > mid) { break; }
				dp[j] += dp[i];
				if (dp[j] > s) { kusira = true; break; }
			}
			if (kusira) break;
		}
		if (kusira) ng = mid;
		else ok = mid;
	}
	if (ok >= n) return -1;
	return ok;
}

vector<int> poses, cnts;

void shokorassyo(int midori_coder_tuyoi = 89) {
	poses.push_back(0);
	for (int i = 1; i < n; i++) {
		if (X[i - 1] != X[i]) {
			poses.push_back(i);
		}
	}
	poses.push_back(n);

	for (int i = 0; i < (int)poses.size() - 1; i++) {
		int interval = poses[i + 1] - poses[i];
		int val = (interval > 61) ? INF : (1LL << (interval - 1));
		cnts.push_back(val);
	}

	segtree<int, op, e> seg(cnts);
	vector<int> ans(q);
	for (int i = 0; i < q; i++) {
		if (rs[i] - ls[i] < midori_coder_tuyoi) {
			cout << solve_dp(X, ls[i], rs[i], s[i]) << endl;
		}
		else {
			int it1 = lower_bound(poses.begin(), poses.end(), ls[i]) - poses.begin();
			int it2 = upper_bound(poses.begin(), poses.end(), rs[i]) - poses.begin(); it2--;
			int pro = seg.prod(it1, it2);
			int inter1 = poses[it1] - ls[i]; int val1 = (inter1 > 61) ? INF : (1LL << inter1);
			int inter2 = rs[i] - poses[it2]; int val2 = (inter2 > 61) ? INF : (1LL << inter2);
			if (val1 <= INF / pro) pro *= val1; else pro = INF;
			if (val2 <= INF / pro) pro *= val2; else pro = INF;
			if (pro >= INF) cout << 0 << endl;
			else cout << 1 << endl;
		}
	}
}

signed main() {
	input();
	shokorassyo();
	return 0;
}