oj.uz

Submission #221139

# Submission time Handle Problem Language Result Execution time Memory
221139 2020-04-09T15:20:23 Z DodgeBallMan Match (CEOI16_match) C++14
10 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
char s[N], ans[N];
int n, last[N][30];

void solve( int l, int r ) {
    if( l > r ) return ;
    if( l % 2 == r % 2 ) {
        printf("-1");
        exit( 0 );
    }
    int idx = last[r][s[l]-'a'];
    ans[l] = '(', ans[idx] = ')';
    solve( l + 1, idx-1 ), solve( idx+1, r );
}

int main()
{
    scanf("%s",&s[1]);
    n = strlen( &s[1] );
    for( int i = 1 ; i <= n ; i++ ) {
        int now = s[i] - 'a';
        for( int j = 0 ; j < 26 ; j++ ) {
            if( j == now ) last[i][j] = i;
            else last[i][j] = last[i-1][j];
        }
    }
    solve( 1, n );
    for( int i = 1 ; i <= n ; i++ ) printf("%c",ans[i]);
    return 0;
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:22:10: 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 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -