제출 #872475

#제출 시각아이디문제언어결과실행 시간메모리
872475overwatch9Regions (IOI09_regions)C++17
55 / 100
3850 ms106200 KiB
#include <iostream> #include <set> #include <vector> #include <algorithm> #include <unordered_map> using namespace std; const int maxn = 1e5 * 2 + 10; const int maxr = 25000 + 10; int visit[maxn], finish[maxn], region[maxn]; vector <int> adj[maxn]; vector <int> region_members[maxr]; int big_region_id[maxr]; vector <int> r1r2[maxr]; vector <int> cnt_parents[maxn]; int t = 0; void dfs(int s) { visit[s] = t++; for (int i = 0; i < adj[s].size(); i++) dfs(adj[s][i]); finish[s] = t++; } int big_region_cnt = 0; void dfs2(int s, int p) { int id1 = big_region_id[region[s]]; int id2 = big_region_id[region[p]]; cnt_parents[s] = cnt_parents[p]; if (id2 != -1) cnt_parents[s][id2]++; if (id1 != -1) { for (int i = 0; i < big_region_cnt; i++) r1r2[i][id1] += cnt_parents[s][i]; } for (int i = 0; i < adj[s].size(); i++) dfs2(adj[s][i], s); } int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); int n, r, q; cin >> n >> r >> q; cin >> region[1]; region_members[region[1]].push_back(1); for (int i = 2; i <= n; i++) { int x; cin >> x; adj[x].push_back(i); cin >> region[i]; region_members[region[i]].push_back(i); } fill(big_region_id, big_region_id + maxr, -1); for (int i = 1; i <= r; i++) { if (region_members[i].size() > 500) big_region_id[i] = big_region_cnt++; } for (int i = 1; i <= n; i++) { cnt_parents[i].resize(big_region_cnt); if (i <= big_region_cnt) r1r2[i].resize(big_region_cnt); } dfs(1); vector <vector <int>> starts(r+1); for (int i = 1; i <= r; i++) { for (int j = 0; j < region_members[i].size(); j++) starts[i].push_back(visit[region_members[i][j]]); sort(starts[i].begin(), starts[i].end()); } dfs2(1, 1); while (q--) { int r1, r2; cin >> r1 >> r2; if (big_region_id[r1] == -1) { // r1 = small int ans = 0; vector <int> &st = starts[r2]; for (int i = 0; i < region_members[r1].size(); i++) { auto l = upper_bound(st.begin(), st.end(), visit[region_members[r1][i]]); auto r = upper_bound(st.begin(), st.end(), finish[region_members[r1][i]]); if (r == st.begin()) continue; r--; int id1 = l - st.begin(); int id2 = r - st.begin(); ans += max(0, (id2 - id1 + 1)); } cout << ans << endl; } else if (big_region_id[r2] != -1) { // r2 = big int a = big_region_id[r1]; int b = big_region_id[r2]; cout << r1r2[a][b] << endl; } else { // r1 = big, r2 = small int ans = 0; for (int i = 0; i < region_members[r2].size(); i++) ans += cnt_parents[region_members[r2][i]][big_region_id[r1]]; cout << ans << endl; } } return 0; }

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

regions.cpp: In function 'void dfs(int)':
regions.cpp:18:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 0; i < adj[s].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
regions.cpp: In function 'void dfs2(int, int)':
regions.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < adj[s].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
regions.cpp: In function 'int main()':
regions.cpp:63:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (int j = 0; j < region_members[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:75:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for (int i = 0; i < region_members[r1].size(); i++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:92:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             for (int i = 0; i < region_members[r2].size(); i++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...