oj.uz

Submission #423814

# Submission time Handle Problem Language Result Execution time Memory
423814 2021-06-11T13:00:26 Z egekabas parentrises (BOI18_parentrises) C++14
100 / 100
 156 ms 6260 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
///////////////////////////////////////////burayi degistir
void solve1(){
    string s;
    cin >> s;
    int n = s.size();
    int cur = 0;
    int mini = 0;
    for(int i = 0; i < n; ++i){
        if(s[i] == '(')
            cur++;
        else
            cur--;
        mini = min(mini, cur);
    }
    vector<int> ans(n);
    mini *= -1;
    for(int i = 0; i < n; ++i){
        if(mini > 0 && s[i] == '('){
            ans[i] = 1;
            --mini;
            ++cur;
        }
    }
    if(mini > 0){
        cout << "impossible\n";
        return;
    }
    for(int i = n-1; i >= 0; --i){
        if(s[i] == '(')
            continue;
            
        if(cur > 0){
            ans[i] = 1;
            --cur;
        }
    }
    if(cur > 0){
        cout << "impossible\n";
        return;
    }
    cur = 0;
    for(int i = 0; i < n; ++i){
        if(s[i] == '(')
            cur++;
        else
            cur--;
        if(ans[i]){
            if(s[i] == '(')
                cur++;
            else
                cur--;    
        }
        if(cur < 0){
            cout << "impossible\n";
            return;
        }
    }
    int val[2] = {0, 0};
    char c[3] = {'R', 'B', 'G'};
    for(int i = 0; i < n; ++i){
        //cout << '\n' << val[0] << ' ' << val[1] << '\n';
        if(ans[i]){
            cout << c[2];
            if(s[i] == '('){
                ++val[0];
                ++val[1];
            }
            else{
                --val[0];
                --val[1];
            }
        }
        else{
            if(s[i] == '('){
                if(val[0] < val[1]){
                    ++val[0];
                    cout << c[0];
                }
                else{
                    ++val[1];
                    cout << c[1];
                }
            }
            else{
                if(val[0] > val[1]){
                    --val[0];
                    cout << c[0];
                }
                else{
                    --val[1];
                    cout << c[1];
                }
            }
        }
    }
    cout << '\n';
}
ll dp[309][309];
ll ndp[309][309];
ll ans[309];
const ll mod = 1e9+7;
ll mx = 300;
void solve2(){
    int n;
    cin >> n;
    vector<pii> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i].ff;
        a[i].ss = i; 
    }
    sort(all(a));
    dp[0][0] = 1;
    int idx = 0;
    for(ll i = 1; i <= mx; ++i){
        for(ll j = 0; j <= mx; ++j)
            for(ll k = 0; k <= mx; ++k){
                ndp[j+1][k+1] = (ndp[j+1][k+1]+dp[j][k])%mod;
                if(k > 1)
                    ndp[j+1][k-2] = (ndp[j+1][k-2]+dp[j][k])%mod;
                else if(k)
                    ndp[j][k-1] = (ndp[j][k-1]+dp[j][k])%mod;
                else if(j)
                    ndp[j-1][k] = (ndp[j-1][k]+dp[j][k])%mod;
            }
        ll curans = 0;
        for(ll j = 0; j <= mx; ++j){
            for(ll k = 0; k <= mx; ++k){
                dp[j][k] = ndp[j][k];
                ndp[j][k] = 0;
            }
            curans = (curans+dp[j][0])%mod;
        }
        //if(i == 3)
        //    cout << curans << '\n';
        while(idx < n && a[idx].ff == i){
            ans[a[idx].ss] = curans;
            idx++;
        }
    }
    for(int i = 0; i < n; ++i)
        cout << ans[i] << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    /*for(int bit = 0; bit < (1<<3); ++bit){
        string s;
        for(int i = 0; i < 4; ++i){
            if((1<<i)&bit)
                s.pb('(');
            else
                s.pb(')');
        }
        if(solve1(s))
            cout << s << '\n';
    }*/

    int p;
    cin >> p;
    if(p == 1){
        int t;
        cin >> t;
        while(t--)
            solve1();
    }
    else
        solve2();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 7 ms 420 KB Output is correct
17 Correct 6 ms 972 KB Output is correct
18 Correct 7 ms 436 KB Output is correct
19 Correct 5 ms 744 KB Output is correct
20 Correct 6 ms 972 KB Output is correct
21 Correct 29 ms 972 KB Output is correct
22 Correct 55 ms 6260 KB Output is correct
23 Correct 63 ms 1720 KB Output is correct
24 Correct 61 ms 3344 KB Output is correct
25 Correct 56 ms 6248 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 1740 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 1740 KB Output is correct
2 Correct 143 ms 1740 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 1740 KB Output is correct
2 Correct 143 ms 1740 KB Output is correct
3 Correct 156 ms 1732 KB Output is correct