Codeforces Round #712 DIV1 A問題 (750pt)
Codeforces Round #712 DIV2 C問題 (1750pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N; char S[2d5+2];
char A[], B[];
{
REP(rd_int()){
int on, x = 0, y = 0;
rd(N,S);
on = arrCountVal(N,S,'1');
if(on % 2) wt("NO"), continue;
rep(i,N) if(S[i]=='1') A[i] = B[i] = if[x < on/2, '(', ')'], x++;
rep(i,N) if(S[i]=='0'){
A[i] = '(';
B[i] = ')';
if((y++)%2) swap(A[i], B[i]);
}
if(isValidBracket1(N,A)==0 || isValidBracket1(N,B)==0) wt("NO"), continue;
A[N] = B[N] = '\0';
wtLn("YES", A, B);
}
}
Current time: 2024年03月29日16時55分18秒
Last modified: 2021年04月04日05時30分44秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF712 CF_DIV1_A CF_DIV2_C
トップページに戻る
Logged in as: unknown user (not login)