結果
| 問題 | No.2107 Entangled LIS |
| ユーザー |
 mtsd
|
| 提出日時 | 2022-10-21 23:49:12 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 14,597 bytes |
| コンパイル時間 | 2,458 ms |
| コンパイル使用メモリ | 214,220 KB |
| 実行使用メモリ | 8,244 KB |
| 最終ジャッジ日時 | 2024-07-01 07:54:38 |
| 合計ジャッジ時間 | 5,478 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | AC | 96 ms
6,940 KB |
| testcase_07 | AC | 99 ms
7,216 KB |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 1000000007
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)
#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)
#define all(x) (x).begin(),(x).end()
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define SZ(c) (int)(c).size()
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
os << "{";
for (int i = 0; i<(int)vec.size(); i++) {
os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// pair出力
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U> pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map出力
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
for(auto itr = map_var.begin(); itr != map_var.end(); itr++){
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
for(auto itr = set_var.begin(); itr != set_var.end(); itr++){
os << (*itr);
++itr;
if(itr != set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// tuple 出力
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
if(N)os<<", ";
os<<get<N>(t);
out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
os<<"(";
out<0,tuple<Ts...>,Ts...>(os,t);
os<<")";
return os;
}
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
const string yesno[2] = {"no", "yes"};
void YES(bool t = 1) { cout << YESNO[t] << endl; }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { cout << YesNo[t] << endl; }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { cout << yesno[t] << endl; }
void no(bool t = 1) { yes(!t); }
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define dbg(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define dbg(...) (void(0))
#define dump(x) (void(0))
#endif
template<typename A, typename T>
std::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
array = val;
}
template<typename A, typename T>
std::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)
{
for (auto& a : array) {
fill(a, val);
}
}
template <typename T, typename S> T ceil(T x, S y) {
assert(y);
return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));
}
template <typename T, typename S> T floor(T x, S y) {
assert(y);
return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));
}
vector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}
template <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}
ll pow2(int i) { return 1LL << i; }
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
// int allbit(int n) { return (1 << n) - 1; }
ll allbit(ll n) { return (1LL << n) - 1; }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
template <class S> void fold_in(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto e : a) v.emplace_back(e);
fold_in(v, tail...);
}
template <class S> void renumber(vector<S> &v) {}
template <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {
for(auto &&e : a) e = lb(v, e);
renumber(v, tail...);
}
template <class S, class... Args> void zip(vector<S> &head, Args &&...args) {
vector<S> v;
fold_in(v, head, args...);
sort(all(v)), v.erase(unique(all(v)), v.end());
renumber(v, head, args...);
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){
a = b;
return true;
}
return false;
}
template<class T> inline bool chmin(T &a, T b){
if(a>b){
a = b;
return true;
}
return false;
}
template< typename T >
size_t longest_increasing_subsequence(const vector< T > &a, bool strict) {
vector< T > lis;
for(auto &p : a) {
typename vector< T >::iterator it;
if(strict) it = lower_bound(all(lis), p);
else it = upper_bound(all(lis), p);
if(end(lis) == it) lis.emplace_back(p);
else *it = p;
}
return lis.size();
}
int main(){
INT(T);
rep(zz,T){
INT(n,A,B);
int pA = A;
int pB = B;
STR(s);
bool rev = 0;
if(A<B){
rev = true;
swap(A,B);
rep(i,n){
s[i] = 'a'+'b' - s[i];
}
}
vec(int,a,n);
vec(int,b,n);
if(B==1){
vec(int,p,n+1);
vec(int,q,n+1);
rep(i,n){
if(s[i]=='a'){
q[i]++;
}else{
p[i+1]++;
}
}
rrep(i,n){
q[i] += q[i+1];
}
rep(i,n){
p[i+1] += p[i];
}
int border = -1;
rep(i,n+1){
if(q[i] + p[i] >= A){
border = i;
break;
}
}
if(border==-1){
cout << "No\n";
continue;
}
dbg(border);
int U = 100000000;
int sb = 70000000;
int sa = 40000000;
int ta = 60000000;
int tb = 50000000;
int down=10000000;
int L = 1;
bool f = true;
rep(i,n){
if(s[i]=='b'){
if(i<border){
if(A>0){
a[i] = sa;
b[i] = sb;
sb--;
sa++;
A--;
f = false;
}else{
a[i] = down-1;
b[i] = down;
down -= 2;
}
}else{
if(f){
a[i] = U-1;
b[i] = U;
U -= 2;
}else{
a[i] = down-1;
b[i] = down;
down -= 2;
}
}
}else{
if(i>=border){
if(A>0){
a[i] = ta;
b[i] = tb;
tb--;
ta++;
A--;
f = false;
}else{
a[i] = down;
b[i] = down-1;
down -= 2;
}
}else{
if(f){
a[i] = U;
b[i] = U-1;
U -= 2;
}else{
a[i] = down;
b[i] = down-1;
down -= 2;
}
}
}
}
}else{
int va = 50000000;
int vb = 49999999;
int L = 1;
int U = 100000000;
int l = 0;
int r = n-1;
while(A>B){
if(s[l]=='b'){
a[l] = L;
b[l] = U;
l++;
L++;
U--;
A--;
continue;
}
if(s[r]=='a'){
a[r] = U;
b[r] = L;
r--;
L++;
U--;
A--;
continue;
}
break;
}
if(A>B){
B--;
}
while(A>B){
if(s[l]=='a'){
a[l] = va;
b[l] = vb;
va++;
vb--;
A--;
}else{
a[l] = va;
b[l] = U;
va++;
U--;
A--;
}
l++;
}
// l ~ r までを va ~ U で作る (va+1,va+2)...()
dbg(A);
int down = U-A*2;
int up = U-A*2+1;
if((r-l+1)<A)assert(0);
for(int i=l;i<=r;i++){
if(i<l+A){
if(s[i]=='a'){
a[i] = up+1;
b[i] = up;
}else{
a[i] = up;
b[i] = up+1;
}
up += 2;
}else{
if(s[i]=='a'){
a[i] = down;
b[i] = down-1;
}else{
a[i] = down-1;
b[i] = down;
}
down -= 2;
}
}
}
if(rev){
swap(a,b);
}
zip(a,b);
// if(longest_increasing_subsequence(a,true)!=pA||longest_increasing_subsequence(b,true)!=pB){
// assert(0);
// }
cout << "Yes\n";
rep(i,n)cout << a[i]+1 << " \n"[i==n-1];
rep(i,n)cout << b[i]+1 << " \n"[i==n-1];
}
return 0;
}