Language: C++

#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const ll mod = 1000000007ll;
//const ll mod = 10007;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}




#define rep(i, n)         for(ll i = 0; i < (ll)(n); i++)
#define brep(n)           for(int bit=0;bit<(1<<n);bit++)
#define bbrep(n)           for(int bbit=0;bbit<(1<<n);bbit++)
#define erep(i,container) for (auto &i : container)
#define itrep(i,container) for (auto i : container)
#define irep(i, n)        for(ll i = n-1; i >= (ll)0ll; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout  << std::endl;
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<":"
#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll) 
#define stirng string
#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;
//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];

//typedef long long T;
ll ceil(ll a,ll b){
    return ((a+b-1)/b);
}
const int INF = 2000000000;
//const ll INF64 =3223372036854775807ll;
//const ll INF64 = 9223372036854775807ll;
const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
//const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi=3.141592653589793;


//メモ
//tuple<hoge,huga,foo> tのget関数はget<i>(t)
//resizeはメンバ関数
//三項演算子を覚えよう
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const ll mod = 1000000007ll;
//const ll mod = 10007;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}




#define rep(i, n)         for(ll i = 0; i < (ll)(n); i++)
#define brep(n)           for(int bit=0;bit<(1<<n);bit++)
#define bbrep(n)           for(int bbit=0;bbit<(1<<n);bbit++)
#define erep(i,container) for (auto &i : container)
#define itrep(i,container) for (auto i : container)
#define irep(i, n)        for(ll i = n-1; i >= (ll)0ll; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout  << std::endl;
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<":"
#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll) 
#define stirng string
#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;
//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];

//typedef long long T;
ll ceil(ll a,ll b){
    return ((a+b-1)/b);
}
const int INF = 2000000000;
//const ll INF64 =3223372036854775807ll;
//const ll INF64 = 9223372036854775807ll;
const ll INF64 = 9223372036854775ll;
const ll MOD = 1000000007ll;
//const ll MOD = 1000003ll;
const ll OD = 1000000000000007ll;
const dou pi=3.141592653589793;


//メモ
//tuple<hoge,huga,foo> tのget関数はget<i>(t)
//resizeはメンバ関数
//三項演算子を覚えよう
int h,w,kk;
bool hani(int i,int j){//grid上探索において範囲内かどうかをreturn
    if(i>=0&&i<h&&j>=0&&j<w)return true;
    else return false;
}
int main(){
    std::ios::sync_with_stdio(false); //cin高速化
    std::cin.tie(0);
    std::cin >> h>>w>>kk;
    vvector(a,ll,h,w,0);
    //reprep(i,j,h,w)std::cin >> a[i][j];
    rep(i,kk){
        ll r,c,vv;
        std::cin >> r>>c>>vv;
        r--;c--;
        a[r][c]=vv;
    }
    vvvector(dp,ll,h,w,4,0);
    dp[0][0][1]=a[0][0];
    rep(i,h){
        rep(j,w){
            rep(k,4){
                if(hani(i+1,j))chmax(dp[i+1][j][0],dp[i][j][k]);
                if(hani(i,j+1))chmax(dp[i][j+1][k],dp[i][j][k]);
                if(hani(i+1,j))chmax(dp[i+1][j][1],dp[i][j][k]+a[i+1][j]);
                if(k<3){
                    if(hani(i,j+1))chmax(dp[i][j+1][k+1],dp[i][j][k]+a[i][j+1]);
                }
            }
        }
    }
    ll ans=0;
    rep(i,4)chmax(ans,dp[h-1][w-1][i]);
    std::cout << ans << std::endl;
}


Compiler output:
a.cc:122:8: error: redefinition of 'std::string yes'
  122 | string yes="yes";
      |        ^~~
a.cc:9:8: note: 'std::string yes' previously declared here
    9 | string yes="yes";
      |        ^~~
a.cc:123:8: error: redefinition of 'std::string Yes'
  123 | string Yes="Yes";
      |        ^~~
a.cc:10:8: note: 'std::string Yes' previously declared here
   10 | string Yes="Yes";
      |        ^~~
a.cc:124:8: error: redefinition of 'std::string YES'
  124 | string YES="YES";
      |        ^~~
a.cc:11:8: note: 'std::string YES' previously declared here
   11 | string YES="YES";
      |        ^~~
a.cc:125:8: error: redefinition of 'std::string no'
  125 | string no="no";
      |        ^~
a.cc:12:8: note: 'std::string no' previously declared here
   12 | string no="no";
      |        ^~
a.cc:126:8: error: redefinition of 'std::string No'
  126 | string No="No";
      |        ^~
a.cc:13:8: note: 'std::string No' previously declared here
   13 | string No="No";
      |        ^~
a.cc:127:8: error: redefinition of 'std::string NO'
  127 | string NO="NO";
      |        ^~
a.cc:14:8: note: 'std::string NO' previously declared here
   14 | string NO="NO";
      |        ^~
a.cc:129:31: error: redefinition of 'template<class T> bool chmax(T&, T)'
  129 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:16:31: note: 'template<class T> bool chmax(T&, T)' previously declared here
   16 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:130:31: error: redefinition of 'template<class T> bool chmin(T&, T)'
  130 | template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:17:31: note: 'template<class T> bool chmin(T&, T)' previously declared here
   17 | template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:134:10: error: redefinition of 'const ll mod'
  134 | const ll mod = 1000000007ll;
      |          ^~~
a.cc:21:10: note: 'const ll mod' previously defined here
   21 | const ll mod = 1000000007ll;
      |          ^~~
a.cc:137:8: error: redefinition of 'struct mint'
  137 | struct mint {
      |        ^~~~
a.cc:24:8: note: previous definition of 'struct mint'
   24 | struct mint {
      |        ^~~~
a.cc:166:10: error: redefinition of 'std::istream& operator>>(std::istream&, const mint&)'
  166 | istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
      |          ^~~~~~~~
a.cc:53:10: note: 'std::istream& operator>>(std::istream&, const mint&)' previously defined here
   53 | istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
      |          ^~~~~~~~
a.cc:167:10: error: redefinition of 'std::ostream& operator<<(std::ostream&, const mint&)'
  167 | ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
      |          ^~~~~~~~
a.cc:54:10: note: 'std::ostream& operator<<(std::ostream&, const mint&)' previously defined here
   54 | ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
      |          ^~~~~~~~
a.cc:213:4: error: redefinition of 'll ceil(ll, ll)'
  213 | ll ceil(ll a,ll b){
      |    ^~~~
a.cc:100:4: note: 'll ceil(ll, ll)' previously defined here
  100 | ll ceil(ll a,ll b){
      |    ^~~~
a.cc:216:11: error: redefinition of 'const int INF'
  216 | const int INF = 2000000000;
      |           ^~~
a.cc:103:11: note: 'const int INF' previously defined here
  103 | const int INF = 2000000000;
      |           ^~~
a.cc:219:10: error: redefinition of 'const ll INF64'
  219 | const ll INF64 = 9223372036854775ll;
      |          ^~~~~
a.cc:106:10: note: 'const ll INF64' previously defined here
  106 | const ll INF64 = 9223372036854775ll;
      |          ^~~~~
a.cc:220:10: error: redefinition of 'const ll MOD'
  220 | const ll MOD = 1000000007ll;
      |          ^~~
a.cc:107:10: note: 'const ll MOD' previously defined here
  107 | const ll MOD = 1000000007ll;
      |          ^~~
a.cc:222:10: error: redefinition of 'const ll OD'
  222 | const ll OD = 1000000000000007ll;
      |          ^~
a.cc:109:10: note: 'const ll OD' previously defined here
  109 | const ll OD = 1000000000000007ll;
      |          ^~
a.cc:223:11: error: redefinition of 'const dou pi'
  223 | const dou pi=3.141592653589793;
      |           ^~
a.cc:110:11: note: 'const dou pi' previously defined here
  110 | const dou pi=3.141592653589793;
      |           ^~