結果
| 問題 | No.2107 Entangled LIS |
| ユーザー |
 heno239
|
| 提出日時 | 2022-10-22 00:06:52 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,631 bytes |
| コンパイル時間 | 2,558 ms |
| コンパイル使用メモリ | 168,556 KB |
| 実行使用メモリ | 23,012 KB |
| 最終ジャッジ日時 | 2023-09-14 00:09:43 |
| 合計ジャッジ時間 | 5,452 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 12 ms
19,812 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | AC | 45 ms
21,216 KB |
| testcase_07 | AC | 46 ms
22,812 KB |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
ソースコード
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
template<typename T>
void chmin(T& a, T b) {
a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
rep(i, v.size()) {
if (i > 0)cout << " "; cout << v[i];
}
cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
if (n < 0) {
ll res = mod_pow(x, -n, m);
return mod_pow(res, m - 2, m);
}
if (abs(x) >= m)x %= m;
if (x < 0)x += m;
//if (x == 0)return 0;
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
//mod should be <2^31
struct modint {
int n;
modint() :n(0) { ; }
modint(ll m) {
if (m < 0 || mod <= m) {
m %= mod; if (m < 0)m += mod;
}
n = m;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[a - b];
}
ll gcd(ll a, ll b) {
a = abs(a); b = abs(b);
if (a < b)swap(a, b);
while (b) {
ll r = a % b; a = b; b = r;
}
return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
if (loc >= v.size())v.resize(loc + 1, 0);
v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
fill(isp + 2, isp + mn, true);
for (int i = 2; i < mn; i++) {
if (!isp[i])continue;
ps.push_back(i);
for (int j = 2 * i; j < mn; j += i) {
isp[j] = false;
}
}
}*/
//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
auto res = st.lower_bound(val);
if (res == st.begin())return st.end();
res--; return res;
}
//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
auto res = st.lower_bound(val);
return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
a = a + b; return a;
}
mP operator-(mP a, mP b) {
return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
a = a - b; return a;
}
LP operator+(LP a, LP b) {
return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
a = a + b; return a;
}
LP operator-(LP a, LP b) {
return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
a = a - b; return a;
}
mt19937 mt(time(0));
const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------
int lis(vector<int> &v) {
vector<int> dp(v.size());
int res = 0;
rep(i, v.size()) {
dp[i] = 1;
rep(j, i)if (v[j] < v[i])chmax(dp[i], dp[j] + 1);
chmax(res, dp[i]);
}
return res;
}
bool exi[1<<10][10][10];
void expr() {
int n = 6;
vector<int> v(2 * n);
rep(i, 2 * n)v[i] = i;
vector<int> a(n), b(n);
do {
rep(i, n) {
a[i] = v[i];
b[i] = v[i + n];
}
int s = 0;
rep(i, n) {
if (a[i] > b[i])s |= (1 << i);
}
exi[s][lis(a)][lis(b)] = true;
} while (next_permutation(all(v)));
rep(i, (1<<n)) {
cout << "hello ";
rep(j, n) {
if (i & (1 << j))cout << 1;
else cout << 0;
}cout << "\n";
rep1(x, n) {
rep1(y, n)cout << exi[i][x][y]; cout << "\n";
}
}
}
using arp = pair<vector<int>, vector<int>>;
arp mkar(int n, int x,string s) {
arp res;
res.first.resize(n);
res.second.resize(n);
int len = x;
Rep(i, x, n)if (s[i] == 'a') {
len--; break;
}
int tmp = 1;
for (int i = n - 1; i >= len; i--)if (s[i] == 'b') {
res.first[i] = tmp; tmp++;
}
for (int i = 0; i < len; i++) {
if (s[i] == 'a') {
res.second[i] = tmp; tmp++;
res.first[i] = tmp; tmp++;
}
else {
res.first[i] = tmp; tmp++;
res.second[i] = tmp; tmp++;
}
}
for (int i = len; i < n; i++) {
res.second[i] = tmp; tmp++;
}
for (int i = n - 1; i >= len; i--)if (s[i] == 'a') {
res.first[i] = tmp; tmp++;
}
assert(tmp == 2 * n + 1);
return res;
}
void solve() {
int n, a, b; cin >> n >> a >> b;
string s; cin >> s;
bool swa = false;
if (a > b) {
swa = true;
swap(a, b);
rep(i, s.size())s[i] = 'a' + 'b' - s[i];
}
//cout << "??? " << a << " " << b << " " << swa << " " << s << "\n";
if (a == 1) {
arp ans;
ans.first.resize(n);
ans.second.resize(n);
if (b == 1) {
int tmp = 1;
per(i, n) {
if (s[i] == 'a') {
ans.second[i] = tmp; tmp++;
ans.first[i] = tmp; tmp++;
}
else {
ans.first[i] = tmp; tmp++;
ans.second[i] = tmp; tmp++;
}
}
cout << "Yes\n";
if (swa)swap(ans.first, ans.second);
coutarray(ans.first);
coutarray(ans.second);
}
else {
vector<int> cnta(n + 1), cntb(n + 1);
rep(i, n) {
cnta[i + 1] = cnta[i];
cntb[i + 1] = cntb[i];
if (s[i] == 'a')cnta[i + 1]++;
if (s[i] == 'b')cntb[i + 1]++;
}
int ci = -1;
rep(i, n+1) {
int sum = cnta[i] + cntb[n] - cntb[i];
if (i < n && s[i] == 'a')continue;
if (i > 0 && s[i - 1] == 'b')continue;
if (sum >= b) {
ci = i; break;
}
}
if (ci < 0) {
cout << "No\n"; return;
}
vector<bool> used(n);
int rest = b;
if (ci == 0) {
rep(i, n)if (s[i] == 'b') {
if (rest > 0) {
used[i] = true;
rest--;
}
}
}
else if (ci == n) {
per(i, n)if (s[i] == 'a') {
if (rest > 0) {
used[i] = true;
rest--;
}
}
}
else {
assert(s[ci - 1] == 'a' && s[ci] == 'b');
rest -= 2;
used[ci] = true;
used[ci - 1] = true;
for (int j =ci + 1; j < n; j++)if (s[j] == 'b') {
if (rest > 0) {
used[j] = true;
rest--;
}
}
for (int j = ci - 2; j >= 0; j--)if (s[j] == 'a') {
if (rest > 0) {
used[j] = true;
rest--;
}
}
}
int tmp = 1;
rep(i, n)if (s[i] == 'b')if (used[i]) {
ans.second[i] = tmp; tmp++;
}
per(i, n) {
if (!used[i]) {
if (s[i] == 'a') {
ans.second[i] = tmp; tmp++;
ans.first[i] = tmp; tmp++;
}
else {
ans.first[i] = tmp; tmp++;
ans.second[i] = tmp; tmp++;
}
}
else {
ans.first[i] = tmp; tmp++;
}
}
rep(i, n)if (s[i] == 'a')if (used[i]) {
ans.second[i] = tmp; tmp++;
}
assert(tmp == 2 * n + 1);
cout << "Yes\n";
if (swa)swap(ans.first, ans.second);
coutarray(ans.first);
coutarray(ans.second);
}
}
else {
int dif = n - b;
string t = s;
t.erase(t.begin(), t.begin() + dif);
arp ansp = mkar(b, a, t);
arp ans;
ans.first.resize(n);
ans.second.resize(n);
int tmp = 2 * b + 1;
for (int i = dif - 1; i >= 0; i--) {
if (s[i] == 'a') {
ans.second[i] = tmp; tmp++;
ans.first[i] = tmp; tmp++;
}
else {
ans.first[i] = tmp; tmp++;
ans.second[i] = tmp; tmp++;
}
}
for (int i = dif; i < n; i++) {
ans.first[i] = ansp.first[i - dif];
ans.second[i] = ansp.second[i - dif];
}
//cout << "?? " << tmp << "\n";
assert(tmp == 2 * n + 1);
cout << "Yes\n";
if (swa)swap(ans.first, ans.second);
coutarray(ans.first);
coutarray(ans.second);
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//expr();
//while(true)
int t; cin >> t; rep(i, t)
solve();
return 0;
}