提出 #34408251

---

ソースコード 拡げる

#include <iostream>
#include <sstream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cctype>
#include <cassert>
#include <utility>
#include <map>
#include <list>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <string>
#include <ext/pb_ds/assoc_container.hpp>

// #define cerr if(false)cerr
#define see(x) cerr << "> " << #x << ": " << x << "\n";

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;

template <typename T>
std::ostream &operator <<(std::ostream &out, vector<T> &v) {
  for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
    out << v[i] << " ";
  out << "\n";
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, set<T> &s) {
  for (auto e : s)
    out << e << " ";
  out << "\n";
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, multiset<T> &s) {
  for (auto e : s)
    out << e << " ";
  out << "\n";
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, queue<T> &s) {
  for (auto e : s)
    out << e << " ";
  out << "\n";
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, deque<T> &s) {
  for (auto e : s)
    out << e << " ";
  out << "\n";
  return out;
}
template <typename T, typename N>
std::ostream &operator <<(std::ostream &out, pair<T, N> &p) {
  out << "(" << p.first << ", " << p.second << ") ";
  return out;
}
template <typename T, typename N>
std::ostream &operator <<(std::ostream &out, vector<pair<T, N> > &v) {
  for (size_t i = 0; i < v.size(); ++i)
    cout << v[i];
  out << "\n";
  return out;
}
template <typename T, typename N>
std::ostream &operator <<(std::ostream &out, set<pair<T, N> > &s) {
  for (auto p : s)
    out << p;
  out << "\n";
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<vector<T> > &v) {
  for (size_t i = 0; i < v.size(); ++i) {
    for (size_t j = 0; j < v[i].size(); ++j) {
      out << v[i][j] << " ";
    }
    out << "\n";
  }
  return out;
}
template <typename T>
std::ostream &operator <<(std::ostream &out, vector<set<T> > &v) {
  for (size_t i = 0; i < v.size(); ++i) {
    out << v[i];
  }
  out << "\n";
  return out;
}

int n;
vector<vector<long long> > snukes;
vector<vector<long long> > memo;

long long memoization(int t, int p) {
  if (t == 1e5 + 1) return 0;
  if (memo[p][t] != LLONG_MIN) {
    return memo[p][t];
  }

  memo[p][t] = snukes[p][t];
  if (p > 0 && p < 4) {
    memo[p][t] = max(memo[p][t] + memoization(t + 1, p), max(memo[p][t] + memoization(t + 1, p - 1), memo[p][t] + memoization(t + 1, p + 1)));
  }
  else if (p > 0) {
    memo[p][t] = max(memo[p][t] + memoization(t + 1, p), memo[p][t] + memoization(t + 1, p - 1));
  }
  else if (p < 4) {
    memo[p][t] = max(memo[p][t] + memoization(t + 1, p), memo[p][t] + memoization(t + 1, p + 1));
  }

  return memo[p][t];
}

void solve() {
  cin >> n;

  snukes = vector<vector<long long> > (5, vector<long long> (1e5 + 1));
  int t, x, a;
  for (int i = 0; i < n; ++i) {
    cin >> t >> x >> a;
    snukes[x][t] += a;
  }

  memo = vector<vector<long long> > (5, vector<long long> (1e5 + 1, LLONG_MIN));
  memoization(0, 0);

  cout << memo[0][0] << "\n";

  return ;
}

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

  int t;
  t = 1;

  while (t--) {
    solve();
  }

  return 0;

}

提出情報

ジャッジ結果