Submission #492383

#	Time	Username	Problem	Language	Result	Execution time	Memory
492383		NhatMinh0208	Nice sequence (IZhO18_sequence)	C++14	0 / 100	8 ms	14416 KiB

sequence

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> gt[200001];
int par[200001][20];
int dep[200001];
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[400001];
set<int> buc[200001];
void dfs(int x, int p) {
	par[x][0]=p;
 // cout<<x<<' '<<p<<endl;
	dep[x]=dep[p]+1;
	for (int i=1;i<20;i++) {
		par[x][i]=par[par[x][i-1]][i-1];
	}
	for (auto g :gt[x]) if (g-p) dfs(g,x);
}
int lca(int u, int v) {
	for (int i=19;i>=0;i--) if (dep[u]-(1<<i)>=dep[v]) u=par[u][i];
	for (int i=19;i>=0;i--) if (dep[v]-(1<<i)>=dep[u]) v=par[v][i];
	if (u==v) return u;
	for (int i=19;i>=0;i--) if (par[u][i]!=par[v][i]) {
		u=par[u][i];
		v=par[v][i];
	}
	return par[u][0];
}
void change(int a, int b) {
	buc[arr[a*2-1]].erase(a*2-1);
	if (a>1) {
		buc[arr[a*2-2]].erase(a*2-2);
	}
	if (a<m) {
		buc[arr[a*2]].erase(a*2);
	}
	arr[2*a-1]=b;
	buc[arr[a*2-1]].insert(a*2-1);
	if (a>1) {
		arr[a*2-2]=lca(arr[a*2-3],arr[a*2-1]);
		buc[arr[a*2-2]].insert(a*2-2);
	}
	if (a<m) {
		arr[a*2]=lca(arr[a*2-1],arr[a*2+1]);
		buc[arr[a*2]].insert(a*2);
	}
}
int find(int l, int r, int x) {
	auto it = buc[x].lower_bound(2*l-1);
	if (it == buc[x].end() || (*it)>(2*r-1)) return -1;
	else return (*it);
}
int main()
{
	fio;
	cin>>n>>m>>t;
	for (i=1;i<n;i++) {
      cin>>u>>v;
		gt[u].push_back(v);
		gt[v].push_back(u);
	}
	dfs(1,1);
	for (i=1;i<=m;i++) {
		cin>>arr[i*2-1];
	}
	for (i=1;i<m;i++) {
		arr[i*2]=lca(arr[i*2-1],arr[i*2+1]);
	}
	for (i=1;i<=2*m-1;i++) {
		buc[arr[i]].insert(i);
	}
	for (t1=0;t1<t;t1++) {
		cin>>u;
     // for (i=1;i<=2*m-1;i++) cout<<arr[i]<<' '; cout<<endl;
		if (u==1) {
			cin>>a>>b;
			change(a,b);
		}
		else {
			cin>>a>>b>>v;
			u=find(a,b,v);
			if (u==-1) cout<<-1<<' '<<-1;
			else if (u&1) {
				cout<<(u+1)/2<<' '<<(u+1)/2;
			}
			else {
				cout<<(u/2)<<' '<<(u/2)+1;
			}
			cout<<endl;
		}
	}
}

Compilation message (stderr)

sequence.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 0 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24