oj.uz

Submission #146419

# Submission time Handle Problem Language Result Execution time Memory
146419 2019-08-24T00:12:28 Z cheetose Match (CEOI16_match) C++11
100 / 100
 17 ms 11388 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

char s[100005];
int p[100005][26],c[100005];
void solve(int l,int r)
{
	if(l>r)return;
	if(s[l]==s[r])
	{
		s[l]='(',s[r]=')';
		solve(l+1,r-1);
		return;
	}
	int t=p[r][s[l]-'a'];
	solve(l,t);
	solve(t+1,r);
}
int main() {
	scanf("%s",s+1);
	int n=strlen(s+1);
	stack<char> st;
	fup(i,1,n,1)
	{
		if(st.empty() || s[i]!=st.top())st.push(s[i]);
		else st.pop();
	}
	if(st.size())return !printf("-1");
	fup(i,2,n,1)
	{
		int cc=s[i]-'a';
		if(s[i-1]==s[i])c[i]=i-1;
		else c[i]=p[i-1][cc];
		if(!c[i])continue;
		fup(j,0,25,1)
		{
			if(j==cc)continue;
			if(s[c[i]-1]=='a'+j)p[i][j]=c[i]-1;
			else p[i][j]=p[c[i]-1][j];
		}
	}
	solve(1,n);
	printf("%s",s+1);
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 4 ms 1144 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 13 ms 6820 KB Output is correct
13 Correct 12 ms 7160 KB Output is correct
14 Correct 13 ms 8056 KB Output is correct
15 Correct 14 ms 9080 KB Output is correct
16 Correct 14 ms 9080 KB Output is correct
17 Correct 14 ms 9592 KB Output is correct
18 Correct 16 ms 10104 KB Output is correct
19 Correct 17 ms 10744 KB Output is correct
20 Correct 11 ms 6904 KB Output is correct
21 Correct 17 ms 11388 KB Output is correct