Submission #892833

#	Time	Username	Problem	Language	Result	Execution time	Memory
892833		vjudge1	Birthday gift (IZhO18_treearray)	C++17	30 / 100	4048 ms	29332 KiB

treearray

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("inline")
//#pragma GCC optimize("-fgcse,-fgcse-lm")
//#pragma GCC optimize("-ftree-pre,-ftree-vrp")
//#pragma GCC optimize("-ffast-math")
//#pragma GCC optimize("-fipa-sra")
//#pragma GCC optimize("-fpeephole2")
//#pragma GCC optimize("-fsched-spec")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz(a) int(a.size())
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 1e6 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
ll n, m, q;
vector<ll> g[N];
ll a[N];
ll d[N], up[N][22];

void dfs(ll v, ll p) {
	d[v] = d[p] + 1;
	up[v][0] = p;
	for (int i = 1;i <= 20;i++) up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto to : g[v]) {
		if (to == p) continue;
		dfs(to, v);
	}
}

ll lca(ll x, ll y) {
	if (d[x] < d[y]) swap(x, y);
	ll k = d[x] - d[y];
	for (int i = 20;i >= 0;i--) {
		if (k & (1 << i)) {
			x = up[x][i];
		}
	}
	if (x == y) return x;
	for (int i = 20;i >= 0;i--) {
		if (up[x][i] != up[y][i]) {
			x = up[x][i];
			y = up[y][i];
		}
	}
	return up[x][0];
}

void solve() {
	cin >> n >> m >> q;
	for (int i = 1;i < n;i++) {
		ll u, v; cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	for (int i = 1;i <= m;i++) cin >> a[i];
	dfs(1, 0);
	while (q--) {
		ll tp, l, r; cin >> tp >> l >> r;
		if (tp == 1) {
			a[l] = r;
		} else {
			ll v; cin >> v;
			bool f = 0;
			for (int x = l;x <= r;x++) {
				ll lc = a[x];
				for (int y = x;y <= r;y++) {
					lc = lca(lc, a[y]);
//					cout << x << sp << y << sp << lc << en;
					if (lc == v) {
						cout << x << sp << y << en;
						f = 1;
						x = r + 1;
						br;
					}
				}
			}
			if (!f) cout << -1 << sp << -1 << en;
		}
	}
}
   
int main() {      
    aboba    
//    freopen("cownomics");
//    precalc();
//    cin >> tt;
    for (int i = 1;i <= tt;i++) {
		solve();
    }
}

Compilation message (stderr)

treearray.cpp: In function 'void freopen(std::string)':
treearray.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44