#752517 (C++17) No.1898 Battle and Exchange

提出ソース

結果

問題	No.1898 Battle and Exchange
ユーザー	heno239
提出日時	2022-04-08 21:48:27
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,912 bytes
コンパイル時間	2,493 ms
コンパイル使用メモリ	167,640 KB
実行使用メモリ	36,864 KB
最終ジャッジ日時	2024-05-06 07:23:32
合計ジャッジ時間	56,558 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	19 ms 11,520 KB
testcase_01	AC	20 ms 11,648 KB
testcase_02	AC	20 ms 11,520 KB
testcase_03	WA	-
testcase_04	AC	22 ms 11,776 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	134 ms 12,544 KB
testcase_10	WA	-
testcase_11	AC	20 ms 11,520 KB
testcase_12	AC	38 ms 11,776 KB
testcase_13	AC	20 ms 11,520 KB
testcase_14	AC	27 ms 11,776 KB
testcase_15	AC	19 ms 11,648 KB
testcase_16	WA	-
testcase_17	AC	87 ms 13,056 KB
testcase_18	WA	-
testcase_19	AC	808 ms 19,840 KB
testcase_20	AC	791 ms 20,736 KB
testcase_21	AC	3,409 ms 34,432 KB
testcase_22	AC	20 ms 11,520 KB
testcase_23	AC	24 ms 11,776 KB
testcase_24	AC	22 ms 11,776 KB
testcase_25	AC	27 ms 11,648 KB
testcase_26	AC	20 ms 11,520 KB
testcase_27	AC	59 ms 12,032 KB
testcase_28	AC	78 ms 12,032 KB
testcase_29	AC	173 ms 12,404 KB
testcase_30	AC	32 ms 11,776 KB
testcase_31	AC	21 ms 11,648 KB
testcase_32	AC	526 ms 19,712 KB
testcase_33	WA	-
testcase_34	AC	333 ms 18,304 KB
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	219 ms 14,336 KB
testcase_38	AC	3,215 ms 36,224 KB
testcase_39	AC	2,649 ms 31,256 KB
testcase_40	AC	2,442 ms 33,568 KB
testcase_41	AC	2,296 ms 29,808 KB
testcase_42	AC	63 ms 12,800 KB
testcase_43	AC	1,742 ms 28,416 KB
testcase_44	AC	20 ms 11,520 KB
testcase_45	AC	117 ms 13,696 KB
testcase_46	WA	-
testcase_47	AC	111 ms 12,800 KB
testcase_48	AC	259 ms 13,824 KB
testcase_49	AC	57 ms 11,776 KB
testcase_50	AC	55 ms 11,904 KB
testcase_51	AC	50 ms 11,904 KB
testcase_52	AC	93 ms 12,160 KB
testcase_53	WA	-
testcase_54	AC	567 ms 13,648 KB
testcase_55	AC	442 ms 14,924 KB
testcase_56	AC	610 ms 14,920 KB
testcase_57	WA	-
testcase_58	AC	3,983 ms 36,864 KB
testcase_59	AC	3,490 ms 36,864 KB
testcase_60	AC	4,285 ms 36,864 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-2;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;

const string drul = "DRUL";
//DRUL
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

void solve() {
	int n, m; cin >> n >> m;
	vector<vector<int>> G(n);
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	vector<vector<int>> v(n, vector<int>(3));
	rep(i, n) {
		rep(j, 3) {
			cin >> v[i][j];
		}
		sort(all(v[i]));
	}
	vector<int> sum(n);
	rep(i, n)rep(j, 3)sum[i] += v[i][j];
	auto can = [&](int x)->bool {
		if (x <= sum[0])return false;
		vector<int> cur = { 1,1,x - 2 };
		swap(cur[1], v[0][2]);
		int scur = cur[0] + cur[1] + cur[2];
		bool exi = false;
		for (int to : G[0]) {
			if (sum[to] < scur)exi = true;
		}
		if (!exi) {
			return false;
		}
		multiset<int> st;
		auto getsum = [&]() {
			int res = 0;
			auto itr = st.end();
			rep(j, 3) {
				itr--;
				res += *itr;
			}
			return res;
		};
		priority_queue<P, vector<P>, greater<P>> q;
		vector<bool> used(n);
		used[0] = true;
		st.insert(1); st.insert(1); st.insert(x - 2);
		rep(j, 3)st.insert(v[0][j]);
		for (int to : G[0]) {
			q.push({ sum[to],to });
		}
		while (q.size() && q.top().first < getsum()) {
			int id = q.top().second; q.pop();
			if (used[id])continue;
			used[id] = true;
			rep(j, 3)st.insert(v[id][j]);
			for (int to : G[id])q.push({ sum[to],to });
		}
		return used[n - 1];
	};
	int le = 0, ri = mod;
	while (ri - le > 1) {
		int mid = (le + ri) / 2;
		if (can(mid))ri = mid;
		else le = mid;
	}
	cout << 1 << " " << 1 << " " << ri - 2 << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード