結果
| 問題 | No.2107 Entangled LIS |
| ユーザー |
 hitonanode
|
| 提出日時 | 2022-10-19 21:43:10 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 14,008 bytes |
| コンパイル時間 | 2,972 ms |
| コンパイル使用メモリ | 205,716 KB |
| 実行使用メモリ | 16,396 KB |
| 最終ジャッジ日時 | 2024-06-29 22:14:08 |
| 合計ジャッジ時間 | 4,956 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 5 ms
6,812 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | AC | 40 ms
6,940 KB |
| testcase_05 | WA | - |
| testcase_06 | AC | 78 ms
7,876 KB |
| testcase_07 | AC | 83 ms
11,844 KB |
| testcase_08 | WA | - |
| testcase_09 | AC | 76 ms
16,396 KB |
| testcase_10 | WA | - |
ソースコード
// WA
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif
template <typename T>
pair<vector<int>, vector<int>> reduce(vector<T> a, vector<T> b) {
vector<T> z = a;
z.insert(z.end(), b.begin(), b.end());
z = sort_unique(z);
vector<int> ret1, ret2;
for (auto &x : a) ret1.push_back(arglb(z, x) + 1);
for (auto &x : b) ret2.push_back(arglb(z, x) + 1);
return {ret1, ret2};
}
pair<vector<int>, vector<int>> build(const int N, const int A, const int B, const string &S) {
if (A == 1 and B == 1) {
vector<int> ret1, ret2;
REP(i, N) {
int g = N * 2 - i * 2;
int s = N * 2 - i * 2 - 1;
if (S[i] == 'a') {
ret1.push_back(g);
ret2.push_back(s);
} else {
ret1.push_back(s);
ret2.push_back(g);
}
}
return {ret1, ret2};
}
if (A < B) {
string T = S;
for (auto &c : T) {
if (c == 'a') {
c = 'b';
} else {
c = 'a';
}
}
auto [f1, f2] = build(N, B, A, T);
// dbg(make_tuple(N, A, B, S, T, f1, f2));
return {f2, f1};
}
const lint LARGE = 1LL << 27;
if (B == 1) {
const int na = count(S.begin(), S.end(), 'a');
const int nb = N - na;
if (na >= A) {
vector<lint> ret1(N, -1), ret2(N, -1);
int rem = A - 1;
REP(i, N) {
if (S.at(i) == 'a') {
ret1.at(i) = -i * 2;
ret2.at(i) = -i * 2 - 1;
} else {
ret1.at(i) = -i * 2 - 1;
ret2.at(i) = -i * 2;
}
if (i > 0 and S.at(i) == 'a' and rem) {
ret1.at(i) = 10 + A - rem;
--rem;
}
}
return reduce(ret1, ret2);
}
if (nb >= A) {
vector<lint> ret1(N, -1), ret2(N, -1);
int rem = A - 1;
IREP(i, N) {
if (S.at(i) == 'a') {
ret1.at(i) = -i * 2;
ret2.at(i) = -i * 2 - 1;
} else {
ret1.at(i) = -i * 2 - 1;
ret2.at(i) = -i * 2;
}
if (i + 1 < N and S.at(i) == 'b' and rem) {
ret1.at(i) = -LARGE + i;
--rem;
}
}
return reduce(ret1, ret2);
}
int left_less = 0, right_more = na;
REP(nl, N + 1) {
// if (left_less + right_more >= A) {
if (left_less + right_more > A) {
vector<lint> ret1(N, -1), ret2(N, -1);
REP(i, N) {
lint base = LARGE * (N - i);
if (S.at(i) == 'a') {
ret1.at(i) = base;
ret2.at(i) = base - 1;
} else {
ret1.at(i) = base - 1;
ret2.at(i) = base;
}
}
int rem = A;
REP(i, N) {
if (rem and ((i < nl) ^ S.at(i) == 'a')) {
--rem;
if (i == nl - 1) continue;
if (S.at(i) == 'a') {
ret1.at(i) = LARGE * (N + 100) + i;
} else {
ret1.at(i) = -LARGE * N + i;
}
}
}
assert(rem == 0);
// dbg(make_tuple(A, B, S, nl, ret1, ret2));
return reduce(ret1, ret2);
}
if (nl < N) {
left_less += (S.at(nl) == 'b');
right_more -= (S.at(nl) == 'a');
}
}
return {{}, {}};
}
int rema = A - 1, remb = B - 1;
vector<int> ret1(N, -1), ret2(N, -1);
int lo = 1, hi = N * 2;
int nbin = count(S.begin() + B - 1, S.begin() + A, 'b');
REP(i, N) {
if (i < A) {
if (i < B - 1 or (i == B - 1 and nbin == 0)) {
if (S.at(i) == 'a') {
ret1.at(i) = i * 2 + 1;
ret2.at(i) = i * 2;
} else {
ret1.at(i) = i * 2;
ret2.at(i) = i * 2 + 1;
}
} else {
ret1.at(i) = i * 2;
if (S.at(i) == 'a') {
ret2.at(i) = -LARGE - i * 2;
} else {
ret2.at(i) = LARGE - i * 2;
}
}
} else {
if (S.at(i) == 'a') {
ret1.at(i) = -LARGE - i * 2;
ret2.at(i) = -LARGE - i * 2 - 1;
} else {
ret1.at(i) = -LARGE - i * 2 - 1;
ret2.at(i) = -LARGE - i * 2;
}
}
}
// dbg(make_tuple(N, A, B, S, ret1, ret2));
return reduce(ret1, ret2);
}
int lislen(const vector<int> &vec) {
constexpr int INF = 1 << 28;
vector<int> dp(vec.size() + 2, INF);
dp[0] = -INF;
int ret = 0;
for (int x : vec) {
int i = arglb(dp, x);
chmax(ret, i);
dp.at(i) = x;
}
return ret;
}
bool judge(int N, int A, int B, const string &S, vector<int> ret1, vector<int> ret2) {
if (ret1.size() != N or ret2.size() != N) {
dbg("invalid length");
return false;
}
vector<int> cntr(N * 2 + 1);
for (const auto &v : {ret1, ret2}) {
for (auto x : v) {
if (cntr.at(x)) {
dbg("duplicate");
return false;
}
if (x == 0) {
dbg("zero");
return false;
}
cntr.at(x)++;
}
}
REP(i, N) {
if ((S[i] == 'a') ^ (ret1[i] > ret2[i])) {
dbg("a / b greater unmatch");
return false;
}
}
if (lislen(ret1) != A) {
dbg("lislen A unmatch");
return false;
}
if (lislen(ret2) != B) {
dbg("lislen B unmatch");
return false;
}
return true;
}
int main() {
FOR(N, 1, 7) {
FOR(A, 1, N + 1) {
FOR(B, 1, N + 1) {
REP(s, 1 << N) {
string S;
REP(i, N) S.push_back(((s >> i) & 1) ? 'b' : 'a');
auto sol = build(N, A, B, S);
if (sol.first.empty()) {
dbg(make_tuple("No solution", N, A, B, S));
continue;
}
if (!judge(N, A, B, S, sol.first, sol.second)) {
dbg(make_tuple(N, A, B, S, sol));
exit(1);
}
}
}
}
}
int T;
cin >> T;
while (T--) {
int N, A, B;
string S;
cin >> N >> A >> B >> S;
auto [f1, f2] = build(N, A, B, S);
if (f1.size()) {
cout << "Yes\n";
for (auto x : f1) cout << x << ' ';
cout << '\n';
for (auto x : f2) cout << x << ' ';
cout << '\n';
} else {
cout << "No\n";
}
}
}