Submission #730716

#	Time	Username	Problem	Language	Result	Execution time	Memory
730716		shadow_sami	Regions (IOI09_regions)	C++17	0 / 100	8061 ms	131072 KiB

regions

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans,q;
const ll mx = 2e5+5;
const ll mx2 = 25000+5;
const ll mod = 1e9+7;
const ll block = 350;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi adj[mx],v[mx];
ll arr[mx];
ll col[mx];
ll where[mx];
ll start[mx];
ll eend[mx];
unordered_map<ll,ll> umap[mx2];
ll pref[mx];
ll timer = 1;
bool vis[mx];

void dfs(ll u,ll par){
	arr[timer] = u;
	start[u] = timer;
	timer++;
	fx(adj[u])
		if(x!=par)
			dfs(x,u);
	eend[u] = timer-1;
	return;
}


int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m>>q>>col[1];

        fip(2,n+1){
        	cin>>tp;
        	adj[tp].push_back(i);
        	cin>>col[i];
        }
        dfs(1,-1);
        fip(1,n+1)
        	where[start[i]] = i;
        fip(1,n+1)
        	v[col[i]].push_back(start[i]);
        fip(1,n+1){
        	if(vis[col[i]])
        		continue;
        	srt(v[col[i]]);
        	if(v[col[i]].size()<=block)
        	vis[col[i]] = 1;
        	memset(pref,0,sizeof(pref));
        	fx(v[col[i]]){        		
        		pref[start[where[x]]]++;
        		pref[eend[where[x]]-1]--;
        	}
        	fjp(1,n+1){
        		pref[j] += pref[j-1];
        		umap[col[i]][col[where[j]]] += pref[j];
        	}
        }
        while(q--){
        	ll a,b;
        		cin>>a>>b;
        		if(v[a].size()>block){
        			cout<<umap[a][b]<<nli;
        		}else{
        			ans = 0;
        			fx(v[a]){
        				ll ff = start[where[x]];ll rr = eend[where[x]];
        				ll ptr1,ptr2;
        				ptr1 = upper_bound(v[b].begin(),v[b].end(),ff) - v[b].begin();
        				ptr2 = upper_bound(v[b].begin(),v[b].end(),rr) - v[b].begin();
        				if(ptr2){
        					ptr2--;
        					ans += max(0ll,ptr2-ptr1+1);
        				}
        			}
        			cout<<ans<<nli;
        		}
        	}


    // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 85