YODANESS - Yodaness Level

Author: Ismail Hosen

Daffodil International University

Problem Link

//Please follow from main function

	#include<bits/stdc++.h>
	using namespace std;
	/// Typedef
	typedef long long ll;
	typedef unsigned long ul;
	typedef unsigned long long ull;
	typedef vector<int> vi;
	typedef vector<vi> vvi;
	typedef vector<ll> vll;
	typedef pair<int,int> pii;
	typedef pair<ll,ll> pll;
	typedef vector< pii > vii;
	#define pb push_back
	#define ppb pop_back
	#define MP make_pair
	#define ff first
	#define ss second
	#define sf scanf
	#define pf printf
	#define SQR(x) ((x)*(x))
	#define loop(i, y) for(int i=0; i<int(y); i++)
	#define FOR(i, x, y) for(int i=int(x); i<=int(y); i++)
	#define ROF(i, x, y) for(int i=int(x); i>=int(y); i--)
	#define ALL(c) c.begin(), c.end()
	#define SZ(c) int(c.size())
	#define CLR(x, y) memset(x, y, sizeof(x))
	#define READ(f) freopen(f, "r", stdin)
	#define WRITE(f) freopen(f, "w", stdout)
	#define FastIO ios_base::sync_with_stdio(false)
	#define tr(it, container) for(auto it = container.begin(); it != container.end(); it++)
	#define sci(x) scanf("%d", &x)
	#define scii(x, y) scanf("%d %d", &x, &y)
	#define sciii(x, y, z) scanf("%d %d %d", &x, &y, &z)
	#define scl(x) scanf("%lld", &x)
	#define scll(x, y) scanf("%lld %lld", &x, &y)
	#define sclll(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
	#define bitCheck(N,in) ((bool)(N&(1<<(in))))
	#define bitOff(N,in) (N&(~(1LL<<(in))))
	#define bitOn(N,in) (N|(1LL<<(in)))
	#define bitFlip(a,k) (a^(1LL<<(k)))
	#define unq(v) sort(all(v)), (v).erase(unique(all(v)),v.end())
	#define common(a,b) sort(all(a)), sort(all(b)), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
	#define uncommon(a,b) sort(all(a)), sort(all(b)), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())
	#define dbg(x) cout<<#x<<" = "<<x<<endl;
	template <class T> inline T bigMod(T p,T e,T M){ ll ret = 1; for(; e > 0; e >>= 1){ if(e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T) ret;}
	template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
	template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
	template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
	template <class T> inline string int2String(T a){ostringstream str; str<<a; return str.str();}
	const int dr[] = { 0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
	const int dc[] = { 1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
	#define for1(a,b) for(ll i=a; i<b; i++)
	#define rev(v) reverse(v.begin(),v.end())
	#define srt(v) sort(v.begin(),v.end())
	#define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())
	/// Constants
	#define mx 100001
	#define MOD 1000000009
	#define base 1000000007
	#define eps 1e-9
	#define INF 1llu<<61 // 2,305,843,009,213,693,952
	#define inf 1<<29 // 536,870,912
	#define PI acos(-1.0) // 3.1415926535897932
	#define rn return
	int tree[mx*3];
	int arr[mx];
	void init(int node, int b, int e, int v){
	if(v<b || v>e)return;
	if(b==e && b==v){
	tree[node]=1;
	rn;
	}
	int mid=(b+e)/2;
	int lft=node*2;
	int rft=lft+1;
	init(lft,b,mid,v);
	init(rft,mid+1,e,v);
	tree[node]=tree[lft]+tree[rft];
	}
	int query(int node, int b, int e, int i, int j)
	{
	if (i > e || j < b) return 0;
	if (b >= i and e <= j)
	return tree[node];
	int Left = node << 1;
	int Right = (node << 1) + 1;
	int mid = (b + e) >> 1;
	ll p1 = query(Left, b, mid, i, j);
	ll p2 = query(Right, mid + 1, e, i, j);
	return p1 + p2;
	}
	int main()
	{
	// FastIO;
	#ifdef online
	clock_t tstart = clock();
	READ("input.txt");
	WRITE("output.txt");
	#endif // online
	int t;
	sci(t);
	//cout<<t<<endl;
	FOR(k,1,t){
	int n;
	sci(n);
	CLR(tree,0);
	map<string, int>mp;
	string s;
	loop(i, n){
	cin>>s;
	mp[s]=i;
	}
	loop(i, n){
	cin>>s;
	arr[i]=mp[s];
	}
	int ans=0;
	loop(i, n){
	init(1, 0, n-1, arr[i]);
	ans+=query(1,0,n-1,arr[i]+1, n);
	}
	cout<<ans<<endl;
	}
	#ifdef online
	fprintf(stderr, "\n>>Runtime: %.10lf\n", (double)(clock()-tstart)/CLOCKS_PER_SEC);
	#endif // online
	return 0;
	}

view raw YODANESS - Yodaness Level.cpp hosted with ❤ by GitHub