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

• 問題: No.2408 Lakes and Fish
• ユーザー: *yudai25n
• 提出日時: 2023-12-06 22:33:30
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 185 ms / 2,000 ms
• コード長: 1,704 bytes
• コンパイル時間: 4,421 ms
• コンパイル使用メモリ: 265,492 KB
• 実行使用メモリ: 7,168 KB
• 最終ジャッジ日時: 2024-09-27 01:49:57
• 合計ジャッジ時間: 8,899 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
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	2 ms; 5,376 KB
testcase_04	AC	165 ms; 7,168 KB
testcase_05	AC	165 ms; 7,168 KB
testcase_06	AC	159 ms; 7,168 KB
testcase_07	AC	182 ms; 7,168 KB
testcase_08	AC	183 ms; 7,168 KB
testcase_09	AC	183 ms; 7,168 KB
testcase_10	AC	185 ms; 7,168 KB
testcase_11	AC	95 ms; 5,376 KB
testcase_12	AC	130 ms; 6,016 KB
testcase_13	AC	37 ms; 5,376 KB
testcase_14	AC	74 ms; 5,376 KB
testcase_15	AC	145 ms; 6,272 KB
testcase_16	AC	52 ms; 5,376 KB
testcase_17	AC	40 ms; 5,376 KB
testcase_18	AC	89 ms; 5,376 KB
testcase_19	AC	136 ms; 6,016 KB
testcase_20	AC	129 ms; 5,632 KB
testcase_21	AC	145 ms; 6,144 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 1e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
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;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//


int main () {
    int n , m;
    cin >> n >> m;
    vector<long long> l(n) , f(m) , b(m) , w(m);
    rep(i , n) cin >> l[i];
    l.push_back(LINF);
    l.push_back(-LINF);
    sort(all(l));
    rep(i , m) cin >> f[i] >> b[i] >> w[i];
    long long sum = 0;
    rep(i , m) {
        auto it = lower_bound(all(l) , f[i]);
        auto it2 = it-1;
        long long cost = min(abs(f[i]-*it) , abs(f[i]-*it2));
        if(w[i]-b[i]>cost) sum += w[i]-cost;
        else sum += b[i];
    }
    cout << sum << endl;
	return 0;
}