Submission #3450716

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
 
struct node{
  ll to[10];
  ll sum;
  ll max;
};
 
vector<node> v(2);
node t;

string a;
ll b;
ll dfs(ll n,ll k){
  if(k==a.size()){
    v[n].sum+=b;
    return v[n].max+v[n].sum;
  }
  
  ll ta=a[k]-'0';
  if(v[n].to[ta]==0){
    v[n].to[ta]=v.size();
    v.push_back(t);
  }
  ll tmp=dfs(v[n].to[ta],k+1);
  v[n].max=max(v[n].max,tmp);
  return v[n].sum+v[n].max;
}

int main(){
  ll n;
  cin>>n;
  for(ll i=0;i<n;i++){
    cin>>a>>b;
    reverse(a.begin(),a.end());
    cout<<dfs(1,0)<<endl;
  }
  return 0;
}

Submission Info

Judge Result