oj.uz

답안 #100748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100748 2019-03-14T05:58:10 Z Retro3014 괄호 문자열 (CEOI16_match) C++17
10 / 100
 71 ms 68520 KB 
#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAX_N = 100000;
const int MAX_K = 26;

string str;
vector<char> v;
int cnt = 1, N;
vector<int> gp[MAX_N+1][MAX_K+3];
int idx[MAX_N+1][MAX_K+2];
pii arr[MAX_N+1];

deque<pii> dq;
int st[MAX_N+1];

void answer(int x, int y){
	dq.push_back({x, y});
	pii now;
	int p, s, e, m;
	while(!dq.empty()){
		x = dq.front().first; y = dq.front().second;
		//cout<<x<<' '<<y<<endl;
		//getchar();
		dq.pop_front();
		if(x==y && y==-1){
			printf(")"); continue;
		}
		if(x>=y)	continue;
		now = arr[x];
		now.first = st[x];
		//cout<<now.first<<' '<<now.second<<endl;
		s = 0, e = gp[now.first][now.second].size()-1, m = 0;
		while(s<e){
			m = (s+e)/+1;
			if(gp[now.first][now.second][m]<=y)	s = m;
			else e = m-1;
		}
		p = gp[now.first][now.second][m];
		//cout<<p<<endl;
		printf("(");
		dq.push_front({p+1, y});
		dq.push_front({-1, -1});
		dq.push_front({x+1, p-1});
	}
}


int main(){
	cin>>str; N = str.size();
	for(int i=0; i<str.size(); i++){
		if(!v.empty() && v.back()==str[i])	v.pop_back();
		else	v.push_back(str[i]);
	}
	if(!v.empty()){
		cout<<-1; return 0;
	}
	int now = 1;
	for(int i=0; i<N; i++){
		st[i] = now;
		if(!v.empty() && v.back()==str[i]){
			now = idx[now][0];
			v.pop_back();
		}else{
			if(idx[now][str[i]-'a'+1]!=0){
				now = idx[now][str[i]-'a'+1];
			}else{
				idx[now][str[i]-'a'+1] = ++cnt;
				idx[cnt][0] = now;
				now = cnt;
			}
			v.push_back(str[i]);
		}
		gp[now][str[i]-'a'+1].push_back(i);
		arr[i] = {now, str[i]-'a'+1};
		//cout<<arr[i].first<<" "<<arr[i].second<<endl;
	}
	answer(0, N-1);
	return 0;
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:71:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<str.size(); i++){
               ~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 68472 KB Output is correct
2 Correct 66 ms 68472 KB Output is correct
3 Correct 70 ms 68472 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 68472 KB Output is correct
2 Correct 66 ms 68472 KB Output is correct
3 Correct 70 ms 68472 KB Output is correct
4 Incorrect 71 ms 68520 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 68472 KB Output is correct
2 Correct 66 ms 68472 KB Output is correct
3 Correct 70 ms 68472 KB Output is correct
4 Incorrect 71 ms 68520 KB Output isn't correct
5 Halted 0 ms 0 KB -