Submission #41399343

---

Source Code Expand

#include <bits/stdc++.h> 
using namespace std;
#define ll                long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define nl                "\n"
#define all(x)            (x).begin(),(x).end()
#define sz(x)             (int)((x).size())
#define pii               pair<ll, ll>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;

#define int long long

int dp[64][2];

int f(string &s, int n, int pos, int found) {
    if(pos < 0) {
        return 0LL;
    }
    
    if(dp[pos][found] != -1)
        return dp[pos][found];
    
    bool found_now = found;
    
    int bit = (n >> pos) & 1;
    
    if(pos >= s.length()) {
        if(bit)
            found_now = 1;
        return dp[pos][found] = f(s, n, pos - 1, found_now);
    }
    
    if(s[s.length() - 1 - pos] == '?') {
        if(found) {
            return dp[pos][found] = (1LL << pos) + f(s, n, pos - 1, found);
        } else {
            return dp[pos][found] = max((bit << pos) + f(s, n, pos - 1, found), f(s, n, pos - 1, found | bit));
        }
    }
    
    int other = s[s.length() - 1 - pos] - '0';
    
    if(!found && other > bit) {
        return dp[pos][found] = -INF;
    }
    
    if(other < bit)
        found_now = 1;
    
    return dp[pos][found] = (other << pos) + f(s, n, pos - 1, found_now);
}

void run_case(){
    string s;
    int n;
    cin >> s;
    cin >> n;
    
    int len = s.length();
    
    mem1(dp);

    cout << max(-1LL, f(s, n, 62, 0)) << nl;
}
 
signed main(){

#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    ios_base::sync_with_stdio(false); 
    cin.tie(0); cout.tie(0);
    
    run_case();

}

Submission Info

Compile Error

./Main.cpp: In function ‘long long int f(std::string&, long long int, long long int, long long int)’:
./Main.cpp:41:12: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   41 |     if(pos >= s.length()) {
      |        ~~~~^~~~~~~~~~~~~
./Main.cpp: In function ‘void run_case()’:
./Main.cpp:73:9: warning: unused variable ‘len’ [-Wunused-variable]
   73 |     int len = s.length();
      |         ^~~

Judge Result