#754659 (C++11) No.1898 Battle and Exchange

• 問題: No.1898 Battle and Exchange
• ユーザー: leaf_1415
• 提出日時: 2022-04-16 21:15:17
• 言語: C++11 (gcc 11.4.0)
• 結果: TLE
• 実行時間: -
• コード長: 9,855 bytes
• コンパイル時間: 1,414 ms
• コンパイル使用メモリ: 118,864 KB
• 実行使用メモリ: 35,004 KB
• 最終ジャッジ日時: 2024-06-07 16:33:50
• 合計ジャッジ時間: 25,184 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	5 ms; 8,064 KB
testcase_01	AC	6 ms; 8,064 KB
testcase_02	AC	5 ms; 8,192 KB
testcase_03	AC	6 ms; 8,064 KB
testcase_04	AC	5 ms; 8,064 KB
testcase_05	AC	6 ms; 8,064 KB
testcase_06	AC	8 ms; 8,192 KB
testcase_07	AC	7 ms; 7,936 KB
testcase_08	AC	6 ms; 7,936 KB
testcase_09	AC	21 ms; 8,832 KB
testcase_10	AC	5 ms; 8,064 KB
testcase_11	AC	6 ms; 8,064 KB
testcase_12	AC	6 ms; 8,064 KB
testcase_13	AC	5 ms; 8,064 KB
testcase_14	AC	6 ms; 8,192 KB
testcase_15	AC	5 ms; 8,192 KB
testcase_16	AC	7 ms; 8,064 KB
testcase_17	AC	53 ms; 8,832 KB
testcase_18	AC	308 ms; 11,264 KB
testcase_19	AC	757 ms; 13,312 KB
testcase_20	AC	323 ms; 12,544 KB
testcase_21	AC	2,544 ms; 22,016 KB
testcase_22	AC	6 ms; 8,064 KB
testcase_23	AC	6 ms; 8,064 KB
testcase_24	AC	6 ms; 8,064 KB
testcase_25	AC	6 ms; 8,192 KB
testcase_26	AC	5 ms; 8,064 KB
testcase_27	AC	9 ms; 8,448 KB
testcase_28	AC	11 ms; 8,320 KB
testcase_29	AC	15 ms; 9,216 KB
testcase_30	AC	7 ms; 8,192 KB
testcase_31	AC	5 ms; 8,192 KB
testcase_32	AC	1,431 ms; 15,488 KB
testcase_33	AC	2,002 ms; 21,120 KB
testcase_34	AC	1,120 ms; 14,208 KB
testcase_35	AC	2,209 ms; 17,920 KB
testcase_36	AC	980 ms; 16,768 KB
testcase_37	AC	271 ms; 10,496 KB
testcase_38	TLE	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-
testcase_48	--	-
testcase_49	--	-
testcase_50	--	-
testcase_51	--	-
testcase_52	--	-
testcase_53	--	-
testcase_54	--	-
testcase_55	--	-
testcase_56	--	-
testcase_57	--	-
testcase_58	--	-
testcase_59	--	-
testcase_60	--	-

ソースコード

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

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

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const int mod = 1000000007;
const int mod = 998244353;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
template<typename T> T comb2(ll n, ll k){ T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}

vector<int> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}

template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}


struct DoubleMultiset{
	ll lsum, hsum, lkeep;
	multiset<ll> lowS, highS;

	DoubleMultiset(){lsum = hsum = 0, lkeep = 0;}
	int size(){return (int)lowS.size() + (int)highS.size();}
	void add(ll x){
		if(highS.size() && *highS.begin() <= x) highS.insert(x), hsum += x;
		else lowS.insert(x), lsum += x;
		adjust();
	}
	void erase(ll x){
		if(highS.size() && *highS.begin() <= x) highS.erase(highS.lower_bound(x)), hsum -= x;
		else lowS.erase(lowS.lower_bound(x)), lsum -= x;
		adjust();
	}
	void adjust(){
		while(lowS.size() > lkeep){
			hsum += *lowS.rbegin();
			lsum -= *lowS.rbegin();
			highS.insert(*lowS.rbegin());
			auto it = lowS.end(); it--; lowS.erase(it);
		}
		while(lowS.size() < lkeep && highS.size()){
			lsum += *highS.begin();
			hsum -= *highS.begin();
			lowS.insert(*highS.begin());
			highS.erase(highS.begin());
		}
	}
	void adjustl(ll x){
		lkeep = x;
		adjust();
	}
	void adjusth(ll x){
		lkeep = size() - x;
		adjust();
	}
	ll get(){return lsum;}
};


ll n, m;
vector<ll> G[100005];
vector<ll> vec[100005];
ll sum[100005];
bool used[100005];

bool check(ll x)
{
	rep(i, 1, n) used[i] = false;
	set<P> S;
	used[1] = true;
	for(auto u : G[1]) S.insert(P(sum[u], u)), used[u] = true;
	
	DoubleMultiset dm;
	dm.add(1), dm.add(1), dm.add(x);
	for(auto x : vec[1]) dm.add(x);
	dm.adjusth(3);
	
	bool flag = false;
	while(1){
		ll v = S.begin()->se, s = dm.hsum;
		if(!flag) s = vec[1].back() + x + 1;
		if(sum[v] >= s) return false;
		if(v == n) return true;
		S.erase(S.begin());
		for(auto x : vec[v]) dm.add(x);
		dm.adjusth(3);
		for(auto u : G[v]) if(!used[u]) S.insert(P(sum[u], u)), used[u] = true;
		flag = true;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	ll u, v;
	rep(i, 1, m){
		cin >> u >> v;
		G[u].pb(v);
		G[v].pb(u);
	}
	ll x;
	rep(i, 1, n){
		rep(j, 1, 3){
			cin >> x;
			vec[i].pb(x);
			sum[i] += x;
		}
		sort(all(vec[i]));
	}
	
	ll ub = 1e9, lb = sum[1]-2, mid;
	while(ub-lb>1){
		mid = (ub+lb)/2;
		if(check(mid)) ub = mid;
		else lb = mid;
	}
	outl(ub, 1, 1);
	
	return 0;
}