#900456 (C++17) No.2408 Lakes and Fish

• 問題: No.2408 Lakes and Fish
• ユーザー: nonon
• 提出日時: 2023-08-11 21:42:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 172 ms / 2,000 ms
• コード長: 2,145 bytes
• コンパイル時間: 4,265 ms
• コンパイル使用メモリ: 263,164 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-18 15:43:01
• 合計ジャッジ時間: 7,597 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	153 ms; 5,248 KB
testcase_05	AC	153 ms; 5,248 KB
testcase_06	AC	144 ms; 5,248 KB
testcase_07	AC	171 ms; 5,248 KB
testcase_08	AC	171 ms; 5,248 KB
testcase_09	AC	172 ms; 5,248 KB
testcase_10	AC	171 ms; 5,248 KB
testcase_11	AC	90 ms; 5,248 KB
testcase_12	AC	124 ms; 5,248 KB
testcase_13	AC	34 ms; 5,248 KB
testcase_14	AC	71 ms; 5,248 KB
testcase_15	AC	138 ms; 5,248 KB
testcase_16	AC	49 ms; 5,248 KB
testcase_17	AC	39 ms; 5,248 KB
testcase_18	AC	82 ms; 5,248 KB
testcase_19	AC	130 ms; 5,248 KB
testcase_20	AC	127 ms; 5,248 KB
testcase_21	AC	135 ms; 5,248 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using db = long double;
using ch = char;
using bl = bool;
using st = string;
using pll = pair<ll,ll>;
using psl = pair<st,ll>;
using vst = vector<st>;
using vch = vector<ch>;
using vvch = vector<vch>;
using vbl = vector<bl>;
using vvbl = vector<vbl>;
using vdb = vector<db>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using vpsl = vector<psl>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vvvvvll = vector<vvvvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
#define drep(i,n) for(ll i=(ll)n-1; i>=0; i--)
#define drrep(i,a,b) for(ll i=(ll)a; i>=(ll)b; i--)

using mint = modint998244353;
// using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>; 
using vvvm = vector<vvm>;

const ll mod = 998244353;
const ll INF = 3e18;

template<class T> inline bool chmin(T& a, T b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}

template<class T> inline bool chmax(T& a, T b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll a, ll b) {
	if (a==0)return b;
	if (b==0)return a;
	ll c=a;
	while(a%b!=0){
		c=a%b;
		a=b;
		b=c;
	}
	return b;
}

ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}

ll Pow(ll a, ll n){
	ll res=1;
	while(n>0){
		if(n%2==1)res*=a;
		a*=a;
		n/=2;
	}
	return res;
}

ll Pow(ll a, ll n, ll p){
	ll res=1;
	while(n>0){
		a%=p;
		if(n%2==1)res*=a;
		a*=a;
		res%=p;
		n/=2;
	}
	return res;
}

void yn(bl ok){
	if(ok==true){
		cout << "Yes" << endl;
	}
	else{
		cout << "No" << endl;
	}
	return;
}

ll N,M,L[100010];

int main(){
	cin>>N>>M;
	rrep(i,1,N)cin>>L[i];
	L[0]=-INF;
	L[N+1]=INF;
	N+=2;
	ll ans=0;
	rep(i,M)
	{
		ll F,B,W;
		cin>>F>>B>>W;
		ll d1=F-*(lower_bound(L,L+N,F)-1);
		ll d2=*lower_bound(L,L+N,F)-F;
		ll d=min(d1,d2);
		ans+=max(B,W-d);
	}
	cout << ans << endl;
	return 0;
}