結果

問題 No.3143 Colorless Green Parentheses Sleep Furiously
ユーザー 👑 binap
提出日時 2025-05-16 21:59:27
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 7 ms / 2,000 ms
コード長 2,922 bytes
コンパイル時間 3,761 ms
コンパイル使用メモリ 253,464 KB
実行使用メモリ 7,848 KB
最終ジャッジ日時 2025-05-17 00:27:17
合計ジャッジ時間 5,951 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 49
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

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);}

int main(){
	int n, k;
	cin >> n >> k;
	string s;
	cin >> s;
	int d = 0;
	rep(i, n){
		if(s[i] == '('){
			d++;
		}else{
			d--;
			if(d < 0){
				cout << "No\n";
				return 0;
			}
		}
	}
	if(d == 0){
		int j = 0;
		string t;
		vector<int> memo(100000);
		int d = 0;
		rep(i, n){
			if(s[i] == '('){
				if(i > 0 and s[i - 1] == ')') t += '+';
				d++;
				memo[d] = 0;
				t += '(';
			}else{
				if(memo[d] == 0){
					t += "1+1";
					j += 2;
				}
				if(memo[d] == 1){
					t += "+1";
					j += 1;
				}
				d--;
				t += ')';
				memo[d]++;
			}
		}
		if(j > k) cout << "No\n";
		else{
			while(j < k){
				t += "+1";
				memo[0]++;
				j++;
			}
			if(memo[0] == 1){
				cout << "No\n";
			}else{
				cout << "Yes\n";
				cout << t << "\n";
			}
		}
	}else{
		cout << "No\n";
	}
	return 0;
}
0