Submission #5723084

---

Source Code Expand

#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) v.erase(unique(ALL(v)), v.end())
#define bit(i) (1LL<<i)
#define sz(v) ((LLI)(v).size())

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

class Trie{
public:
  vector<unordered_map<char,int>> trie;
  int n;
  
public:
  Trie(): trie(1), n(1){}

  void add(const string &s){
    int cur = 0;

    REP(i,(int)s.size()){
      if(EXIST(trie[cur],s[i])){
	cur = trie[cur][s[i]];
      }else{
	++n;
	trie.resize(n);
	trie[cur][s[i]] = n-1;
	cur = trie[cur][s[i]];
      }
    }
  }

  bool _query(int cur, int i, const string &s, const function<void(int,int,const vector<unordered_map<char,int>>&)> &f){
    if(i >= (int)s.size()){
      f(cur, i, trie);
      return true;
    }
    
    if(EXIST(trie[cur], s[i])){
      bool ret = _query(trie[cur][s[i]], i+1, s, f);
      if(ret){
	f(cur, i, trie);
      }
      return ret;
    }else{
      return false;
    }
  }
  
  bool query(const string &s, const function<void(int,int,const vector<unordered_map<char,int>>&)> &f){
    return _query(0, 0, s, f);
  }

  int size(){
    return n;
  }
};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  while(cin >> N){

    Trie trie;
    vector<LLI> d(N*10);
    vector<LLI> s(N*10);

    LLI ans = 0;

    REP(i,N){
      string a; cin >> a;
      LLI b; cin >> b;

      sort(ALL(a));
      trie.add(a);
      auto f =
	[&](int c, int k, const vector<unordered_map<char,int>> &t){
	  if(k==(int)a.size()){
	    s[c] += b;
	  }
	  
	  d[c] = s[c];
	  	  
	  for(auto &p : t[c]){
	    chmax(d[c], d[p.snd]+s[c]);
	  }
	  
	};
      trie.query(a, f);
      dump(d);
      dump(s);

      chmax(ans, d[0]);
      cout << ans << endl;
    }

    dump(trie.trie);
  }
  
  return 0;
}

Submission Info

Judge Result