oj.uz

Submission #1032667

# Submission time Handle Problem Language Result Execution time Memory
1032667 2024-07-24T06:00:04 Z 김은성(#10965) Match (CEOI16_match) C++17
37 / 100
 2000 ms 856 KB 
#include <bits/stdc++.h>
using namespace std;
char s[100009], t[100009];
int n;
bool possible(int idx, vector<char> st){
    int i;
    for(i=idx; i<n; i++){
        if(!st.empty() && st.back() == s[i])
            st.pop_back();
        else
            st.push_back(s[i]);
    }
    return st.empty();
}
int main(){
    int i;
    scanf(" %s", s);
    n = strlen(s);
    vector<char> st;
    if(!possible(0, st)){
        printf("-1\n");
        return 0;
    }
    for(i=0; i<n; i++){
        st.push_back(s[i]);
        t[i] = '(';
        if(st.size()>1 && st[st.size()-2] == s[i]){
            if(!possible(i+1, st)){
                t[i] = ')';
                st.pop_back();
                st.pop_back();
            }
        }
    }
    printf("%s\n", t);
    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 22 ms 448 KB Output is correct
9 Correct 26 ms 344 KB Output is correct
10 Correct 23 ms 432 KB Output is correct
11 Correct 19 ms 492 KB Output is correct
12 Correct 1326 ms 584 KB Output is correct
13 Correct 1522 ms 704 KB Output is correct
14 Execution timed out 2075 ms 856 KB Time limit exceeded
15 Halted 0 ms 0 KB -