#459954 (C++14) No.1014 competitive fighting

• 問題: No.1014 competitive fighting
• ユーザー: heno239
• 提出日時: 2020-04-07 14:49:58
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 267 ms / 2,000 ms
• コード長: 6,130 bytes
• コンパイル時間: 2,579 ms
• コンパイル使用メモリ: 143,476 KB
• 実行使用メモリ: 92,452 KB
• 最終ジャッジ日時: 2023-09-21 19:37:56
• 合計ジャッジ時間: 12,188 ms
• ジャッジサーバーID （参考情報）: judge15 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 7,460 KB
testcase_01	AC	3 ms; 7,456 KB
testcase_02	AC	3 ms; 7,476 KB
testcase_03	AC	3 ms; 7,608 KB
testcase_04	AC	3 ms; 7,432 KB
testcase_05	AC	242 ms; 67,740 KB
testcase_06	AC	244 ms; 67,808 KB
testcase_07	AC	254 ms; 68,004 KB
testcase_08	AC	252 ms; 67,736 KB
testcase_09	AC	250 ms; 67,828 KB
testcase_10	AC	261 ms; 92,452 KB
testcase_11	AC	181 ms; 64,572 KB
testcase_12	AC	267 ms; 67,748 KB
testcase_13	AC	119 ms; 37,012 KB
testcase_14	AC	114 ms; 36,912 KB
testcase_15	AC	124 ms; 37,692 KB
testcase_16	AC	9 ms; 9,208 KB
testcase_17	AC	52 ms; 21,580 KB
testcase_18	AC	237 ms; 66,404 KB
testcase_19	AC	253 ms; 67,852 KB
testcase_20	AC	99 ms; 36,120 KB
testcase_21	AC	220 ms; 66,012 KB
testcase_22	AC	135 ms; 38,148 KB
testcase_23	AC	56 ms; 22,392 KB
testcase_24	AC	56 ms; 22,104 KB
testcase_25	AC	15 ms; 10,916 KB
testcase_26	AC	218 ms; 65,628 KB
testcase_27	AC	51 ms; 21,576 KB
testcase_28	AC	52 ms; 21,928 KB
testcase_29	AC	5 ms; 7,932 KB
testcase_30	AC	254 ms; 67,600 KB
testcase_31	AC	221 ms; 66,020 KB
testcase_32	AC	5 ms; 7,956 KB
testcase_33	AC	14 ms; 10,836 KB
testcase_34	AC	168 ms; 63,520 KB
testcase_35	AC	181 ms; 64,680 KB
testcase_36	AC	165 ms; 63,380 KB
testcase_37	AC	9 ms; 9,124 KB
testcase_38	AC	99 ms; 36,372 KB
testcase_39	AC	51 ms; 22,016 KB
testcase_40	AC	97 ms; 36,372 KB
testcase_41	AC	89 ms; 35,512 KB
testcase_42	AC	179 ms; 64,432 KB
testcase_43	AC	14 ms; 10,800 KB
testcase_44	AC	174 ms; 64,084 KB
testcase_45	AC	93 ms; 35,996 KB
testcase_46	AC	24 ms; 14,312 KB
testcase_47	AC	50 ms; 21,716 KB
testcase_48	AC	167 ms; 63,336 KB
testcase_49	AC	9 ms; 9,128 KB
testcase_50	AC	177 ms; 64,108 KB
testcase_51	AC	94 ms; 35,956 KB
testcase_52	AC	9 ms; 9,080 KB
testcase_53	AC	265 ms; 67,792 KB

コンパイルメッセージ

main.cpp: メンバ関数 ‘std::vector<long long int> graph::query(std::vector<long long int>, int)’ 内:
main.cpp:211:44: 警告: ‘ss’ may be used uninitialized [-Wmaybe-uninitialized]
  211 |                                 memo[i] += ss;
      |                                            ^~
main.cpp:194:39: 備考: ‘ss’ はここで定義されています
  194 |                                 int u,ss;
      |                                       ^~
main.cpp:212:38: 警告: ‘u’ may be used uninitialized [-Wmaybe-uninitialized]
  212 |                                 res[u] = memo[i];
      |                                      ^
main.cpp:194:37: 備考: ‘u’ はここで定義されています
  194 |                                 int u,ss;
      |                                     ^

ソースコード

#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<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#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;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return 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, int 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)); }
const int max_n = 1 << 18;
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];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

struct graph {
private:
	int n;
	vector<vector<int>> G, rG;
	vector<bool> used;
	vector<int> vs;

	int mk;
	vector<vector<int>> fG;
	vector<vector<int>> ori;
	vector<int> trans;
public:
	graph(int sz) {
		n = sz;
		G.resize(n);
		rG.resize(n);
		used.resize(n);

		fG.resize(n);
		trans.resize(n, -1);
		ori.resize(n);
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		rG[b].push_back(a);
	}
	void dfs(int v) {
		used[v] = true;
		rep(i, G[v].size()) {
			if (!used[G[v][i]])dfs(G[v][i]);
		}
		vs.push_back(v);
	}
	void rdfs(int v, int k) {
		used[v] = true;
		queue<int> q; q.push(v);
		vector<int> c;
		while (!q.empty()) {
			int id = q.front(); q.pop();
			ori[k].push_back(id);
			rep(j, rG[id].size()) {
				int to = rG[id][j];
				if (used[to]) {
					if (trans[to] >= 0)c.push_back(trans[to]);
					continue;
				}
				used[to] = true; q.push(to);
			}
		}
		sort(c.begin(), c.end());
		int len = unique(c.begin(), c.end()) - c.begin();
		rep(i, len) {
			fG[c[i]].push_back(k);
		}
		rep(i, ori[k].size()) {
			trans[ori[k][i]] = k;
		}
	}
	void scc() {
		fill(used.begin(), used.end(), false);
		rep(i, n) {
			if (!used[i])dfs(i);
		}
		fill(used.begin(), used.end(), false);
		int k = 0;
		per(i, (int)vs.size()) {
			if (!used[vs[i]]) {
				rdfs(vs[i], k); k++;
			}
		}
		mk = k;
	}
	vector<ll> query(vector<ll> c, int bef) {
		vector<ll> res(c.size());
		vector<ll> memo(mk);
		int sz = c.size();
		per(i, mk) {
			int cnt = 0;
			rep(j, ori[i].size()) {
				if (ori[i][j] >= bef - 1 && ori[i][j]<bef - 1 + sz) {
					cnt++;
				}
			}
			if (cnt >= 2) {
				memo[i] = INF;
				for (int id : ori[i]) {
					int tid = id - (bef - 1);
					if (tid >= 0 && tid < sz) {
						res[tid] = INF;
					}
				}
			}
			else if (cnt == 1) {
				int u,ss;
				for (int id : ori[i]) {
					int tid = id - (bef - 1);
					if (tid >= 0 && tid < sz) {
						u = tid;
						ss = c[tid];
					}
				}
				memo[i] = 0;
				for (int to : fG[i]) {
					if (memo[to] == INF) {
						memo[i] = INF; break;
					}
					else {
						memo[i] = max(memo[i], memo[to]);
					}
				}
				memo[i] += ss;
				res[u] = memo[i];
			}
			else {
				for (int to : fG[i]) {
					memo[i] = max(memo[i], memo[to]);
				}
			}
		}
		return res;
	}
};

int sz;
void add_seg(graph &g, int &fr, int a, int b, int k = 0, int l = 0, int r = -1) {
	if (r < 0)r = sz;
	if (r <= a || b <= l)return;
	else if (a <= l && r <= b) {
		g.add_edge(fr, k);
	}
	else {
		add_seg(g, fr, a, b, k * 2 + 1, l, (l + r) / 2);
		add_seg(g, fr, a, b, k * 2 + 2, (l + r) / 2, r);
	}
}
void solve() {
	int n; cin >> n;
	vector<pair<P,P>> v;
	rep(i, n) {
		int a, b, c; cin >> a >> b >> c;
		v.push_back({ {a,b - c},{b,i} });
	}
	vector<ll> cs(n);
	sort(all(v));
	rep(i, n)cs[i] = v[i].second.first;
	vector<int> x; rep(i, n)x.push_back(v[i].first.first);
	sz = 1;
	while (sz < n)sz *= 2;
	graph g(2 * sz - 1);
	rep(i, sz - 1) {
		g.add_edge(i, 2 * i + 1);
		g.add_edge(i, 2 * i + 2);
	}
	rep(i, n) {
		int id = upper_bound(all(x), v[i].first.second) - x.begin();
		int fr = i + sz - 1;
		if (id <= i) {
			add_seg(g, fr, 0, id);
		}
		else {
			add_seg(g, fr, 0, i);
			add_seg(g, fr, i + 1, id);
		}
	}
	g.scc();
	vector<ll> fans = g.query(cs, sz);
	vector<ll> ans(n);
	rep(i, n) {
		ans[v[i].second.second] = fans[i];
	}
	rep(i, n) {
		if (ans[i] >= INF)cout << "BAN\n";
		else cout << ans[i] << "\n";
	}
}


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