제출 #933492

#제출 시각아이디문제언어결과실행 시간메모리
933492NourWaelRegions (IOI09_regions)C++17
100 / 100
3431 ms33644 KiB
#include <bits/stdc++.h> using namespace std; int const mxN = 2e5+1; int const mxR = 25001; vector<int> adj [mxN]; int in[mxN], out[mxN], t, r , n, region[mxN], q, cnt[mxR], c, ind[mxR]; int fin [500][mxR]; vector<pair<int,int>> reg [mxR]; vector<int> pre; void dfs ( int i, int p ) { in[i] = t, t++; for(auto it:adj[i]){ if(it==p) continue; dfs(it,i); } t++, out[i] = t; reg[region[i]].push_back({in[i],out[i]}); } void dfs2 ( int i, int p ) { for(int j=0; j<pre.size(); j++) { if(region[i]==pre[j]) continue; fin[j][region[i]] += cnt[pre[j]]; } cnt[region[i]]++; for(auto it:adj[i]){ if(it==p) continue; dfs2(it,i); } cnt[region[i]]--; } int main() { ios_base:: sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin>>n>>r>>q>>region[1]; c = sqrt(n); for(int i=2; i<=n; i++) { int k, h; cin>>k>>h; adj[i].push_back(k), adj[k].push_back(i); region[i] = h; } dfs(1,0); for(int i=1; i<=r; i++) { sort(reg[i].begin(),reg[i].end()); if(reg[i].size()>=c) { ind[i] = pre.size(); pre.push_back(i); } } dfs2(1,0); for(int i=0; i<q; i++) { int x,y; cin>>x>>y; int ans = 0; if(reg[x].size()>=c) { cout<<fin[ind[x]][y]<<endl; continue; } for(auto it:reg[x]) { int ind1 = lower_bound(reg[y].begin(),reg[y].end(), it ) - reg[y].begin(); int ind2 = lower_bound(reg[y].begin(),reg[y].end(), make_pair(it.second, 0) ) - reg[y].begin(); ans += ind2-ind1; } cout<<ans<<endl; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

regions.cpp: In function 'void dfs2(int, int)':
regions.cpp:21:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |      for(int j=0; j<pre.size(); j++) {
      |                   ~^~~~~~~~~~~
regions.cpp: In function 'int main()':
regions.cpp:50:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |       if(reg[i].size()>=c) { ind[i] = pre.size(); pre.push_back(i); }
      |          ~~~~~~~~~~~~~^~~
regions.cpp:56:23: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |       if(reg[x].size()>=c) { cout<<fin[ind[x]][y]<<endl; continue; }
      |          ~~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...