oj.uz

답안 #175851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
175851 2020-01-07T11:32:15 Z Ruxandra985 괄호 문자열 (CEOI16_match) C++14
37 / 100
 2000 ms 15368 KB 
#include <bits/stdc++.h>
#pragma GCC optimize "Ofast"
using namespace std;
int sp[30][100010];
char sol[100010] , s[100010];
int ok;
int stk[100010] , pre[30][100010];
int match (int st , int dr){
    int i , elem = 0;
    if (st > dr)
        return 1;
    for (i=0;i<'z' - 'a';++i){
        if (((sp[i][dr] - sp[i][st-1]) & 1) == 1)
            return 0;
    }

    for (i=st;i<=dr;++i){
        if (stk[elem] == s[i])
            elem--;
        else stk[++elem] = s[i];
    }
    return (elem == 0);

}
void solve (int st , int dr){
    int i;
    if (st > dr)
        return;
    if (!ok) /// nu mai are rost
        return;
    /// stii ca pe st pui ( , gaseste i match ul

    for (i = pre[s[st]][dr]; i >= st + 1 ; i = pre[s[st]][i-1]){
        if (match(st + 1 , i - 1) && match(i + 1 , dr))
            break;
    }
    if (i < st + 1){
        ok = 0;
        return;
    }
    else {
        sol[st] = '(';
        sol[i] = ')';
        solve(st + 1 , i - 1);
        solve (i + 1 , dr);
    }
}
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int n , i;
    fgets (s+1 , 100010 , fin);

    n = 0;
    while ( 'a' <= s[n+1] && s[n+1] <= 'z' ){
        n++;
        s[n]-='a';

        for (i=0;i<='z'-'a';++i){
            sp[i][n] = sp[i][n-1] + (s[n] == i);
            if (i == s[n])
                pre[i][n] = n;
            else pre[i][n] = pre[i][n-1];
        }
    }
    stk[0] = -1;
    ok = 1;
    solve (1 , n);
    if (ok == 0){
        fprintf (fout,"-1");
    }
    else {
        fputs (sol+1,fout);
    }
    return 0;
}

Compilation message

match.cpp: In function 'void solve(int, int)':
match.cpp:33:23: warning: array subscript has type 'char' [-Wchar-subscripts]
     for (i = pre[s[st]][dr]; i >= st + 1 ; i = pre[s[st]][i-1]){
                       ^
match.cpp:33:57: warning: array subscript has type 'char' [-Wchar-subscripts]
     for (i = pre[s[st]][dr]; i >= st + 1 ; i = pre[s[st]][i-1]){
                                                         ^
match.cpp: In function 'int main()':
match.cpp:53:11: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     fgets (s+1 , 100010 , fin);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/stdio.h:936:0,
                 from /usr/include/c++/7/cstdio:42,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:46,
                 from match.cpp:1:
In function 'char* fgets(char*, int, FILE*)',
    inlined from 'int main()' at match.cpp:53:11:
/usr/include/x86_64-linux-gnu/bits/stdio2.h:261:58: warning: call to '__fgets_chk_warn' declared with attribute warning: fgets called with bigger size than length of destination buffer
  return __fgets_chk_warn (__s, __bos (__s), __n, __stream);
                                                          ^

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 7 ms 1016 KB Output is correct

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 7 ms 1016 KB Output is correct
8 Correct 14 ms 1912 KB Output is correct
9 Correct 97 ms 2112 KB Output is correct
10 Correct 21 ms 2040 KB Output is correct
11 Correct 28 ms 2044 KB Output is correct
12 Correct 1113 ms 13324 KB Output is correct
13 Correct 1066 ms 14220 KB Output is correct
14 Execution timed out 2050 ms 15368 KB Time limit exceeded
15 Halted 0 ms 0 KB -