#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 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){
arr[timer] = u;
start[u] = timer;
timer++;
fx(adj[u])
dfs(x);
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];
cout.flush();
fip(2,n+1){
cin>>tp;
cout.flush();
adj[tp].push_back(i);
cin>>col[i];
cout.flush();
}
dfs(1);
fip(1,n+1)
where[start[i]] = i;
fip(1,n+1)
v[col[where[i]]].push_back(start[where[i]]);
cnt = 0;
fip(1,n+1){
if(vis[col[where[i]]])
continue;
if(v[col[where[i]]].size()<=block)
continue;
vis[col[where[i]]] = 1;
cnt++;
fjp(0,n+2)
pref[j] = 0;
fx(v[col[where[i]]]){
pref[start[where[x]]]++;
pref[eend[where[x]]+1]--;
}
fjp(1,n+1){
pref[j] += pref[j-1];
umap[col[where[i]]][col[where[j]]] += pref[j];
}
}
while(q--){
ll a,b;
cin>>a>>b;
if(v[a].size()>block){
cout<<umap[a][b]<<nli;
cout.flush();
}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(0,ptr2-ptr1+1);
}
}
cout<<ans<<nli;
cout.flush();
}
}
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
10992 KB |
Output is correct |
| 2 |
Correct |
8 ms |
11136 KB |
Output is correct |
| 3 |
Correct |
8 ms |
11088 KB |
Output is correct |
| 4 |
Correct |
10 ms |
11088 KB |
Output is correct |
| 5 |
Correct |
8 ms |
11088 KB |
Output is correct |
| 6 |
Correct |
30 ms |
11088 KB |
Output is correct |
| 7 |
Correct |
37 ms |
11148 KB |
Output is correct |
| 8 |
Correct |
52 ms |
11248 KB |
Output is correct |
| 9 |
Correct |
60 ms |
11508 KB |
Output is correct |
| 10 |
Correct |
102 ms |
11668 KB |
Output is correct |
| 11 |
Correct |
119 ms |
11856 KB |
Output is correct |
| 12 |
Correct |
160 ms |
12324 KB |
Output is correct |
| 13 |
Correct |
196 ms |
12112 KB |
Output is correct |
| 14 |
Correct |
286 ms |
12648 KB |
Output is correct |
| 15 |
Correct |
301 ms |
14592 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2111 ms |
16104 KB |
Output is correct |
| 2 |
Correct |
1906 ms |
15224 KB |
Output is correct |
| 3 |
Correct |
3094 ms |
17604 KB |
Output is correct |
| 4 |
Correct |
334 ms |
12752 KB |
Output is correct |
| 5 |
Correct |
390 ms |
14032 KB |
Output is correct |
| 6 |
Correct |
476 ms |
30472 KB |
Output is correct |
| 7 |
Correct |
1296 ms |
29016 KB |
Output is correct |
| 8 |
Correct |
1297 ms |
58848 KB |
Output is correct |
| 9 |
Correct |
2187 ms |
20096 KB |
Output is correct |
| 10 |
Runtime error |
655 ms |
131072 KB |
Execution killed with signal 9 |
| 11 |
Correct |
3799 ms |
20344 KB |
Output is correct |
| 12 |
Correct |
1268 ms |
23940 KB |
Output is correct |
| 13 |
Correct |
1725 ms |
23900 KB |
Output is correct |
| 14 |
Correct |
2029 ms |
37948 KB |
Output is correct |
| 15 |
Correct |
3073 ms |
28032 KB |
Output is correct |
| 16 |
Correct |
3385 ms |
31692 KB |
Output is correct |
| 17 |
Correct |
3079 ms |
44892 KB |
Output is correct |
