제출 #1201579

#제출 시각아이디문제언어결과실행 시간메모리
1201579BehruzbekXSeptember (APIO24_september)C++17
100 / 100
112 ms11392 KiB
#include <bits/stdc++.h> using namespace std; int solve(int n, int m, std::vector<int> p, std::vector<std::vector<int>> s) { vector<vector<int>> a(n); for (int i = 1; i < n; i++) { a[p[i]].emplace_back(i); } vector<int> v(n), c(n); int ans = 0; int l = 0, r = 0; for (int i = 0; i < n - 1; i++) { int x = s[0][i]; if (v[p[x]]) l--; v[x] = 1; for (int u : a[x]) if (!v[u]) l++; for (int j = 0; j < m; j++) { int y = s[j][i]; if (c[y] == 0) r++; c[y]++; if (c[y] == m) --r; } if (!l && !r) ans++; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...