oj.uz

Submission #696966

# Submission time Handle Problem Language Result Execution time Memory
696966 2023-02-07T18:35:24 Z Deepesson Homework (CEOI22_homework) C++17
0 / 100
 238 ms 228352 KB 
#include <bits/stdc++.h>
#define MAX 5005005

typedef std::pair<int,int> pii;
///Garantido que con=2
std::vector<int> con[MAX];
int types[MAX];
enum tipos {MINIMO=1,MAXIMO};
int N;
///0 -> Menor que objetivo
///1 -> Maior que objetivo
int turno[MAX][2];
bool tab[MAX][2];
int dp(int pos,int modo){
    if(!types[pos]){///Folha
        return 1;
    }
    if(turno[pos][modo]=1)return tab[pos][modo];
    turno[pos][modo]=1;
    int ans=1e9;
    ///Procurando valores menores que objetivo
    if(modo==0){
        if(types[pos]==MINIMO){
            ans=std::min(ans,dp(con[pos][0],modo));
            ans=std::min(ans,dp(con[pos][1],modo));
        }else {
            ans=dp(con[pos][0],modo)+dp(con[pos][1],modo);
        }
    ///Procurando valores maiores que objetivo
    }else {
        if(types[pos]==MINIMO){
            ans=dp(con[pos][0],modo)+dp(con[pos][1],modo);
        }else {
            ans=std::min(ans,dp(con[pos][0],modo));
            ans=std::min(ans,dp(con[pos][1],modo));
        }
    }
    return tab[pos][modo]=ans;
}
///Left -> valores menores que obj, Right -> valores maiores que obj
int left,right,objetivo;
int marcas[MAX];
void dfs(int pos){
    if(!types[pos]){///Eh folha
        int inicio=left+1;
        int fim = (N-right);
        marcas[inicio]++;
        marcas[fim+1]--;
        return;
    }
    assert(con[pos].size()==2);
    if(types[pos]==MINIMO){///Temos que ter um valor = X e outro maior que X
        int esq = dp(con[pos][0],1),dir = dp(con[pos][1],1);
        right+=esq;
        dfs(con[pos][1]);
        right+=-esq+dir;
        dfs(con[pos][0]);
        right+=-dir;
    }else if(types[pos]==MAXIMO){///Temos que ter um valor = X e outro menor que X
        int esq = dp(con[pos][0],0),dir = dp(con[pos][1],0);
        left+=esq;
        dfs(con[pos][1]);
        left+=-esq+dir;
        dfs(con[pos][0]);
        left+=-dir;
    }
    return;
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);
    std::string s;
    std::cin>>s;
    for(auto&x:s)if(x=='?')++N;
    ///Destrinchar
    std::vector<int> stack;
    int cur=0;
    for(int i=0;i<s.size();++i){
        if(s[i]==',')continue;
        if(s[i]==')'){
            stack.pop_back();
            continue;
        }
        if(s[i]=='?'){
            con[stack.back()].push_back(cur);
            ++cur;
            continue;
        }
        if(s[i]=='m'){
            if(stack.size())
            con[stack.back()].push_back(cur);
            int tipo=MINIMO;
            if(s[i+1]=='a')tipo=MAXIMO;
            i+=3;
            stack.push_back(cur);
            types[cur]=tipo;
            ++cur;
        }else std::cout<<s[i];
    }
    dfs(0);
    int count=0,curs=0;
    for(int i=1;i<=N;++i){
        curs+=marcas[i];
        if(curs)++count;
    }
    std::cout<<count<<"\n";
}

Compilation message

Main.cpp: In function 'int dp(int, int)':
Main.cpp:18:24: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   18 |     if(turno[pos][modo]=1)return tab[pos][modo];
      |        ~~~~~~~~~~~~~~~~^~
Main.cpp: In function 'int main()':
Main.cpp:80:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int i=0;i<s.size();++i){
      |                 ~^~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 117852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 117852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 228352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 117852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 117852 KB Output isn't correct
2 Halted 0 ms 0 KB -