結果

問題 No.818 Dinner time
ユーザー ransewhale
提出日時 2019-04-19 23:34:44
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 787 bytes
コンパイル時間 1,503 ms
コンパイル使用メモリ 167,296 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-09-23 05:53:08
合計ジャッジ時間 3,448 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 4
other WA * 29
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
    inlined from 'int main()' at main.cpp:47:10:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'ans' may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:25:14: note: 'ans' was declared here
   25 |         ll m,ans,p=0ll,q=0ll;
      |              ^~~

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a += b;
	a %= MOD;
}

ll a[100100],b[100100];

int main(void){
	int n,i;
	ll m,ans,p=0ll,q=0ll;
	cin >> n >> m;
	for(i=0; i<n; ++i){
		cin >> a[i] >> b[i];
	}
	for(i=(n-1); i>0; --i){
		if(a[i]<0 && (!b[i]<0)){
			a[i] = 0;
		}
		if(p+a[i]<0ll){
			q = max(p*m+q+b[i],p+q+a[i]);
			p = 0ll;
		}else{
			p += a[i];
			q += max(b[i]-a[i],0ll);
		}
		q = max(0ll,q);
	}
	for(i=1; i<=m; ++i){
		ans = max(ans,p*i+q+a[0]*i);
		ans = max(ans,p*m+q+a[0]*(i-1)+b[0]);
	}
	cout << ans << endl;
	return 0;
}
0