結果

問題 No.818 Dinner time
ユーザー 👑 Enjapma_kyoproEnjapma_kyopro
提出日時 2019-04-13 20:27:44
言語 C++11
(gcc 4.8.5)
結果
WA   .
(最新)
AC  
(最初)
実行時間 -
コード長 3,175 Byte
コンパイル時間 571 ms
使用メモリ 43,744 KB
最終ジャッジ日時 2020-07-05 12:40:26

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 12 ms
33,500 KB
testcase_01 AC 13 ms
33,504 KB
testcase_02 AC 12 ms
33,504 KB
testcase_03 AC 13 ms
33,500 KB
testcase_04 AC 13 ms
33,504 KB
testcase_05 AC 13 ms
33,500 KB
testcase_06 AC 13 ms
33,500 KB
testcase_07 AC 12 ms
33,504 KB
testcase_08 AC 12 ms
33,500 KB
testcase_09 WA -
testcase_10 AC 12 ms
33,500 KB
testcase_11 WA -
testcase_12 AC 13 ms
33,500 KB
testcase_13 AC 12 ms
33,504 KB
testcase_14 AC 12 ms
33,500 KB
testcase_15 AC 13 ms
33,500 KB
testcase_16 AC 13 ms
33,500 KB
testcase_17 AC 83 ms
43,744 KB
testcase_18 AC 62 ms
39,644 KB
testcase_19 AC 67 ms
39,648 KB
testcase_20 AC 84 ms
41,692 KB
testcase_21 AC 78 ms
41,696 KB
testcase_22 AC 63 ms
39,648 KB
testcase_23 AC 71 ms
41,692 KB
testcase_24 AC 98 ms
43,744 KB
testcase_25 AC 71 ms
41,692 KB
testcase_26 AC 61 ms
39,644 KB
testcase_27 AC 86 ms
41,696 KB
testcase_28 AC 73 ms
41,696 KB
testcase_29 AC 92 ms
43,740 KB
testcase_30 AC 80 ms
41,696 KB
testcase_31 AC 84 ms
41,696 KB
testcase_32 AC 73 ms
41,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pd(x) cerr<<"//"<<(x)<<endl;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r;
ll x[500005],y[500005],z[500005];
ll dp[500005][6],sc[500005][6];
bool check[5005];
char s[500005],t[500005];
bool flag,dame;

ll  fact[400005];
ll rfact[400005];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<400000; i++){
        fact[i] = (fact[i-1]*i) % mod;
        rfact[i] = rui(fact[i],mod - 2);
    }
}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;
}

int main(){
	cin >> n >> m;
	for(i=1;i<=n;i++){
		cin >> x[i] >> y[i];
	}
	for(i=1;i<=n;i++){
		sc[i][0] = 0;
		sc[i][1] = max(x[i],y[i]);
		if(x[i] > 0){
			sc[i][2] = max(x[i],y[i]) + x[i] * (m - 1);
		}else if(x[i] < 0){
			sc[i][2] = max(y[i],x[i]*m);
		}else{
			sc[i][2] = max(0ll,y[i]);
		}
	}
	dp[1][2] = sc[1][2];
	for(i=2;i<=n;i++){
		dp[i][2] = dp[i-1][2] + sc[i][2];

		dp[i][1] = dp[i-1][1] + sc[i][1];
		dp[i][1] = max(dp[i][1],dp[i-1][2] + sc[i][1]);

		dp[i][0] = dp[i-1][0] + sc[i][0];
		dp[i][0] = max(dp[i][0],dp[i-1][2] + sc[i][0]);
		dp[i][0] = max(dp[i][0],dp[i-1][1] + sc[i][0]);

		for(j=0;j<3;j++){
			//pe(dp[i][j]);
		}
		//el;
	}
	ans = -INF;
	for(i=0;i<3;i++){
		ans = max(ans,dp[n][i]);
	}
	p(ans);
	return 0;
}
0