text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
long long first, second;
long long ex_gcd(long long a, long long b) {
if (!b) {
first = 1, second = 0;
return a;
}
long long d = ex_gcd(b, a % b);
long long tmp = first;
first = second;
second = tmp - a / b * second;
return d;
}
struct bignum {
long ... |
#include <bits/stdc++.h>
using namespace std;
long long f[100100];
int pr[31600000], t, p[100100], l, que[100100 * 20], head, tail;
bool bz[31600000], ans[100100], vis[100100];
struct qry {
long long n, k, w;
} q[100100];
bool cmp(qry a, qry b) { return a.k < b.k; }
long long qpow(long long a, long long i, long long ... |
#include <bits/stdc++.h>
using namespace std;
using INT = long long;
INT n, k;
INT multi(INT x, INT y, INT z) {
return (x * y - (INT)(x / (long double)z * y + 1e-8) * z + z) % z;
}
INT power(INT a, INT y, INT z) {
if (y == 0) return 1;
INT b = power(a, y >> 1, z);
b = multi(b, b, z);
if (y & 1LL) b = multi(b,... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5;
const int M = 1e6 + 5;
struct node {
long long n, k;
int pos;
} q[N];
struct data {
int id;
long long d;
bool operator<(data r) const { return d > r.d; }
};
priority_queue<data> g;
long long dis[M];
int ans[N], vis[M], p[M];
int tot, cnt;
bo... |
#include <bits/stdc++.h>
using namespace std;
long long mulmod(long long a, long long b, long long c) {
long long sign = 1;
int UUxUU = 10;
if (a < 0) {
a = -a;
sign = -sign;
}
if (b < 0) {
b = -b;
sign = -sign;
}
a %= c;
b %= c;
long long res = 0;
while (b > 0) {
if (b & 1) {
... |
#include <bits/stdc++.h>
int t;
struct item {
int id;
long long n, k;
bool operator<(const item& it) const { return k < it.k; }
} items[10010];
bool ans[10010];
long long ps[100];
int pc;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void exgcd(long long a, long long b, long long& x, l... |
#include <bits/stdc++.h>
using namespace std;
const int maxp = 34000000;
const int maxn = 100100;
const int maxt = 10010;
bool mark[maxp];
vector<int> ps;
long long x[maxt], k[maxt];
long long dis[maxn];
bool ans[maxt];
int power(long long x, int y, int M) {
long long ret = 1;
while (y) {
if (y & 1) ret = ret *... |
#include <bits/stdc++.h>
using namespace std;
int Q;
long long qx[10010], qn[10010];
int ans[10010];
int K;
vector<long long> item;
long long dist[1000010];
priority_queue<pair<long long, int> > q;
bool used[1000010];
bool isp[32000000];
vector<int> primes;
void pre(void) {
int i;
int p = item[0];
for ((i) = 0; (... |
#include <bits/stdc++.h>
using namespace std;
const int Max_Val = 4e7, Max_S = 1e5, Max_T = 1e4;
const long long Inf = (1e18) + 1;
int t, cnt, m, Cnt, Num, Prime[Max_Val / 3 + 5], vis[Max_Val + 5],
lin[Max_S + 5], ans[Max_T + 5];
long long n, k, d[55], p[20], dis[Max_S + 5];
vector<pair<long long, int> > A[55];
pri... |
#include <bits/stdc++.h>
using namespace std;
struct edge {
long long nxt, to, val;
} o[100010 * 30];
long long cas, T, n, k, x, y, ver, pr[2146776], p[51][50], head[100010], I,
dis[51][100010], vis[100010];
bitset<35000000> usd;
map<long long, long long> mp;
void make(long long m) {
for (long long i = 2; i <= ... |
#include <bits/stdc++.h>
using namespace std;
map<long long, int> m;
map<long long, int>::iterator it;
const int times = 7;
int number = 0;
int n, low, high, mid, prime[100000], cnt_p, mi[100000], list[2][111111],
cnt_list[2], pos[110000];
long long a[110000], xx, yy, ds;
bool is[110000];
int ex[111111];
long long ... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx")
#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
template <typename T>
int sgn(T val) {
return (T(0) < val) - (val < T(0));
}
long long read() {
long long x = 0;
bool q =... |
#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long x, long long y) {
return (x % y == 0) ? y : gcd(y, x % y);
}
long long mul(long long x, long long y, long long MOD) {
long long ans = 0;
while (y) {
if (y & 1) ans = (ans + x) % MOD;
x = (x + x) % MOD;
y >>= 1;
}
return a... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_P = 40000010, N = 10010, MAX_N = 100010;
const long long inf = 1e17;
int p[MAX_P], t, ans[N];
map<long long, vector<pair<long long, int> > > M;
inline void Pre(const int &n) {
for (int i = 2; i <= n; i++) {
if (!p[i]) p[++*p] = i;
for (int j = 1; j <... |
#include <bits/stdc++.h>
using std::map;
using std::priority_queue;
const int KV2 = 56, S = 32000000;
map<long long, int> mi;
int mar;
long long pr[2333333], pi;
bool vis[S + 1];
void sieve() {
for (long long i = 2; i <= S; i++) {
if (!vis[i]) pr[++pi] = i;
for (int j = 1; j <= pi && pr[j] * i <= S; j++) {
... |
#include <bits/stdc++.h>
using std ::pair;
using std ::priority_queue;
using std ::sort;
template <typename T>
T max(T x, T y) {
return (x > y) ? x : y;
}
template <typename T>
T min(T x, T y) {
return (x < y) ? x : y;
}
template <typename T>
bool chkmax(T &x, T y) {
return (x >= y) ? 0 : (x = y, 1);
}
template <... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, M = 2e6 + 5, S = 31624000;
int tot;
long long n, k, dis[N], p[M];
bool vis[N], is[S];
vector<long long> ans[55], res[55];
vector<pair<int, int> > e[N];
unordered_map<long long, int> use;
queue<long long> q;
inline void init() {
for (int i = 2; i < S... |
#include <bits/stdc++.h>
using std::map;
using std::priority_queue;
const int KV2 = 56, S = 32000000;
map<long long, int> mi;
int mar;
long long pr[2333333], pi;
bool vis[S + 1];
void sieve() {
for (long long i = 2; i <= S; i++) {
if (!vis[i]) pr[++pi] = i;
for (int j = 1; j <= pi && pr[j] * i <= S; j++) {
... |
#include <bits/stdc++.h>
long long x, y;
const int maxn = 33333333;
bool flag[maxn + 100];
int prm[2222222], top;
void primer() {
register int i, ii;
for (i = 2; i <= maxn; i++)
if (!flag[i]) {
prm[++top] = i;
for (ii = i; ii <= maxn / i; ii++) flag[i * ii] = 1;
}
}
inline void exgcd(long long a... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int BASE = 243 * 27;
const double EPS = 1e-7;
const int MAX = 32000000;
bool R[10007];
int P[MAX];
long long bpow(long long a, long long k, int mod) {
a %= mod;
long long res = 1;
while (k) {
if (k & 1) {
res *= a;
res... |
#include <bits/stdc++.h>
using namespace std;
inline void clampmod(long long &a, long long mod) {
a %= mod;
if (a < 0) a += mod;
}
long long mulmod(long long a, long long b, long long mod) {
clampmod(a, mod);
clampmod(b, mod);
long long res = 0;
while (b != 0) {
if (b & 1LL) {
res = (res + a) % mo... |
#include <bits/stdc++.h>
#define maxn 3086
using namespace std;
int n, m, k;
int a[maxn][maxn];
int x, y, z;
long long f[maxn][maxn][4];
inline void Max(long long &x, long long y){
x = max(x, y);
}
int main(){
scanf("%d%d%d", &n, &m, &k);
while(k--){
scanf("%d%d%d", &x, &y, &z);
a[x][y] = z;
}
memset(f, -0... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define rep3(i, s, n) for (int i = (s); i <=(int) (n); i++)
#define chmax(x,y) x = max(x,y)
int a[3005][3005];
long long dp[3005][3005][5];
int main() {
int R,C... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
ll dp[3010][3010][4];
ll item[3010][3010];
int main(){
int R,C;ll K;
cin>>R>>C>>K;
rep(i,K){
int r,c;cin>>r>>c;r--,c--;
int... |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
typedef long long ll;
ll rc[3001][3001];
int r,c,k;
ll dp[3001][3001][4];
int main(){
scanf("%d%d%d",&r,&c,&k);
for(int i=1;i<=k;i++){
int x,y,w;
scanf("%d%d%d",&x,&y,&w);
rc[x][y]=w;
}
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
const int maxn=3010;
ll f[maxn][maxn][4];
ll a[maxn][maxn];
int main()
{
int r,c,k;cin>>r>>c>>k;
while(k--){
int x,y,z;cin>>x>>y>>z;
a[x][y]=z;
}
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define repb(i,n,b) for (ll i = b; i < (ll)(n); i++)
#define rep(i,n) repb(i,n,0)
ll dp[3001][3001][4];
ll gds[3001][3001];
int main(){
ll R,C,K;
cin>>R>>C>>K;
rep(i,K){
ll r,c,v;
cin>>r>>c>>v;
gds[r-1][c-1]=v;
}
rep(i,3){
dp[0][0][i]=gds[0]... |
#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 - 1][c - 1] = v;
rep(i, ... |
#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;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
ll dp[5000][5000][4];
int val[5000][5000];
int main(){
int h,w,K;cin>>h>>w>>K;
rep(i,K){
int r,c... |
#include<bits/stdc++.h>
using namespace std;
int n,k,mm[3030][3030],m;
long long f[3030][3030][4];
int main() {
int r,v,c;
scanf("%d%d%d",&n,&m,&k);
for (int i = 1;i <= k; i++) {
scanf("%d%d%d",&r,&c,&v);
mm[r][c] = v;
}
for (int i = 1;i <= n; i++)
for (int j = 1;j <= m; j++) {
f[i][j][0] = max(f[i][j... |
#include <bits/stdc++.h>
using namespace std;
long long f[3010][3010][4];
int r, c, k;
int v[3010][3010];
int main() {
scanf("%d%d%d", &r, &c, &k);
while (k--) {
int x, y; scanf("%d%d", &x, &y);
scanf("%d", &v[x][y]);
}
for (int i = 1; i <= r; ++i)
for (int j = 1; j <= c; ++j) {
f[i][j][0] = max(f[i][j -... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define sz(x) ((int)(x.size()))
int n, m, k;
long long a[3000][3000];
long long dp[3000][3000][4];
long long memo(int x, int y, int r) {
if(x < 0 || y < 0) return 0;
if(dp[x][y][r] != -1) return dp[x][y][r];
long long res = memo(x-1, y, 3);
res = ma... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
int h, w, k, vs[3005][3005], r, c, v;
ll dp[3005][3005][4];
inline void chmax(ll &a, ll b){if(a<b) a=b;}
int main(){
scanf("%d%d%d", &h, &w, &k);
rep(i,k){
scanf("%d%d%d", &r, &c, &v);
vs[r-1][c-1] = v;
... |
#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(){
ll 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;
long long dp[3005][3005][4];
long long item[3005][3005];
int main() {
int r, c, k;
cin >> r >> c >> k;
for ( int i = 0; i < k; i++ ) {
int ri, ci;
long long vi;
cin >> ri >> ci >> vi;
item[ri][ci] = vi;
}
for ( int i = 1; i <= r; i++ ) {
for... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#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;
a[r-1][c-1] = v;
}
... |
#include<bits/stdc++.h>
using namespace std;
const int N = 3005;
int n, m, k, a[N][N];
long long dp[N][N][4];
long long yo(int i, int j, int k) {
if (i > n || j > m) return 0;
long long &ret = dp[i][j][k];
if (ret != -1) return ret;
long long ans = yo(i + 1, j, 0) + (k < 3 ? a[i][j] : 0);
if (k < 3) ans = max(ans... |
#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(cnt<0||y<0||x<0)return -1e18;
if(~memo[y][x][cnt])return memo[y][x][cnt];
int res=f(y,x,cnt-1);
chmax(... |
#include <bits/stdc++.h>
using namespace std;
int r, c, k;
int grid[3005][3005];
long long memo[3005][3005][5];
long long dp(int i, int j, int rem) {
if (memo[i][j][rem] != -1) return memo[i][j][rem];
long long cur = 0;
if (rem == 0) {
if (i <= r) return memo[i][j][rem] = dp(i + 1, j, 3);
else retu... |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(void){
int R,C,K; cin>>R>>C>>K;
vector<vector<ll>> rcv(R+1,vector<ll>(C+1,0));
for(int i=0; i<K; ++i){ int r,c; cin>>r>>c; cin>>rcv[r][c];}
vector<vector<vector<ll>>> dp(R+2,vector<vector<ll>>(C+2,vector<ll>(4,0)));
for(int i=1; i<=R;... |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using pq = priority_queue<ll, vector<ll>, greater<ll>>;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll dp[... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
ll dp[3010][3010][4];
ll cost[3010][3010];
int main(){
int r,c,k;
cin >> r >> c >> k;
rep(i,k){
int x,y;
... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define mod 1000000007
#define chmax(x,y) x=max(x,y)
//2020/9/16 @ST
int d[3005][3005] = { 0 };
ll dp[3005][3005][4] = { 0 };
int main() {
int r, c, k;
cin >> r >> c >> k;
rep(i, k) {
int rk, ck, vk... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define M 1000000007
#define INF ((1LL<<62LL) - 1)
const int N = 3005;
int a[N][N];
int dp[N][N][4];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r,c,k; cin >> r >> c >> k;
for(int i=0;i<k;i++){
int x,y... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3105][3105][5];
ll ara[3105][3105];
ll n,m,k;
ll call(ll i,ll j,ll tot)
{
if(i>n || j>m )
return 0;
ll &sum=dp[i][j][tot];
if(~sum)
return sum;
sum=0;
if(tot==3)
{
sum=(call(i+1,j,0));
... |
#include<bits/stdc++.h>
using namespace std;
int R,C,K;
long long r[200005],c[200005],v[200005];
long long a[3005][3005];
long long f[3005][3005][4];
int main()
{
scanf("%d%d%d",&R,&C,&K);
for(int i=1;i<=K;++i)
{
scanf("%lld%lld%lld",&r[i],&c[i],&v[i]);
a[r[i]][c[i]]+=v[i];
}
for(int i=1;i<=R;++i)
{
for(int... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll>vec;
ll val[3009][3009];
ll dp[3009][3009][4];
ll n,m;
ll call(ll a,ll b,ll c)
{
if(b>m)
{
return 0;
}
if(a>n)
{
return 0;
}
if(dp[a][b][c]!=-1)
{
return dp[a][b][c];
}
ll x,y;... |
#include<bits/stdc++.h>
using namespace std;
int n,m,k,r,c,v,a[3005][3005];
long long ans,dp[3005][3005][5];
int main()
{
cin>>n>>m>>k;
for(int i=1;i<=k;i++)
{
cin>>r>>c>>v;
a[r][c]=v;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
dp[i][j][0]=dp[i][j-1][0];
for(int k=0;k<=3;k++)
{
dp[i][j][0... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[3105][3105][5];
ll ara[3105][3105];
ll n,m,k;
ll call(ll i,ll j,ll tot)
{
if(i>n || j>m )
return 0;
ll &sum=dp[i][j][tot];
if(~sum)
return sum;
sum=0;
if(tot==3)
{
sum=(call(i+1,j,0));
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[3003][3003][5];
ll item[3003][3003];
void chmax(ll &a, ll b) {
a = max(a, b);
}
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;
item[r - 1][c - 1] = v;
}
for (int i = 0;... |
#include <bits/stdc++.h>
using namespace std;
long long dp[3005][3005][4];
int main(){
int R, C, K; cin >> R >> C >> K;
vector<vector<long long>> table(R, vector<long long>(C));
for(int i=0; i<K; ++i){
int r, c, v;
cin >> r >> c >> v;
r--; c--;
table[r][c]... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define rep3(i, s, n) for (int i = (s); i <=(int) (n); i++)
#define chmax(x,y) x = max(x,y)
long long a[3005][3005];
long long dp[3005][3005][5];
int main() {
i... |
#include <bits/stdc++.h>
using namespace std;
int n,m,k;
long long dp[3010][3010][5];
int a,b;
long long v[3010][3010];
int main(){
cin>>n>>m>>k;
long long c;
for(int i=1;i<=k;i++){
cin>>a>>b>>c;
v[a][b]=c;
}
long long mx=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
for(int kk=1;kk<=3;kk++){
dp[i... |
#include <bits/stdc++.h>
using namespace std;
void chmax(int64_t& a, int64_t b){
a = max(a, b);
}
int main(){
int N, M, K;
cin >> N >> M >> K;
static int A[3001][3001];
while(K--){
int a, b, c;
cin >> a >> b >> c;
A[a-1][b-1] = c;
}
static int64_t dp[3001][3001][5]... |
#include<bits/stdc++.h>
using namespace std;
long long DP[3030][3030][5];
long long val[3030][3030];
int main()
{
int R,C,N;
cin>>R>>C>>N;
for(int i=0;i<N;i++)
{
int x,y,v;
cin>>x>>y>>v;
val[x][y]=v;
}
if(val[1][1])
DP[1][1][1]=val[1][1];
for(int i=1;i<=R;i++)
for(int j=1;j<=C;j++)
for(int k=0;k<=3;... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3000 + 10;
typedef long long ll;
int n, m, k, val[MAXN][MAXN];
ll f[4][MAXN][MAXN];
int main() {
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= k; ++i) {
int x, y, _val; scanf("%d %d %d", &x, &y, &_val);
val[x][y] = _val;
}
for (int i = 1; ... |
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long int
struct goods{
ll x, y, val;
};
ll dp[3001][3001][4], val[3001][3001];
int main(){
ll r, c, n, x, y, ans=0;
cin>>r>>c>>n;
for (ll i=1; i<=n; i++) cin>>x>>y, cin>>val[x][y];
for (ll i=1; i<=r; i++){
for (ll ... |
#include <bits/stdc++.h>
using namespace std;
const int M = 3e3;
int n, m, mat[M][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 &r = memo[i][j][cnt];
if (r == -1) {
r = max(solve(i + 1, j, 0), solve(i, j + 1, cnt));
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,C,K;
cin >> R >> C >> K;
vector<vector<int>> m(R, vector<int>(C));
vector<vector<vector<long long>>> s(R+1, vector<vector<long long>>(C+1 ,vector<long long>(4)));
int r,c,v;
for(int i=0;i<K;i++){
cin >> r >> c >> v;
m[r-1][c-1] = v;... |
#include <iostream>
using namespace std;
long long r, c, k, a, b, w, g[3005][3005], dp[3005][3005][5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> r >> c >> k;
for (int i = 0; i < k; i++){
cin >> a >> b >> w;
g[a][b] = w;
}
for (int i = 1; i <= r; i++){
... |
/**
* author: RM07
* created: August 15, 2020 7:00 PM
* motto: Knowledge is Power, Strive for Excellence
**/
#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"... |
#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;
using ll = long long;
ll dp[3010][3010][4];
ll pt[3010][3010];
int main()
{
ll r,c,k;
cin >> r >> c >> k;
for(int i = 0;i<k;i++)
{
ll r,c,v;
cin >> r >> c >> v;
r--;c--;
pt[r][c]=v;
}
for(int i = 0;i<r;i++)
{
for(int j = 0;j<c;j++)
{
for(int k = 0;k<... |
#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(... |
#include <bits/stdc++.h>
using namespace std;
int R, C;
int V[3005][3005];
int64_t dp[5][3005][3005];
int64_t f(int rem, int r, int c) {
if (r == R && c == C) {
if (rem) return V[r][c];
return 0;
}
if (dp[rem][r][c] != -1) return dp[rem][r][c];
int64_t ans = -1e18;
if (c < C) ans = max(ans, f(rem, r, c+1));
... |
#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;
typedef pair<int, int> P;
int a[3005][3005];
ll dp[3005][3005][4];
int main(){
int r, c, k; cin >> r >> c >> k;
rep(i, k){
int ri, ci, v; cin >> ri >> ci >> v;
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
long long dp[N][N][4];
int v[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int r, c, k;
cin >> r >> c >> k;
while (k--) {
int x, y;
cin >> x >> y >> v[x][y];
}
for (int i = 1; i <= r; ++i) {
for (int ... |
// E - Picking Goods
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define chmax(x,y) x=max(x,(y))
int V[3000+1][3000+1];
ll dp[3000+1][3000+1][3+1];
int main(){
int R, C, K; cin>>R>>C>>K;
rep(i, K){
int r, c, v; cin>>r>>c>>v;
V[r][c] = v;
}
... |
#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>
#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;
a[r... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>>v;
ll r,c,k;
ll dp[3005][3005][10];
ll dfs(ll i,ll j,ll cp){
if(i>r || j>c)return 0;
if(dp[i][j][cp]!=-1)return dp[i][j][cp];
ll ans=0;
if(v[i][j]!=0 && cp>0){
ll ans1=v[i][j]+dfs(i,j+1,cp-1);
ll ans2=v[... |
#include<iostream>
#include<queue>
#include<algorithm>
#include<vector>
using namespace std;
int R,C,K;
int v[3003][3003];
long dp[3003];
long tmp[4][3003];
int main()
{
cin>>R>>C>>K;
for(int i=0;i<K;i++)
{
int r,c,va;cin>>r>>c>>va;
r--,c--;
v[r][c]=va;
}
for(int i=0;i<R;i++)
{
for(int j=0;j<4;j++)for(int... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
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--;
Item[r][c]=v;
}
rep(i,R)re... |
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
long long int items[3005][3005];
long long int dp[3005][3005][4];
int main() {
int r, c, k;
scanf("%d%d%d", &r, &c, &k);
for (int l = 0; l < k; l ++) {
int i, j, v;
scanf("%d%d%d", &i, &j, &v);
items[i][j] = v;
}
for (int i = 1; i <... |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#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 INF = 1e9;
int a[3005][3005];
ll dp[3005][3005][4];
//配列はグローバルで定義した方がいい？
int main(){
... |
#include<iostream>
#include<algorithm>
#define N 3001
using namespace std;
int r,c,n,i,j,d[N][N],a,b,x;
long long e[N][N][4];
bool v[N][N][4];
long long w(int x,int y,int k){
if(x>r||y>c)return 0;
if(x==r&&y==c)return k<3?d[x][y]:0;
if(v[x][y][k])return e[x][y][k];
v[x][y][k]=1;
e[x][y][k]=max(w(x+1... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=3005;
int n,m,k,a[N][N],dp[N][N][4];
void chmax(int &a,int b){if(a<b)a=b;}
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>m>>k;
for(int i=1;i<=k;i++)
{
int x,y,v;
cin>>x>>y>>v;
a[x][y]=v;
}
dp[1][1][1]=a[1][1];
for(int i=1... |
//後日挑戦
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
ll v[3005][3005];
ll dp[3005][3005][4];
int main() {
int r,c,k;
cin >> r >> c >> k;
rep(i,k){
int x,y,z;
... |
#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 <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int R, C, k;
cin >> R >> C >> k;
vector<int> r(k,0), c(k,0), v(k,0);
rep(i,k) cin >> r[i] >> c[i] >> v[i];
vector<vector<int>> arr(R,vector<int>(C));
rep(i,k) arr[r[i]-1][c[... |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
#define chmax(x,y) x=max(x,y)
int a[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C... |
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
const int N = 3005;
const long long INF = 0x3f3f3f3f3f3f3f3f;
int n, m, k;
long long g[N][N], f[N][N][5];
int main()
{
scanf("%d%d%d", &n, &m, &k);
for(int i = 0, r, c; i < k; ++i)
{
scanf("%d%d", &r, &c);
scanf("%l... |
#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 <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define chmax(x, y) x = max(x, y)
using namespace std;
using ll = long long;
// dp[i][j][k] ((i,j)にいるときの最大値. その行で既にk個のアイテムを選んだとき(k <= K))
int table[3005][3005];
ll dp[3005][3005][4];
int main() {
int R, C, K;
cin >> R >> C >> K;
rep(i,... |
#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, int row, int col) {
if(r > row-1 || c > col-1 || 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, row, c... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=2e5+10;
const int mod=998244353;
int a[3005][3005];
ll dp[3005][3005][5];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int r,c,k;
cin>>r>>c>>k;
while(k--)
... |
#include <bits/stdc++.h>
using namespace std;
long long r, c, k, v[3004][3004], dp[3004][3004][3];
long long cal(int i, int j, int cnt){
if(cnt == 3) return cal(i+1, j, 0);
if(i >= r || j >= c) return 0;
long long& ret = dp[i][j][cnt];
if(ret != -1) return ret;
ret = max(cal(i+1, j, 0), c... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans=0,f[3005][3005][4];
int n,m,K,a[3005][3005];
int main(){
cin>>n>>m>>K;
for(int i=1;i<=K;i++){
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++)f[i][j][k]=max(f[i-1... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=3010;
int a[maxn][maxn];
bool vis[maxn];
ll dp[3005][3005][4];
int main()
{
int n,m,k;
cin>>n>>m>>k;
for( int i=1;i<=k;i++ )
{
int x,y,w;
cin>>x>>y>>w;
a[x][y]=w;
}
dp[1][1][1]=a[1][1... |
#include<bits/stdc++.h>
using namespace std;
const int N=3e3+7;
long long dp[N][N][4],v[N][N];
int main()
{
int r,c,n;
scanf("%d%d%d",&r,&c,&n);
for(int i=0;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
scanf("%lld",&v[x][y]);
}
for(int i=1;i<=r;i++)
{
for(int j=1;j<=c;j++)
{
int is=v[i][j]?1:0;
for(... |
#include<iostream>
using namespace std;
long long maps[3005][3005]={0};
long long dp[3005][3005][5]={0};
int main(){
int h,w;
int k;
cin>>h>>w;
cin>>k;
for(int i=0;i<k;i++){
int r,c,v;
cin>>r>>c>>v;
maps[r][c]=v;
}
dp[1][1][1]=maps[1][1];
for(int i=1;i<=h;i++){
for(int j=1;j<=w... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=3010;
LL dp[N][N][4],mp[N][N];
int main()
{
int n,m,nn;
scanf("%d%d%d",&n,&m,&nn);
for(int i=1;i<=nn;i++)
{
int r,c;
scanf("%d%d",&r,&c);
scanf("%lld",&mp[r][c]);
}
for(int i=1;i<=n;i++)
{
... |
#include <bits/stdc++.h>
#define maxn 3001
using namespace std;
typedef long long LL;
int n,m,k;
int ar[maxn][maxn];
LL dp[maxn][maxn][4];
LL f(int r , int c , int d) {
if(dp[r][c][d] != -1)
return dp[r][c][d];
dp[r][c][d] = 0;
if(r < n) {
dp[r][c][d] = max( dp[r][c][d] , f(r+1,c,0) );
dp[r][c][d] = max( dp[... |
#include<bits/stdc++.h>
using namespace std;
#define chmax(a, b) a = max(a, b);
long long dp[3005][3005][4];
int main()
{
int r, c, n;
cin >> r >> c >> n;
vector<vector<int>> d(3000, vector<int>(3000));
for(int i = 0; i < n; i++) {
int h, w, v;
cin >> h >> w >> v;
d[h - 1][w - 1] = v;
}
for(int i = 0; i ... |
#include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
ll r,c,k,a,b,d,dp[3001][3001][4],v[3001][3001];
int main(){
cin>>r>>c>>k;
for(int i=1;i<=k;i++){cin>>a>>b>>d;v[a][b]=d;}
for(int i=1;i<=r;i++){
for(int j=1;j<=c;j++){
for(int k=0;k<=3;k++){
dp[i][j][k]=max(dp[i][j-1][k],dp[i-1][j... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll N = 3e3 + 5;
ll R,C,K,a[N][N],f[N][N][4];
int main... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
const ll sz=3010;
ll dp[sz][sz][4];
ll R,C;
ll ara[sz][sz];
ll cholo(ll r,ll c, ll rem)
{
ll &ret=dp[r][c][rem];
if(~ret) return ret;
ll mx=0;
if(rem>0) mx=ara[r][c];
if(r+1<=R){
if(rem>0) m... |
#include<cstdio>
#include<vector>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=3333;
int a[N][N];
ll f[N][N][4];
int n,m,k;
int main(){
int x,y,v;
scanf("%d%d%d",&n,&m,&k);
for (int i=1; i<=k; i++){
scanf("%d%d%d",&x,&y,&v);
a[x][y]=v;
}
for (in... |
#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;
cin >> r >> c >> k;
rep(i,r+1){
rep(j,c+1){
rep(p,5){
... |
#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;
ll V[3005][3005];
ll dp[3005][3005][4];
int main() {
ll R, C, K; cin >> R >> C >> K;
rep(i, K){
ll r, c, v; cin >> r >> c >> v;
r--; c--;
V[r][c]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.