text stringlengths 49 983k |
|---|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
ll dp[3003][3003][4];
ll gs[3003][3003];
int main() {
int r, c, k, y, x, v;
cin >> r >> c >> k;
rep(i, 0, k) {
cin >> y >> x >> v;
--y, --x;
gs[y]... |
#include <iostream>
using namespace std;
typedef long long Int;
Int H, W, K, h, w, v;
Int dp[5500][5500][4], fld[5500][5500];
int main() {
cin >> H >> W >> K;
for (int _ = 0; _ < K; _++) {
cin >> h >> w >> v;
fld[h - 1][w - 1] = v;
}
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 1000000007;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int a[3010][3010];
ll dp[3010][3010][4];
int main(){
int R,C,K;
cin>>R>>C>>K;
rep(i,K){
int r,c,v; cin>>r>>c>>v;
a[r-1][c-1]=v;
}
for(int i=0; i<R; ++i){
for(in... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i,n) for(int i=0;i<n;i++)
#define fro(i,j,n) for(int i=j;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
int main() {
int r,c,k,x,y,z;
cin >> r>> c>> k;
ll a[3*r+1][c];
int v[r][c];
fr(i,r){
fr(j,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3001][3001][3], a[3001][3001];
int main() {
ll r,c,items, x , y, v, maxi = 0;
cin >> r >> c >> items;
while(items--) {
cin >> x >> y >> v;
x--, y--;
dp[x][y][0] = a[x][y] = v;
}
for(int i=0;i<r;i++) for(in... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll dp[3100][3100][5];
ll value[3100][3100];
int main(){
int r,c,k;
cin >> r >> c >> k;
memset(value,0,sizeof(value));
for(int i=0;i<k;++i){
ll R,C,V;
cin >> R >> C >> V;
value[R][C]=V;
}
for(int i=0;i<=r;++i){
for(int j=0;j<... |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define rep(i,n) for(int i=1;i<=(int)(n);i++)
ll R,C,K,r,c,v,g[3001][3001],a[3001][3001][4];
int main(){
cin>>R>>C>>K;
rep(i,K){cin>>r>>c>>v;g[r][c]=v;}
rep(i,R)rep(j,C)rep(k,3)a[i][j][k]=max(a[i-1][j][3]+g[i][j],max(a[i][j-1][k-1]+g[i][j],a[i][j-1][k... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=3003;
ll dp[maxn][maxn][4];
ll val[maxn][maxn];
int main()
{
int n,m,k,x,y;
ll v;
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=k;i++)
{
scanf("%d%d%lld",&x,&y,&v);
val[x][y]=v;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
... |
#include <bits/stdc++.h>
using namespace std;
long long n,m,k;
long long dp[3010][3010][4];
long long a[3010][3010];
int main(){
cin>>n>>m>>k;
while(k--){
long long u,v,w;
cin>>u>>v>>w;
a[u][v]=w;
}
dp[1][1][1]=a[1][1];
for(long long i=1;i<=n;i++){
for(long long j=1;j<=m;j++){
for(long long k=0;k<=2;k+... |
#include <bits/stdc++.h>
using namespace std;
long long int dp[3001][3001][4];
long long int sc[3001][3001];
int main(){
int R,C,k;
cin >> R >> C >> k;
int r,c;
long long int v;
for(int i=0;i<k;i++){
cin >> r >> c >> v;
r --; c--;
sc[r][c]=v;
}
for(int i=0;i<R;i++){
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 3001;
int g[N][N];
int64_t dp[N][N][4];
int R, C, K;
int64_t go(int x, int y, int cnt) {
if (x == R || y == C) return 0;
if (dp[x][y][cnt] != -1) return dp[x][y][cnt];
if (cnt < 3) {
return dp[x][y][cnt] = max({go(x, y + 1, cnt + 1) + g[x... |
#include <bits/stdc++.h>
using namespace std;
long long A[3010][3010];
long long dp[3010][3010][4];
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int R, C, K; cin >> R >> C >> K;
for(int i = 0; i < K; i++){
int r, c; long long v; cin >> r >> c >> v;
r--; c--; A[r][c] = v;
}
if(A[0][0]) dp... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, k;
const int N = 3000;
int cache[N][N][4];
int a[N][N];
int dp(int i, int j, int last)
{
if (i == n || j == m)
return 0;
int &ans = cache[i][j][last];
if (ans != -1)
return ans;
if (last == 3)
{
ans... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll g[4001][4001];
int r,c,k;
ll dp[4001][4001][4];
ll rec(ll i, ll j, ll taken)
{
if(i>=r)return 0;
if(j>=c)return 0;
if(dp[i][j][taken]!=-1)return dp[i][j][taken];
ll ans=0;
ans=rec(i+1,j,0);
if(taken<3){
ans=max(ans,rec(i+1,j,0)+g[i][j]);
}
... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;... |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
using namespace std;
typedef long long ll;
typedef long double db;
ll d[3005][3005][5],a[3005][3005];
int main(){
ll r,c,n;cin>>r>>c>>n;
for(ll i=1;i<=n;i++){
ll x,y,v;cin>>x>>y>>v;
a[x][y]=v;
}
for(int i=1;i<=r;i++){
for... |
#include<bits/stdc++.h>
using namespace std;
long long int L[3003][3003][4];
int G[3003][3003];
int H,W,K;
signed main(){
cin>>H>>W>>K;
int h,w,v;
for(int i=1;i<=K;i++){
cin>>h>>w>>v;
G[h][w]=v;
}
for(int h=1;h<H+1;h++){
for(int w=1;w<W+1;w++){
long long int X=0;
for(int k=0;k<4;k++){
X=max(X,L[... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
using namespace std;
using ll = long long;
int a[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C, n;
cin >> R >> C >> n;
rep(i, n) {
int r , c, v;
cin >> r >> c >> v;
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
ll a[3005][3005], dp[3005][3005][4];
int main() {
ll R, C, n, ans = 0, r, c, v;
cin >> R >> C >> n;
rep(i, n) cin >> r >> c >> v, a[r][c] = v;
rep(i, R + 1) r... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int N=3009;
ll a[N][N];
ll dp[N][N][5];
int r,c,k,l,m,v;
ll f(int i,int j,int cnt)
{
if (i>r||j>c)
return 0;
if (dp[i][j][cnt]!=-1)
... |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 3000 + 10 ;
int arr[MAX][MAX] ;
int n , m , k ;
long long dp[MAX][MAX][4] ;
long long solve(int i , int j , int cnt)
{
if(i == n || j == m)
return 0 ;
long long &ret = dp[i][j][cnt] ;
if(ret != -1)
return ret ;
ret = 0 ;
ret = max(ret , solve(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int r, c, k;
cin >> r >> c >> k;
vector<vector<vector<long long>>> dp(r + 1, vector<vector<long long>>(c + 1, vector<long long>(4)));
vector<vector<long long>> grid(r, vector<long long>(c));
for (int i = 0; i < ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
#define chmax(x,y) x = max(x,y)
int a[3005][3005];
ll dp[3005][3005][4];
int main(){
cin.tie(0);
ios::sync_with_s... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define chmax(x,y) x = max(x,y)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int a[3005][3005];
ll dp[3005][3005][4];
int main(){
int R,C,K;
cin >> R >> C >> K;
rep(i,K){
int r,c,v;
cin >> r >> c >> v;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3000 + 10;
int r, c, k;
int v[maxn][maxn];
ll f[4][maxn][maxn];
int main()
{
scanf("%d%d%d", &r, &c, &k);
while(k--)
{
int x, y, val;
scanf("%d%d%d", &x, &y, &val);
v[x][y] = val;
}
for(int i = 1; i <= r; ++i)
for(int j = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3001][3001][4], a[3001][3001];
int main() {
ll r,c,items, x , y, v, maxi = 0;
cin >> r >> c >> items;
while(items--) {
cin >> x >> y >> v;
a[x-1][y-1]=v;
}
for(int i=0;i<r;i++) for(int j=0;j<c;j++) {
fo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3001][3001][3], a[3001][3001];
int vis[3001][3001][3];
ll func(int r, int c, int cnt) {
if(r < 0 || c < 0 || cnt < 0) return 0;
if(vis[r][c][cnt]) return dp[r][c][cnt];
vis[r][c][cnt] = 1;
return dp[r][c][cnt] = max({func(r-... |
#include<bits/stdc++.h>
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
typedef long long ll;
typedef std::pair<int,int> pii;
#define pb push_back
#define mk make_pair
#define fi first
#define se second
int _w;FILE* _f;
using namespace std;
const int N=3001;
int R,C,K,val[N][N];
ll f[N][N][4],ans;
int main(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(V) V.begin(),V.end()
const ll MOD = 1000000007;
ll M[3010][3010];
ll A[3010][3010][4];
int main() {
int R, C, K;
cin >> R >> C >> K;
int r, c, v;
for (int i = 0;i <= R;i++) {
for (int j = 0;j <= C;j++) {
M[i][j] = 0;
}
}
for (... |
#include <iostream>
using namespace std;
typedef long long ll;
ll v[3005][3005];
ll dp[3005][3005][4];
int main()
{
int r, c, k;
cin >> r >> c >> k;
for(int i = 0; i < k; i++){
int a, b;
ll w;
cin >> a >> b >> w;
a--; b--;
v[a][b] = w;
}
for(int i = 1; i <= ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int a[3005][3005];
ll dp[3005][3005][4];
int main() {... |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
int R, C, K;
cin >> R >> C >> K;
vector<vector<LL>> V(R+2, vector<LL>(C+2));
for(auto i=0; i<K; ++i) {
int r, c, v;
cin >> r >> c >> v;
V[r][c] = v;
}
vector<vector<vector<LL>>> dp(R+3, vector<vector<LL>>(C+3, ve... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll val[3003][3003], mem[3003][3003][5], n, m;
ll dp(int r, int c, int cnt)
{
if(r>n || c>m || cnt>3)return -100000000000000000;
if(r==n && c== m)return (cnt<3)*val[n][m];
if(mem[r][c][cnt]!=-1)return mem[r][c][cnt];
return mem[r][c][cnt]=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,v[3003][3003],K;
ll dp[3003][3003][4];
int main(){
cin>>n>>m>>K;
for(int i=1;i<=K;i++){
int r,c,V;cin>>r>>c>>V;
v[r][c]=V;
}
dp[1][1][0]=0;if(v[1][1]>0)dp[1][1][1]=v[1][1];
for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(i>1||j>1){
if(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int R, C, K;
int val[3000][3000];
ll memo[3000][3000][4];
bool visited[3000][3000][4];
ll f(int x, int y, int z) {
if (x >= R || y >= C) return 0;
if (visited[x][y][z]) return memo[x][y][z];
visited[x][y][z] = true;
auto r = f(x+1, y, 0) + (z < 3 ?... |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long x[3005][3005], dp[3005][3005][4], ans;
int main() {
scanf("%d%d%d", &n, &m, &k);
while (k--) {
int ta, tb;
long long tc;
scanf("%d%d%lld", &ta, &tb, &tc);
x[ta][tb] += tc;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
... |
#include<bits/stdc++.h>
#define maxn 3005
using namespace std;
int arr[maxn][maxn];
long long dp[maxn][maxn][4];
long long get(int i,int j) {
return max({dp[i][j][0],dp[i][j][1],dp[i][j][2],dp[i][j][3]});
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r,c,n;
cin >> r >> c >> n;
for(int i=1;i<=n;i++) {
... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int a[3005][3005];
ll dp[3005][3005][4];
int main()
{
int R,C;
int K;
cin>>R>>C;
cin>>K;
rep(i,K)
{
int r,c,v;
cin>>r>>c>>v;
a[r-1][c-1]=v;
}
for(int i=0;i<R;i++)
{
for(int j=0;... |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=3e3+5;
ll r,c,k,x,y,z,g[N][N],dp[N][N][4];
int main()
{
cin>>r>>c>>k;
while(k--){
cin>>x>>y>>z;
g[x][y]=z;
}
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
for(int k=1;k<=3;k++){
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
ll dp[3001][3001][4] = {};
ll mp[3001][3001] = {};
ll dpm(int dpi, int dpj, int dpk) {
ll x = dp[dpi][dpj][0];
rep (dpr, dpk+1) x = max(x, dp[dpi][dpj][dpr]);
return x;
}
in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 7;
int n;
int m;
int k;
ll a[N][N];
ll dp[N][N][4];
ll tot[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 1; i <= k; i++) {
int r, c, x;
cin >> r >> c >> x;
a[r][c]... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int mx = 3000 + 9;
int R, C, K;
ll g[mx][mx];
ll dp[mx][mx][4];
ll solve(int i, int j, int k) {
if (i > R) return 0;
if (j > C) return 0;
ll& ans = dp[i][j][k];
if (ans != -1) return ans;
ans = 0;
if (k > 0) {
... |
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAXN = 3e3 + 5;
const int MAXM = 3e3 + 5;
int a[MAXN][MAXN];
int main(void)
{
int n,m,d;
scanf("%d%d%d",&n,&m,&d);
for(int i=1; i<=d; ++i)
{
int x,y,v;
scanf("%d%d%d",&x,&y,&v);
a[x][y] = v;
}
stat... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
ll g[3010][3010], dp[3010][3010][5];
int r,c,k,x,y;
ll solve(int rr, int cc, int cnt)
{
if(rr>r || rr<1 || cc>c || c<1) return 0;
if(dp[rr][cc][cnt]!= -1) return dp[rr][cc][cnt];
ll ans=0;
ans = max({s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int r,c,k;
cin >> r >> c >> k;
vector<vector<int>> v(r+1,vector<int>(c+1,0));
for(int i=0;i<k;i++)
{
int a,b,w;
cin >> a >> b >> w;
v[a][b]=w;
}... |
#include<bits/stdc++.h>
using namespace std;
int a[3010][3010];
long long dp[3010][3010][4];
int n,m,k;
int main()
{
scanf("%d%d%d",&n,&m,&k);
int x,y,c;
for(int i=1;i<=k;i++)
{
scanf("%d%d%d",&x,&y,&c);
a[x][y]=c;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
dp[i][j][0]=max(dp[i][j-1][0],max(m... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 3e3 + 5, mod = 1e9 + 7;
ll a[N][N], dp[N][N][4];
int mark[N][N][4], n, m, k;
ll solve(int r, int c, int kam){
if(r >= n || c >= m || kam >= 3) return 0;
if(mark[r][c][kam]) return dp[r][c][kam];
mark[r]... |
#include <bits/stdc++.h>
#define roop(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
int a[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C, K;
cin >> R >> C >> K;
roop(i, K){
int r, c, v;
ci... |
#include<bits/stdc++.h>
#define MAX 3000
#define MOD 1000000007
using namespace std;
int r,c,k;
int v[MAX+1][MAX+1];
long long dp[MAX+1][MAX+1][4];
bool valid(int x,int y)
{
return (x>=1&&x<=r&&y>=1&&y<=c);
}
long long go(int x,int y,int used)
{
if(!valid(x,y))
return 0;
if(dp[x][y][used]^-1)
return dp[x][y][use... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3003;
int dp[N][N][4], r, c;
int v[N][N];
int f(int i, int j, int k) {
if(i == r && j == c) {
if(!k) return 0;
return v[i][j];
}
int res = 0;
if(~dp[i][j][k]) {
return dp[i][j][k];
}
if(i + 1 <= r) {
res = max(res, f... |
#include<bits/stdc++.h>
#define pf printf
#define sc(x) scanf("%d",&x);
#define scs(x) scanf("%s",x);
#define scl(x) scanf("%lld",&x);
#define rep(i,s,e) for(int i=s; i<=e; ++i)
#define dep(i,s,e) for(int i=s; i>=e; --i)
typedef long long ll;
using namespace std;
const int Max=2e5+5;
ll a[3005][3005];
int main()
{
ll... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3001][3001][3], a[3001][3001];
ll func(int r, int c, int cnt) {
if(r < 0 || c < 0 || cnt < 0) return 0;
if(dp[r][c][cnt] != -1) return dp[r][c][cnt];
return dp[r][c][cnt] = max({func(r-1, c, 2) + a[r][c], func(r, c-1, cnt), func... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 3333;
int dp[N][N][6];
/*dp(i,j,k)：当前位于 第 i 行,第 j 列,且当行已经取了第 k 个的最大值 */
int mp[N][N]={0};
int R,C,K;
int mc[N];
signed main(){
cin>>R>>C>>K;
int r,c,v;
for(int i=1;i<=K;i++){
cin>>r>>c>>v;
mp[r][c]=v;
}
for(int i=1;i<=R;i++){
... |
#include<bits/stdc++.h>
using namespace std;
int n,m,t;
int a[3005][3005];
long long dp[3005][3005][4];
int main(){
scanf("%d %d %d",&n,&m,&t);
for(int i=0;i<t;i++){
static int r,c,v;
scanf("%d %d %d",&r,&c,&v);
a[r][c]=v;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)... |
#include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int H,W;
int K;
LL G[3000][3000];
LL dp[3000][3000][4];
int main() {
scanf("%d%d%d",&H,&W,&K);
rep(y,H) rep(x,W) G[y][x]=0;
rep(k,K){
int y,x,v; sc... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
ll dp[3030][3030][4];
ll T[3030][3030];
int main() {
int R, C, K;
cin >> R >> C >> K;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 3005;
int r, c, k, a[sz][sz];
ll dp[sz][sz][4];
ll fnc(int x, int y, int d) {
if(x == r && y == c) {
if(d) return a[x][y];
return 0;
}
ll &w = dp[x][y][d];
if(w < 0) {
w = 0;
if(y < c) w = max(w, fnc... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
int R,C,K,r,c,v,d[3123][3123],memo[3123][3123][5];
int f(int y,int x,int cnt){
if(y<0||x<0)return 0;
if(~memo[y][x][cnt])return memo[y][x][cnt];
int res=0;
for(int i=0;i<=3;i++)chmax(r... |
// Originalcode: https://atcoder.jp/contests/abc175/submissions/15970101
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
ll dp[3005][3005][5];
ll m[3005][3005];
int main(){
int r,c,k;
ci... |
#include <bits/stdc++.h>
using namespace std;
const int M = 3e3;
int mat[M][M], n, m;
long long memo[M][M][4];
long long solve(int i, int j, int cnt) {
if (i == n || j == m)
return 0;
long long &result = memo[i][j][cnt];
if (result == -1) {
result = max(solve(i + 1, j, 0), solve(i, j + 1,... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=3009;
int n,m,K;
int a[maxn][maxn];
long long f[maxn][maxn][4];
int main(){
cin>>n>>m>>K;
while(K--){
int x,y,z;scanf("%d%d%d",&x,&y,&z);
a[x][y]=z;
}
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
for(int k=0;k<=3;++k){
long long t=max(max... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
const int n=3000;
long long int dp[3000][3000][4];
long long int a[3000][3000];
long long int fun(long int x,long int y,long int z)
{
//cout<<x<<" "<<y<<" "<<z<<endl;
if(x<0 || y<0)
return 0;
if(dp[x][y][z]!=-1)
return dp[x][y][z];
... |
#include <bits/stdc++.h>
using namespace std;
#define SZ(a) ((int)(a).size())
typedef long long int64;
int64 dp[3333][3333][4],v[3333][3333];
int main(){
#ifdef LOCAL
freopen(".a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0);
int n,m,k;cin>>n>>m>>k;
for(int i=0;i<k;++i){
i... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, k;
ll a[3030][3030], dp[3030][3030][4];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin >> n >> m >> k;
for(int i=1;i<=k;i++){
int x, y, v; cin >> x >> y >> v;
a[x][y] = v;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
LL dp[3005][3005][4];
int a[3005][3005];
int r,c;
int main()
{
int i,j,k;
scanf("%d%d%d",&r,&c,&k);
while(k--)
{
int t1,t2,t3;
scanf("%d%d%d",&t1,&t2,&t3);
a[t1][t2]=t3;
}
for(i=1;i<=r;i++)
for(j=1;j<=c;j++)
{
for(k=0;k<4;k++)
dp[... |
#import<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long LL;
LL i,j,k,m,n,s,v,x,y,e[3018][3018],f[3018][3018],g[3018][3018],h[3018][3018],p[3018][3018];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m>>k;
for(;i++<k;)
{
cin>>x>>y>>v;
p[x][y]=v;
}
for(i=0;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,C,K;
cin>>R>>C>>K;
vector<vector<int64_t>> p(R,vector<int64_t>(C));
for(int i=0;i<K;i++){
int a,b;
int64_t c;
cin>>a>>b>>c;
a--,b--;
p[a][b]=c;
}
vector<int64_t> dp(C);
for(int i=0;i<R;i++){
vector<int64_t> ndp(C);
... |
#include<bits/stdc++.h>
using namespace std;
long long val[4000][4000];
long long dp[3001][3001][4];
long long max_val(long long r,long long c, long long cnt)
{
if(r<0 || c<0)
return 0;
if(dp[r][c][cnt]!=-1)
return dp[r][c][cnt];
long long c1=0, c2=0;
if(cnt>0)
c1 = max(max_val(r-1,c,3),max_val(r,c-1,cnt-1)) ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
#define chmax(x,y) x = max(x,y)
int Item[3005][3005];
ll DP[3005][3005][4];
int main(){
int R,C,k;cin>>R>>C>>k;
rep(i,k){
int r,c,v;
scanf("%d %d %d",&r,&c,&v);
r--;c--;
It... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int r,c,k;
ll dp[3005][3005][4];
ll fie[3005][3005];
int main(void){
scanf("%d%d%d",&r,&c,&k);
for(int i=0;i<k;i++){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
a--;
b--;
fie[a][b]=c;
}
dp[0][0... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 3050;
int r,c,k,x,y,val;
ll dp[MAX][MAX][4];
ll room[MAX][MAX];
int main() {
cin>>r>>c>>k;
while(k--){
cin>>x>>y>>val;
room[x][y]=val;
}
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
f... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int r,c,k;
int a[3005][3005];
ll dp[3005][3005][3];
ll f(int row,int col,int cnt)
{
ll &ret=dp[row][col][cnt];
if(row>r||col>c) ret=0;
if(ret!=-1) return ret;
ret=0;
if(a[row][col])
{
ret+=a[row][col];
if(cnt==2)
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,m,k;
ll a[3000][3000];
ll dp[3000][3000][4];
ll solve(int i,int j,int rem){
if(i==n-1 && j==m-1){
if(a[i][j]!=0 && rem>=1) return a[i][j];
else return 0;
}
if(dp[i][j][rem]!=-1LL) return dp[i][j][rem];
ll req = 0;
if(j+1<m){
req = ma... |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
const int N=3e3+5;
ll a[N][N],dp[N][N][4],n,m;
ll go(ll i,ll j,ll k)
{
if(i==n+1 || j==m+1)
{
return 0;
}
else if(dp[i][j][k]!=-1)
{
return dp[i][j][k... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int r, c, k; cin >> r >> c >> k;
vector<vector<ll> > g1(r + 1, vector<ll> (c + 1)), g2(g1), g3(g2), g(g1);
for (int i = 0; i < k; ++i) {
int row, col, val; cin >> row >> col >> val;
g[row][col] = val;
}
g1[1][1] = g2[1][1] = g3[... |
#include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
const int mx = 3e3;
ll dp[mx + 3][mx + 3][5];
ll arr[mx + 3][mx + 3];
int main() {
ll r, c, k;
cin >> r >> c >> k;
while (k--) {
ll x, y, v;
cin >> x >> y >> v;
arr[x][y] = v;
}
for (int i = 1; i <= r; ++i) {
for (in... |
#include <iostream>
using namespace std;
typedef long long ll;
#define chmax(x, y) x = max(x, y);
int V[3100][3100];
ll dp[3100][3100][5];
int main() {
int R, C, K; cin >> R >> C >> K;
for (int i = 0; i < K; i++) {
int r, c, v; cin >> r >> c >> v;
V[r-1][c-1] = v;
}
for (int i = 0; i <... |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 3009,INF=-10;
long long int dp[maxN][maxN][4],c[maxN][maxN];
int n,m;
long long int f(int i,int j,int d){
if(i<=0||j<=0||i>n||j>m||d<0)return INF;
if(i==n && j==m)return d?c[i][j]:0;
if(dp[i][j][d]!=-1)return dp[i][j][d];
long long int ret ;... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll g[4001][4001];
int r,c,k;
ll dp[4001][4001][4];
ll rec(ll i, ll j, ll taken)
{
if(i>=r)return 0;
if(j>=c)return 0;
if(dp[i][j][taken]!=-1)return dp[i][j][taken];
ll ans=0;
if(taken<3 && i<r && j<c){
ans=g[i][j];
}
else{ans=0;}
ans=rec(i+1,... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mxn = 3001, w = 4;
int n, m, k;
ll a[mxn][mxn];
ll dp[mxn][mxn][w];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n... |
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
using namespace std;
int r, c, k;
int grid[3005][3005];
int dp[3005][3005][4]; //row col taken
int compute(int i,int j,int taken){
if(i>r || j>c)return 0;
int &ans=dp[i][j][taken]... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
int items[3001][3001];
ll dp[3001][3001][4];
int main() {
int R, C, K;
cin >> R >> C >> K;
rep(i, K) {
int r, c, v;
cin >> r >> c... |
#include<bits/stdc++.h>
using namespace std;
#define Maxn 4010
int R, C, K, x, y, z, cost[Maxn][Maxn];
long long f[Maxn][Maxn][4];
int main()
{
scanf("%d%d%d", &R, &C, &K);
for (int i=1; i<=K; i++)
{
scanf("%d%d%d", &x, &y, &z);
cost[x][y]=z;
}
for (int i=1; i<=R; i++)
for (int j=1; j<=C; j++)
{
for (... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmax(x,y) x = max(x,y)
ll dp[3005][3005][4];
int A[3005][3005];
int main() {
int R,C,K;
cin >> R >> C >> K;
rep(i,K) {
int r,c,v;
cin >> r >> c >>... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int field[3005][3005];
ll dp[3005][3005][4];
int main() {
int R... |
#include <bits/stdc++.h>
using namespace std;
long a[3333][3333], d[4], e[3333];
int main() {
int r, c, k;
cin >> r >> c >> k;
for(int i = 0; i < k; i++) {
int x, y, v;
cin >> x >> y >> v;
a[x - 1][y - 1] = v;
}
for(int i = 0; i < r; i++) {
fill(d, d + 4, 0);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll R, C, K;
ll Dp[3001][3001][4], V[3001][3001];
#define maxupd(A, B) (A) = max((A), (B))
ll Res;
int main() {
cin >> R >> C >> K;
for (ll i = 0; i < K; ++i) {
ll r, c, v;
cin >> r >> c >> v;
V[r][c] = v;
}
for (ll r = 1; r <= R; ... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define l... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(long long i = (a); i < (b); i++)
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
using ll = long long;
ll dp[3001][3001][4];
void solve()
{
ll r,c,k;
cin>>r>>c>>k;
vector<vector<ll>> v(r+1,vector<ll>(c+1,0));
while(k--){
ll a... |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e9+5;
int n, m, k;
ll v[3005][3005];
ll memo[3005][3005][4];
ll dp(int x, int y, int h) {
if (x>n or y>m) return 0;
if (memo[x][y]... |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<math.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int R,C,K;
int v[3002][3002]={};
long long int mae[3002]={};//前の行の最大スコア
long long int nw[3002][4]={};//今の行のスコア
int main()
{
s... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[3002][3002];
int dp[3003][3002][4];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r,c,k;
cin >> r >> c >> k;
for(int i = 1; i <= k; i++){
int x,y,c;
cin >> x >> y >> c;
a[x][y] = c;
}
for(int i = 1; i <= r; i... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W, K; cin >> H >> W >> K;
vector<vector<int>> v(H, vector<int>(W));
for (int i = 0; i < H; i++) for (int j = 0; j < W; j++) {
int r, c, x; cin >> r >> c >> x; r--, c--;
v[r][c] = x;
}
vector<vector<vector<ll>>> dp(H... |
#include<bits/stdc++.h>
using namespace std;
long long n,m,k,vl[3030][3030],dp[3030][3030][4];
int main()
{
cin>>n>>m>>k;
for(int i=0;i<k;i++)
{
long long a,b,c;
cin>>a>>b>>c;
vl[a][b]=c;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
for(int k=0;k<=3;k++)
{
if(k!=3)
{
dp[i+1][j][0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,C,K;
cin>>R>>C>>K;
vector<vector<int64_t>> p(R,vector<int64_t>(C));
for(int i=0;i<K;i++){
int a,b;
int64_t c;
cin>>a>>b>>c;
a--,b--;
p[a][b]=c;
}
vector<vector<int64_t>> dp(R,vector<int64_t>(C));
for(int i=0;i<R;i++){
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int A[3100][3100],B[3100][3100][5];
signed main(){
int H,W,K;
cin>>H>>W>>K;
for(int i=0;i<K;i++){
int x,y,c;
cin>>x>>y>>c;
A[x-1][y-1]=c;
}
for(int i=0;i<H;i++){
B[i+1][0][0]=max({B[i+1][0][0],B[i][0][0],B[i][0][1],B[i][0][2],B... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
int a[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C, K;
cin >> R >> C >> K;
rep(i, K) {
int r, c, v;
cin >> r >> c >> ... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int a[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C, n;
cin >> R >> C >> n;
rep(i,n) {
int r, c, v;
cin >> r >> c >> v;
... |
#include<bits/stdc++.h>
using namespace std;
long long r,c,k,x,y,v,ans;
long long m[3005][3005],f[3005][3005][5];
int main()
{
cin>>r>>c>>k;
for(int i=1;i<=k;++i)
{
cin>>x>>y>>v;
m[x][y]=v;
}
for(int i=1;i<=r;++i)
for(int j=1;j<=c;++j)
for(int k=1;k<=3;++k)
f[i][j][k]=max(f[i-1][j][3]+m[i][j],max(f[i]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.