#456482 (C++14) No.1030 だんしんぐぱーりない

提出ソース

結果

問題	No.1030 だんしんぐぱーりない
ユーザー	Thistle
提出日時	2020-04-02 02:55:42
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,990 bytes
コンパイル時間	2,676 ms
コンパイル使用メモリ	150,356 KB
実行使用メモリ	36,568 KB
最終ジャッジ日時	2024-07-03 00:41:00
合計ジャッジ時間	34,649 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-

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

ソースコード

raw source code

#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>

using namespace std;
using ll = int_fast64_t;
using ld = long double;
#define int ll
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)
#define range(i,v) for(auto& (i) : v)
#define mkp make_pair
#define mem(x,k) memset(x,k,sizeof(x))
#define vec vector
#define pb emplace_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(ll)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define itn int
#define pri_que priority_queue
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cdf int q810; cin>>q810; rep(q114,q810) 
#define cyes cout<<"Yes\n"
#define cno cout<<"No\n"
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
	if (!fact_[0]) {
		fact_[0] = 1; comp_[0] = 1;
		for (int i = 1; i < fn_; i++)
			fact_[i] = fact_[i - 1] * i % Mod;
		comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
		for (int i = fn_ - 2; i > 0; i--)
			comp_[i] = comp_[i + 1] * (i + 1) % Mod;
	}
	if (x < y) return 0;
	return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
class LCA {
	int n;
	int table[MXN][25];
	vec<int>(*e)[MXN];
	int dep[MXN];
public:
	void init(const int& size, vector<int>(&f)[MXN]) {
		n = size;
		e = &f;
		for (int i = 0; i <= n; i++) for (int j = 0; j < 25; j++)
			table[i][j] = -1;
	}
	void build(const int& st) {
		dfs(st, -1, 0);
		for (int j = 0; j < 24; j++)for (int i = 0; i <= n; i++) {
			if (table[i][j] > -1) table[i][j + 1] = table[table[i][j]][j];
		}
	}
	int get(int x, int y) {
		if (dep[x] > dep[y]) swap(x, y);
		for (int i = 24; i >= 0; i--) {
			if (((dep[y] - dep[x]) >> i) & 1) y = table[y][i];
		}
		if (x == y) return x;
		for (int i = 24; i >= 0; i--) {
			if (table[x][i] != table[y][i]) {
				x = table[x][i], y = table[y][i];
			}
		}
		return table[x][0];
	}
	int operator[](const int& x) const {
		return dep[x];
	}
private:
	void dfs(int v, int p, int d) {
		table[v][0] = p;
		dep[v] = d;
		for (auto& to : (*e)[v]) {
			if (to != p) dfs(to, v, d + 1);
		}
	}
};
int n, k, q;
vec<int>a, c;
int dp[200000];
LCA lca;
int rr;
vec<int>e[MXN];
int dat[400000];
void update(int x, int y) {
	x += rr - 1;
	dat[x] = y;
	while (x > 0) {
		x = (x - 1) / 2;
		dat[x] = dat[x * 2 + 1];
		if (dat[x * 2 + 2] >= 0) dat[x] = lca.get(dat[x], dat[x * 2 + 2]);
	}
}
int query(int i, int a, int b, int l, int r) {
	if (b <= l || r <= a) return -1;
	if (a <= l && r <= b) return dat[i];
	int x = query(i * 2 + 1, a, b, l, (l + r) / 2);
	int y = query(i * 2 + 2, a, b, (l + r) / 2, r);
	if (x < y) swap(x, y);
	if (x >= 0 && y >= 0) return lca.get(x, y);
	return x;
}
int query(int a, int b) {
	return query(0, a, b, 0, rr);
}
void dfs(int x, int p, int v) {
	dp[x] = v;
	for (auto g : e[x]) {
		if (g == p) continue;
		dfs(g, x, max(v, c[g]));
	}
}
void solve(string s) {
	ofstream ofs(s);
	cin >> n >> k >> q;
	a.clear(); c.clear();
	rep(i, n) c.pb(read());
	rep(i, k) a.pb(read() - 1);
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--; v--;
		e[u].pb(v); e[v].pb(u);
	}
	rep(i, 400000) dat[i] = -1;
	lca.init(n, e);
	lca.build(0);
	rr = 1;
	while (rr < k) rr *= 2;
	rep(i, k) update(i, a[i]);
	dfs(0, -1, c[0]);
	while (q > 0) {
		q--;
		int t, x, y; cin >> t >> x >> y;
		if (t == 1) {
			x--; y--;
			a[x] = y;
			update(x, y);
		}
		else {
			x--;
			int r = query(x, y);
			cout << dp[r] << endl;
		}
	}
}
void ddfs(int x, int p, int d) {
	dp[x] = d;
	for (auto g : e[x]) {
		if (g == p) continue;
		ddfs(g, x, d + 1);
	}
}
mt19937 rnd;
int tim;
void generate(string s) {
	ofstream ifs(s);
	int gg = 10000;
	if (tim <= 4) gg = 1;
	n = rnd() % (10 * gg) + 1;
	k = rnd() % (10 * gg) + 1;
	q = rnd() % (6 * gg) + 4 * gg;
	if (tim >= 35) {
		n = 100000;
		k = 100000;
		q = 100000;
	}
	ifs << n << " " << k << " " << q << endl;
	c.resize(n); a.resize(k);
	rep(i, n) e[i].clear();
	rep(i, n) {
		c[i] = rnd() % (10000 * gg) + 1;
		ifs << c[i] << ssp(i, n);
	}
	rep(i, k) {
		a[i] = rnd() % n + 1;
		ifs << a[i] << ssp(i, k);
	}
	vec<int>b;
	rep(i, n) b.pb(i);
	shuffle(all(b), rnd);
	vec<H>f;
	rng(i, 1, n) {
		int t = rnd() % i;
		e[b[i]].pb(b[t]);
		e[b[t]].pb(b[i]);
		f.pp(b[i], b[t]);
	}
	ddfs(0, -1, 0);
	rep(i, n - 1) {
		if (dp[f[i].fs] < dp[f[i].sc]) swap(f[i].fs, f[i].sc);
		ifs << f[i].fs + 1 << " " << f[i].sc + 1 << endl;
	}
	rep(i, q) {
		int t = rnd() % 2 + 1;
		int x, y;
		if (t == 1) {
			x = rnd() % k + 1;
			y = rnd() % n + 1;
			ifs << t << " " << x << " " << y << endl;
		}
		else {
			x = rnd() % k + 1;
			y = rnd() % (k - x + 1) + x;
			ifs << t << " " << x << " " << y << endl;
		}
	}
}
signed main() {
	rep(i, 40) {
		string s = "input/";
		if (i < 9) s += "0";
		s += to_string(i + 1);
		s += ".txt";
		tim = i;
		generate(s);
		cout << i + 1 << endl;
	}
}

yukicoder

結果

テストケース

ソースコード