oj.uz

답안 #197643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197643 2020-01-22T05:20:59 Z Rakhmand 괄호 문자열 (CEOI16_match) C++14
10 / 100
 2000 ms 376 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(l == r) return false;
    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());
    int mid = pos[s[l] - 'a'][right - 1];
    if(rec(l, mid) && rec(mid + 1, r)){
        return true;
    }else{
        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:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < s.size(); i++) {
                    ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Execution timed out 2086 ms 376 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Execution timed out 2086 ms 376 KB Time limit exceeded
5 Halted 0 ms 0 KB -