Submission #1088041

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088041		_8_8_	Homework (CEOI22_homework)	C++17	10 / 100	1084 ms	128448 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int  N = 2e6 + 12, MOD = 998244353;

string s;
int m, n, col, val[N];
vector<int> st, g[N];
bool ok[N];
int dfs(int v) {
    if(v <= col) return val[v];
    if(ok[v]) {
        return max(dfs(g[v][0]), dfs(g[v][1]));
    } 
    return min(dfs(g[v][0]), dfs(g[v][1]));
}
void test() {
    cin >> s;
    m = (int)s.size();
    for(int i = 0; i < m; i++) {
        if(s[i] == '?') {
            col++;
        }
    }
    n = col;
    for(int i = 0; i < m; i++) {
        if(s[i] == '(') {
            if(!st.empty()) {
                g[st.back()].push_back(n + 1);
            }
            st.push_back(++n);
            if(s[i - 1] == 'x') {
                ok[n] = 1;
            } 
        } else if(s[i] == ')') {
            st.pop_back();
        }
    }
    int it = 0;
    for(int i = col + 1; i <= n; i++) {
        int f = (int)g[i].size();
        for(int j = 0; j < 2 - f; j++) {
            g[i].push_back(++it);
        }
    }
    vector<int> p(col);
    iota(p.begin(), p.end(), 1);
    set<int> s;
    do{
        for(int i = 0; i < col; i++) {
            val[i + 1] = p[i];
        }
        s.insert(dfs(col + 1));
    }while(next_permutation(p.begin(), p.end()));
    assert((int)s.size() == (*s.rbegin()) - (*s.begin()) + 1); 
    cout << (int)s.size() << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;

    while(t--) 
        test();
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 13
• Subtask 4: 0 / 30
• Subtask 5: 0 / 34