| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 197635 |
2020-01-22T05:05:51 Z |
Rakhmand |
Match (CEOI16_match) |
C++14 |
|
6 ms |
504 KB |
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer {cout << "NO"; exit(0);}
#define vectors vector<vector<llong> >
#define FOR(i, start, finish, k) for(llong i = start; i <= finish; i += k)
const long long MXN = 2e5 + 10;
const long long MNN = 2e3 + 520;
const long long MOD = 2012;
const long long INF = 1e18;
const long long OO = 4e9;
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
string s;
string ans = "";
vector<int> pos[30];
bool rec(int l, int r){
if(l > r) return true;
if(s[l] == s[r] && l < r){
bool ok = rec(l + 1, r - 1);
if(ok == true){
ans[l] = '(';
ans[r] = ')';
return true;
}
}
int right = (lower_bound(pos[s[l] - 'a'].begin(), pos[s[l] - 'a'].end(), r) - pos[s[l] - 'a'].begin());
for(int i = right - 1; i ; i--){
int mid = pos[s[l] - 'a'][i];
if(mid == l) break;
if(rec(l, mid) && rec(mid + 1, r)){
ans[l] = ans[mid + 1] = '(';
ans[mid] = ans[r] = ')';
return true;
}
}
return false;
}
int main() {
ios;
cin >> s;
for(int i = 0; i < s.size(); i++) {
ans += '-';
pos[s[i] - 'a'].pb(i);
}
bool ok = rec(0, s.size() - 1);
if(ok == 0) cout << -1;
else cout << ans;
}
Compilation message
match.cpp: In function 'int main()':
match.cpp:77:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < s.size(); i++) {
~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
6 ms |
376 KB |
Output is correct |
| 3 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
6 ms |
376 KB |
Output is correct |
| 3 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
6 ms |
376 KB |
Output is correct |
| 3 |
Runtime error |
2 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
